25.60/10.70 YES 25.60/10.70 25.60/10.70 Ultimate: Cannot open display: 25.60/10.70 This is Ultimate 0.1.24-8dc7c08-m 25.60/10.70 [2019-03-28 12:36:44,914 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.60/10.70 [2019-03-28 12:36:44,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.60/10.70 [2019-03-28 12:36:44,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.60/10.70 [2019-03-28 12:36:44,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.60/10.70 [2019-03-28 12:36:44,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.60/10.70 [2019-03-28 12:36:44,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.60/10.70 [2019-03-28 12:36:44,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.60/10.70 [2019-03-28 12:36:44,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.60/10.70 [2019-03-28 12:36:44,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.60/10.70 [2019-03-28 12:36:44,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.60/10.70 [2019-03-28 12:36:44,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.60/10.70 [2019-03-28 12:36:44,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.60/10.70 [2019-03-28 12:36:44,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.60/10.70 [2019-03-28 12:36:44,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.60/10.70 [2019-03-28 12:36:44,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.60/10.70 [2019-03-28 12:36:44,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.60/10.70 [2019-03-28 12:36:44,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.60/10.70 [2019-03-28 12:36:44,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.60/10.70 [2019-03-28 12:36:44,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.60/10.70 [2019-03-28 12:36:44,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.60/10.70 [2019-03-28 12:36:44,952 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.60/10.70 [2019-03-28 12:36:44,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.60/10.70 [2019-03-28 12:36:44,954 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.60/10.70 [2019-03-28 12:36:44,955 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.60/10.70 [2019-03-28 12:36:44,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.60/10.70 [2019-03-28 12:36:44,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.60/10.70 [2019-03-28 12:36:44,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.60/10.70 [2019-03-28 12:36:44,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.60/10.70 [2019-03-28 12:36:44,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.60/10.70 [2019-03-28 12:36:44,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.60/10.70 [2019-03-28 12:36:44,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.60/10.70 [2019-03-28 12:36:44,960 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.60/10.70 [2019-03-28 12:36:44,977 INFO L110 SettingsManager]: Loading preferences was successful 25.60/10.70 [2019-03-28 12:36:44,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.60/10.70 [2019-03-28 12:36:44,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.60/10.70 [2019-03-28 12:36:44,979 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.60/10.70 [2019-03-28 12:36:44,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.60/10.70 [2019-03-28 12:36:44,979 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.60/10.70 [2019-03-28 12:36:44,979 INFO L133 SettingsManager]: * Use SBE=true 25.60/10.70 [2019-03-28 12:36:44,980 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.60/10.70 [2019-03-28 12:36:44,980 INFO L133 SettingsManager]: * Use old map elimination=false 25.60/10.70 [2019-03-28 12:36:44,980 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.60/10.70 [2019-03-28 12:36:44,980 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.60/10.70 [2019-03-28 12:36:44,980 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.60/10.70 [2019-03-28 12:36:44,981 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.60/10.70 [2019-03-28 12:36:44,981 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.60/10.70 [2019-03-28 12:36:44,981 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.60/10.70 [2019-03-28 12:36:44,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.60/10.70 [2019-03-28 12:36:44,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.60/10.70 [2019-03-28 12:36:44,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.60/10.70 [2019-03-28 12:36:44,982 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.60/10.70 [2019-03-28 12:36:44,982 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.60/10.70 [2019-03-28 12:36:44,982 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.60/10.70 [2019-03-28 12:36:44,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.60/10.70 [2019-03-28 12:36:44,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.60/10.70 [2019-03-28 12:36:44,983 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.60/10.70 [2019-03-28 12:36:44,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.60/10.70 [2019-03-28 12:36:44,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.60/10.70 [2019-03-28 12:36:44,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.60/10.70 [2019-03-28 12:36:44,983 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.60/10.70 [2019-03-28 12:36:44,984 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.60/10.70 [2019-03-28 12:36:45,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.60/10.70 [2019-03-28 12:36:45,024 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.60/10.70 [2019-03-28 12:36:45,028 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.60/10.70 [2019-03-28 12:36:45,030 INFO L271 PluginConnector]: Initializing CDTParser... 25.60/10.70 [2019-03-28 12:36:45,030 INFO L276 PluginConnector]: CDTParser initialized 25.60/10.70 [2019-03-28 12:36:45,031 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.60/10.70 [2019-03-28 12:36:45,097 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9b97f14a4ef34361a55b98b5e8abc57a/FLAG8bcbc4ee6 25.60/10.70 [2019-03-28 12:36:45,452 INFO L307 CDTParser]: Found 1 translation units. 25.60/10.70 [2019-03-28 12:36:45,453 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.60/10.70 [2019-03-28 12:36:45,453 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.60/10.70 [2019-03-28 12:36:45,460 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9b97f14a4ef34361a55b98b5e8abc57a/FLAG8bcbc4ee6 25.60/10.70 [2019-03-28 12:36:45,850 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9b97f14a4ef34361a55b98b5e8abc57a 25.60/10.70 [2019-03-28 12:36:45,861 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.60/10.70 [2019-03-28 12:36:45,863 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.60/10.70 [2019-03-28 12:36:45,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.60/10.70 [2019-03-28 12:36:45,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.60/10.70 [2019-03-28 12:36:45,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.60/10.70 [2019-03-28 12:36:45,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:45" (1/1) ... 25.60/10.70 [2019-03-28 12:36:45,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d7d9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:45, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:45,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:45" (1/1) ... 25.60/10.70 [2019-03-28 12:36:45,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.60/10.70 [2019-03-28 12:36:45,898 INFO L176 MainTranslator]: Built tables and reachable declarations 25.60/10.70 [2019-03-28 12:36:46,065 INFO L206 PostProcessor]: Analyzing one entry point: main 25.60/10.70 [2019-03-28 12:36:46,077 INFO L191 MainTranslator]: Completed pre-run 25.60/10.70 [2019-03-28 12:36:46,097 INFO L206 PostProcessor]: Analyzing one entry point: main 25.60/10.70 [2019-03-28 12:36:46,177 INFO L195 MainTranslator]: Completed translation 25.60/10.70 [2019-03-28 12:36:46,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46 WrapperNode 25.60/10.70 [2019-03-28 12:36:46,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.60/10.70 [2019-03-28 12:36:46,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.60/10.70 [2019-03-28 12:36:46,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.60/10.70 [2019-03-28 12:36:46,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.60/10.70 [2019-03-28 12:36:46,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.60/10.70 [2019-03-28 12:36:46,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.60/10.70 [2019-03-28 12:36:46,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.60/10.70 [2019-03-28 12:36:46,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.60/10.70 [2019-03-28 12:36:46,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.60/10.70 [2019-03-28 12:36:46,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.60/10.70 [2019-03-28 12:36:46,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.60/10.70 [2019-03-28 12:36:46,252 INFO L276 PluginConnector]: RCFGBuilder initialized 25.60/10.70 [2019-03-28 12:36:46,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 25.60/10.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.60/10.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.60/10.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.60/10.70 [2019-03-28 12:36:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.60/10.70 [2019-03-28 12:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.60/10.70 [2019-03-28 12:36:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.60/10.70 [2019-03-28 12:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.60/10.70 [2019-03-28 12:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.60/10.70 [2019-03-28 12:36:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.60/10.70 [2019-03-28 12:36:46,601 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.60/10.70 [2019-03-28 12:36:46,602 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 25.60/10.70 [2019-03-28 12:36:46,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:46 BoogieIcfgContainer 25.60/10.70 [2019-03-28 12:36:46,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.60/10.70 [2019-03-28 12:36:46,604 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.60/10.70 [2019-03-28 12:36:46,604 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.60/10.70 [2019-03-28 12:36:46,606 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.60/10.70 [2019-03-28 12:36:46,607 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:46" (1/1) ... 25.60/10.70 [2019-03-28 12:36:46,625 INFO L313 BlockEncoder]: Initial Icfg 34 locations, 40 edges 25.60/10.70 [2019-03-28 12:36:46,627 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.60/10.70 [2019-03-28 12:36:46,628 INFO L263 BlockEncoder]: Using Maximize final states 25.60/10.70 [2019-03-28 12:36:46,628 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.60/10.70 [2019-03-28 12:36:46,629 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.60/10.70 [2019-03-28 12:36:46,631 INFO L296 BlockEncoder]: Using Remove sink states 25.60/10.70 [2019-03-28 12:36:46,631 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.60/10.70 [2019-03-28 12:36:46,632 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.60/10.70 [2019-03-28 12:36:46,658 INFO L185 BlockEncoder]: Using Use SBE 25.60/10.70 [2019-03-28 12:36:46,684 INFO L200 BlockEncoder]: SBE split 13 edges 25.60/10.70 [2019-03-28 12:36:46,690 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 25.60/10.70 [2019-03-28 12:36:46,692 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.60/10.70 [2019-03-28 12:36:46,731 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 25.60/10.70 [2019-03-28 12:36:46,734 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.60/10.70 [2019-03-28 12:36:46,736 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.60/10.70 [2019-03-28 12:36:46,736 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.60/10.70 [2019-03-28 12:36:46,736 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.60/10.70 [2019-03-28 12:36:46,737 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.60/10.70 [2019-03-28 12:36:46,737 INFO L313 BlockEncoder]: Encoded RCFG 24 locations, 40 edges 25.60/10.70 [2019-03-28 12:36:46,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:46 BasicIcfg 25.60/10.70 [2019-03-28 12:36:46,738 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.60/10.70 [2019-03-28 12:36:46,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.60/10.70 [2019-03-28 12:36:46,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.60/10.70 [2019-03-28 12:36:46,743 INFO L276 PluginConnector]: TraceAbstraction initialized 25.60/10.70 [2019-03-28 12:36:46,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:36:45" (1/4) ... 25.60/10.70 [2019-03-28 12:36:46,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344b6f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:46, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:46,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/4) ... 25.60/10.70 [2019-03-28 12:36:46,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344b6f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:46, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:46,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:46" (3/4) ... 25.60/10.70 [2019-03-28 12:36:46,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344b6f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:46, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:46,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:46" (4/4) ... 25.60/10.70 [2019-03-28 12:36:46,747 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.60/10.70 [2019-03-28 12:36:46,757 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.60/10.70 [2019-03-28 12:36:46,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. 25.60/10.70 [2019-03-28 12:36:46,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. 25.60/10.70 [2019-03-28 12:36:46,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.60/10.70 [2019-03-28 12:36:46,812 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.60/10.70 [2019-03-28 12:36:46,812 INFO L383 AbstractCegarLoop]: Hoare is true 25.60/10.70 [2019-03-28 12:36:46,812 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.60/10.70 [2019-03-28 12:36:46,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.60/10.70 [2019-03-28 12:36:46,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.60/10.70 [2019-03-28 12:36:46,813 INFO L387 AbstractCegarLoop]: Difference is false 25.60/10.70 [2019-03-28 12:36:46,813 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.60/10.70 [2019-03-28 12:36:46,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.60/10.70 [2019-03-28 12:36:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. 25.60/10.70 [2019-03-28 12:36:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.60/10.70 [2019-03-28 12:36:46,834 INFO L394 BasicCegarLoop]: Found error trace 25.60/10.70 [2019-03-28 12:36:46,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:46,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 25.60/10.70 [2019-03-28 12:36:46,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:46,841 INFO L82 PathProgramCache]: Analyzing trace with hash 174224749, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:46,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:46,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:46,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.70 [2019-03-28 12:36:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.70 [2019-03-28 12:36:47,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.60/10.70 [2019-03-28 12:36:47,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.60/10.70 [2019-03-28 12:36:47,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.60/10.70 [2019-03-28 12:36:47,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.60/10.70 [2019-03-28 12:36:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.60/10.70 [2019-03-28 12:36:47,037 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. 25.60/10.70 [2019-03-28 12:36:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.60/10.70 [2019-03-28 12:36:47,140 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. 25.60/10.70 [2019-03-28 12:36:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.60/10.70 [2019-03-28 12:36:47,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.60/10.70 [2019-03-28 12:36:47,154 INFO L225 Difference]: With dead ends: 24 25.60/10.70 [2019-03-28 12:36:47,155 INFO L226 Difference]: Without dead ends: 18 25.60/10.70 [2019-03-28 12:36:47,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.60/10.70 [2019-03-28 12:36:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.60/10.70 [2019-03-28 12:36:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.60/10.70 [2019-03-28 12:36:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.60/10.70 [2019-03-28 12:36:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 25.60/10.70 [2019-03-28 12:36:47,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. 25.60/10.70 [2019-03-28 12:36:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. 25.60/10.70 [2019-03-28 12:36:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.60/10.70 [2019-03-28 12:36:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. 25.60/10.70 [2019-03-28 12:36:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.60/10.70 [2019-03-28 12:36:47,196 INFO L394 BasicCegarLoop]: Found error trace 25.60/10.70 [2019-03-28 12:36:47,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 25.60/10.70 [2019-03-28 12:36:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 174224751, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.70 [2019-03-28 12:36:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.70 [2019-03-28 12:36:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.60/10.70 [2019-03-28 12:36:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.60/10.70 [2019-03-28 12:36:47,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.60/10.70 [2019-03-28 12:36:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.60/10.70 [2019-03-28 12:36:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.60/10.70 [2019-03-28 12:36:47,266 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. 25.60/10.70 [2019-03-28 12:36:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.60/10.70 [2019-03-28 12:36:47,345 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. 25.60/10.70 [2019-03-28 12:36:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.60/10.70 [2019-03-28 12:36:47,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.60/10.70 [2019-03-28 12:36:47,346 INFO L225 Difference]: With dead ends: 24 25.60/10.70 [2019-03-28 12:36:47,346 INFO L226 Difference]: Without dead ends: 18 25.60/10.70 [2019-03-28 12:36:47,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 25.60/10.70 [2019-03-28 12:36:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 25.60/10.70 [2019-03-28 12:36:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 25.60/10.70 [2019-03-28 12:36:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 25.60/10.70 [2019-03-28 12:36:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. 25.60/10.70 [2019-03-28 12:36:47,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. 25.60/10.70 [2019-03-28 12:36:47,371 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. 25.60/10.70 [2019-03-28 12:36:47,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.60/10.70 [2019-03-28 12:36:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. 25.60/10.70 [2019-03-28 12:36:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.60/10.70 [2019-03-28 12:36:47,372 INFO L394 BasicCegarLoop]: Found error trace 25.60/10.70 [2019-03-28 12:36:47,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,372 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 25.60/10.70 [2019-03-28 12:36:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash 174224752, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.70 [2019-03-28 12:36:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.70 [2019-03-28 12:36:47,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.60/10.70 [2019-03-28 12:36:47,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.60/10.70 [2019-03-28 12:36:47,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.60/10.70 [2019-03-28 12:36:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.60/10.70 [2019-03-28 12:36:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.60/10.70 [2019-03-28 12:36:47,410 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. 25.60/10.70 [2019-03-28 12:36:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.60/10.70 [2019-03-28 12:36:47,486 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. 25.60/10.70 [2019-03-28 12:36:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.60/10.70 [2019-03-28 12:36:47,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.60/10.70 [2019-03-28 12:36:47,487 INFO L225 Difference]: With dead ends: 33 25.60/10.70 [2019-03-28 12:36:47,488 INFO L226 Difference]: Without dead ends: 27 25.60/10.70 [2019-03-28 12:36:47,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.60/10.70 [2019-03-28 12:36:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 25.60/10.70 [2019-03-28 12:36:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 25.60/10.70 [2019-03-28 12:36:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 25.60/10.70 [2019-03-28 12:36:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. 25.60/10.70 [2019-03-28 12:36:47,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 5 25.60/10.70 [2019-03-28 12:36:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. 25.60/10.70 [2019-03-28 12:36:47,494 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. 25.60/10.70 [2019-03-28 12:36:47,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.60/10.70 [2019-03-28 12:36:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. 25.60/10.70 [2019-03-28 12:36:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 25.60/10.70 [2019-03-28 12:36:47,495 INFO L394 BasicCegarLoop]: Found error trace 25.60/10.70 [2019-03-28 12:36:47,495 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,496 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 25.60/10.70 [2019-03-28 12:36:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 807367607, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.70 [2019-03-28 12:36:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.70 [2019-03-28 12:36:47,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.60/10.70 [2019-03-28 12:36:47,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.60/10.70 [2019-03-28 12:36:47,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.60/10.70 [2019-03-28 12:36:47,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.60/10.70 [2019-03-28 12:36:47,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.60/10.70 [2019-03-28 12:36:47,540 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. 25.60/10.70 [2019-03-28 12:36:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.60/10.70 [2019-03-28 12:36:47,617 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. 25.60/10.70 [2019-03-28 12:36:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.60/10.70 [2019-03-28 12:36:47,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 25.60/10.70 [2019-03-28 12:36:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.60/10.70 [2019-03-28 12:36:47,618 INFO L225 Difference]: With dead ends: 27 25.60/10.70 [2019-03-28 12:36:47,618 INFO L226 Difference]: Without dead ends: 0 25.60/10.70 [2019-03-28 12:36:47,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.60/10.70 [2019-03-28 12:36:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.60/10.70 [2019-03-28 12:36:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.60/10.70 [2019-03-28 12:36:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.60/10.70 [2019-03-28 12:36:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.60/10.70 [2019-03-28 12:36:47,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 25.60/10.70 [2019-03-28 12:36:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. 25.60/10.70 [2019-03-28 12:36:47,620 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.60/10.70 [2019-03-28 12:36:47,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.60/10.70 [2019-03-28 12:36:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.60/10.70 [2019-03-28 12:36:47,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.60/10.70 [2019-03-28 12:36:47,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.60/10.70 [2019-03-28 12:36:47,773 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,773 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 10 19) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,773 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,774 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse1 (* 4 ULTIMATE.start_test_fun_~i~0))) (and (<= (* 4 ULTIMATE.start_test_fun_~N) .cse0) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= (+ .cse1 4) .cse0) (<= 0 (+ .cse1 ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base)))) 25.60/10.70 [2019-03-28 12:36:47,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,774 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,774 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,775 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,776 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,777 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 19) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) 25.60/10.70 [2019-03-28 12:36:47,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.60/10.70 [2019-03-28 12:36:47,777 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.60/10.70 [2019-03-28 12:36:47,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.70 [2019-03-28 12:36:47,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:47 BasicIcfg 25.60/10.70 [2019-03-28 12:36:47,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.60/10.70 [2019-03-28 12:36:47,799 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.60/10.70 [2019-03-28 12:36:47,800 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.60/10.70 [2019-03-28 12:36:47,803 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.60/10.70 [2019-03-28 12:36:47,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.60/10.70 [2019-03-28 12:36:47,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:36:45" (1/5) ... 25.60/10.70 [2019-03-28 12:36:47,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37a5fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:47, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:47,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.60/10.70 [2019-03-28 12:36:47,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/5) ... 25.60/10.70 [2019-03-28 12:36:47,807 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37a5fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:47, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:47,807 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.60/10.70 [2019-03-28 12:36:47,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:46" (3/5) ... 25.60/10.70 [2019-03-28 12:36:47,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37a5fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:47, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:47,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.60/10.70 [2019-03-28 12:36:47,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:46" (4/5) ... 25.60/10.70 [2019-03-28 12:36:47,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37a5fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:47, skipping insertion in model container 25.60/10.70 [2019-03-28 12:36:47,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.60/10.70 [2019-03-28 12:36:47,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:47" (5/5) ... 25.60/10.70 [2019-03-28 12:36:47,810 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.60/10.70 [2019-03-28 12:36:47,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.60/10.70 [2019-03-28 12:36:47,834 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.60/10.70 [2019-03-28 12:36:47,834 INFO L375 BuchiCegarLoop]: Hoare is true 25.60/10.70 [2019-03-28 12:36:47,834 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.60/10.70 [2019-03-28 12:36:47,834 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.60/10.70 [2019-03-28 12:36:47,835 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.60/10.70 [2019-03-28 12:36:47,835 INFO L379 BuchiCegarLoop]: Difference is false 25.60/10.70 [2019-03-28 12:36:47,835 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.60/10.70 [2019-03-28 12:36:47,835 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.60/10.70 [2019-03-28 12:36:47,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. 25.60/10.70 [2019-03-28 12:36:47,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 25.60/10.70 [2019-03-28 12:36:47,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.60/10.70 [2019-03-28 12:36:47,845 INFO L119 BuchiIsEmpty]: Starting construction of run 25.60/10.70 [2019-03-28 12:36:47,850 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,850 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,851 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.60/10.70 [2019-03-28 12:36:47,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. 25.60/10.70 [2019-03-28 12:36:47,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 25.60/10.70 [2019-03-28 12:36:47,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.60/10.70 [2019-03-28 12:36:47,853 INFO L119 BuchiIsEmpty]: Starting construction of run 25.60/10.70 [2019-03-28 12:36:47,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,854 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.60/10.70 [2019-03-28 12:36:47,859 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 23#L24true [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 19#L24-2true [129] L24-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 9#L10-3true 25.60/10.70 [2019-03-28 12:36:47,860 INFO L796 eck$LassoCheckResult]: Loop: 9#L10-3true [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 12#L11-3true [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 14#L11-1true [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 22#L15-2true [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 4#L15true [159] L15-->L10-3: Formula: (and (= (+ v_ULTIMATE.start_test_fun_~i~0_25 1) v_ULTIMATE.start_test_fun_~i~0_24) (<= |v_ULTIMATE.start_test_fun_#t~mem5_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 9#L10-3true 25.60/10.70 [2019-03-28 12:36:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 181355, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 120621438, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.70 [2019-03-28 12:36:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash -483788972, now seen corresponding path program 1 times 25.60/10.70 [2019-03-28 12:36:47,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.70 [2019-03-28 12:36:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.70 [2019-03-28 12:36:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.70 [2019-03-28 12:36:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.70 [2019-03-28 12:36:48,148 INFO L216 LassoAnalysis]: Preferences: 25.60/10.70 [2019-03-28 12:36:48,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.60/10.70 [2019-03-28 12:36:48,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.60/10.70 [2019-03-28 12:36:48,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.60/10.70 [2019-03-28 12:36:48,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.60/10.70 [2019-03-28 12:36:48,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.60/10.70 [2019-03-28 12:36:48,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.60/10.70 [2019-03-28 12:36:48,151 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.60/10.70 [2019-03-28 12:36:48,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 25.60/10.70 [2019-03-28 12:36:48,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.60/10.70 [2019-03-28 12:36:48,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.60/10.70 [2019-03-28 12:36:48,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,345 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 25.60/10.70 [2019-03-28 12:36:48,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.70 [2019-03-28 12:36:48,625 INFO L300 LassoAnalysis]: Preprocessing complete. 25.60/10.70 [2019-03-28 12:36:48,643 INFO L497 LassoAnalysis]: Using template 'affine'. 25.60/10.70 [2019-03-28 12:36:48,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.70 [2019-03-28 12:36:48,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.70 [2019-03-28 12:36:48,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.70 [2019-03-28 12:36:48,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.70 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.70 Number of strict supporting invariants: 0 25.60/10.70 Number of non-strict supporting invariants: 1 25.60/10.70 Consider only non-deceasing supporting invariants: true 25.60/10.70 Simplify termination arguments: true 25.60/10.70 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.70 [2019-03-28 12:36:48,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.70 [2019-03-28 12:36:48,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.70 [2019-03-28 12:36:48,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.70 [2019-03-28 12:36:48,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.70 [2019-03-28 12:36:48,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.70 [2019-03-28 12:36:48,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:48,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:48,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:48,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:48,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:48,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:48,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:48,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:48,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:48,769 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.60/10.71 [2019-03-28 12:36:48,808 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 25.60/10.71 [2019-03-28 12:36:48,808 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. 25.60/10.71 [2019-03-28 12:36:48,811 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.60/10.71 [2019-03-28 12:36:48,812 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.60/10.71 [2019-03-28 12:36:48,812 INFO L518 LassoAnalysis]: Proved termination. 25.60/10.71 [2019-03-28 12:36:48,813 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.60/10.71 Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 25.60/10.71 Supporting invariants [] 25.60/10.71 [2019-03-28 12:36:48,824 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.60/10.71 [2019-03-28 12:36:48,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 [2019-03-28 12:36:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:48,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:48,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:48,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:48,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.71 [2019-03-28 12:36:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:48,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:48,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:48,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:48,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:49,026 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.60/10.71 [2019-03-28 12:36:49,029 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.60/10.71 [2019-03-28 12:36:49,030 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states. Second operand 4 states. 25.60/10.71 [2019-03-28 12:36:49,230 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states.. Second operand 4 states. Result 78 states and 115 transitions. Complement of second has 7 states. 25.60/10.71 [2019-03-28 12:36:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 25.60/10.71 [2019-03-28 12:36:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.60/10.71 [2019-03-28 12:36:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. 25.60/10.71 [2019-03-28 12:36:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 5 letters. 25.60/10.71 [2019-03-28 12:36:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 8 letters. Loop has 5 letters. 25.60/10.71 [2019-03-28 12:36:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 3 letters. Loop has 10 letters. 25.60/10.71 [2019-03-28 12:36:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:49,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 115 transitions. 25.60/10.71 [2019-03-28 12:36:49,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 25.60/10.71 [2019-03-28 12:36:49,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:49,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 25.60/10.71 [2019-03-28 12:36:49,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 25.60/10.71 [2019-03-28 12:36:49,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:49,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.60/10.71 [2019-03-28 12:36:49,251 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. 25.60/10.71 [2019-03-28 12:36:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 25.60/10.71 [2019-03-28 12:36:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. 25.60/10.71 [2019-03-28 12:36:49,255 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. 25.60/10.71 [2019-03-28 12:36:49,255 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. 25.60/10.71 [2019-03-28 12:36:49,255 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.60/10.71 [2019-03-28 12:36:49,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. 25.60/10.71 [2019-03-28 12:36:49,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 25.60/10.71 [2019-03-28 12:36:49,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.60/10.71 [2019-03-28 12:36:49,257 INFO L119 BuchiIsEmpty]: Starting construction of run 25.60/10.71 [2019-03-28 12:36:49,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.60/10.71 [2019-03-28 12:36:49,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.60/10.71 [2019-03-28 12:36:49,258 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 211#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 212#L24-2 [128] L24-2-->L10-3: Formula: (and (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 213#L10-3 25.60/10.71 [2019-03-28 12:36:49,258 INFO L796 eck$LassoCheckResult]: Loop: 213#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 216#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 197#L11-1 [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 199#L15-2 [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 218#L15 [159] L15-->L10-3: Formula: (and (= (+ v_ULTIMATE.start_test_fun_~i~0_25 1) v_ULTIMATE.start_test_fun_~i~0_24) (<= |v_ULTIMATE.start_test_fun_#t~mem5_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 213#L10-3 25.60/10.71 [2019-03-28 12:36:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash 181354, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:49,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 120621438, now seen corresponding path program 2 times 25.60/10.71 [2019-03-28 12:36:49,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash -512418123, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:49,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:49,433 INFO L216 LassoAnalysis]: Preferences: 25.60/10.71 [2019-03-28 12:36:49,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.60/10.71 [2019-03-28 12:36:49,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.60/10.71 [2019-03-28 12:36:49,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.60/10.71 [2019-03-28 12:36:49,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.60/10.71 [2019-03-28 12:36:49,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.60/10.71 [2019-03-28 12:36:49,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.60/10.71 [2019-03-28 12:36:49,434 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.60/10.71 [2019-03-28 12:36:49,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 25.60/10.71 [2019-03-28 12:36:49,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.60/10.71 [2019-03-28 12:36:49,435 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.60/10.71 [2019-03-28 12:36:49,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:49,826 INFO L300 LassoAnalysis]: Preprocessing complete. 25.60/10.71 [2019-03-28 12:36:49,827 INFO L497 LassoAnalysis]: Using template 'affine'. 25.60/10.71 [2019-03-28 12:36:49,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:49,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:49,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:49,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:49,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:49,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:49,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:49,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:49,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:49,883 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.60/10.71 [2019-03-28 12:36:49,913 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 25.60/10.71 [2019-03-28 12:36:49,914 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. 25.60/10.71 [2019-03-28 12:36:49,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.60/10.71 [2019-03-28 12:36:49,916 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.60/10.71 [2019-03-28 12:36:49,917 INFO L518 LassoAnalysis]: Proved termination. 25.60/10.71 [2019-03-28 12:36:49,917 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.60/10.71 Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 25.60/10.71 Supporting invariants [] 25.60/10.71 [2019-03-28 12:36:49,926 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.60/10.71 [2019-03-28 12:36:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:49,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:49,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:49,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:49,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.71 [2019-03-28 12:36:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:50,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:50,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:50,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:50,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:50,060 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.60/10.71 [2019-03-28 12:36:50,060 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.60/10.71 [2019-03-28 12:36:50,060 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. 25.60/10.71 [2019-03-28 12:36:50,107 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 40 states and 52 transitions. Complement of second has 4 states. 25.60/10.71 [2019-03-28 12:36:50,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 25.60/10.71 [2019-03-28 12:36:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.60/10.71 [2019-03-28 12:36:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. 25.60/10.71 [2019-03-28 12:36:50,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 3 letters. Loop has 5 letters. 25.60/10.71 [2019-03-28 12:36:50,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:50,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 5 letters. 25.60/10.71 [2019-03-28 12:36:50,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:50,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 3 letters. Loop has 10 letters. 25.60/10.71 [2019-03-28 12:36:50,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:50,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. 25.60/10.71 [2019-03-28 12:36:50,115 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 25.60/10.71 [2019-03-28 12:36:50,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 52 transitions. 25.60/10.71 [2019-03-28 12:36:50,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 25.60/10.71 [2019-03-28 12:36:50,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 25.60/10.71 [2019-03-28 12:36:50,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. 25.60/10.71 [2019-03-28 12:36:50,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.60/10.71 [2019-03-28 12:36:50,116 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. 25.60/10.71 [2019-03-28 12:36:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. 25.60/10.71 [2019-03-28 12:36:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. 25.60/10.71 [2019-03-28 12:36:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.60/10.71 [2019-03-28 12:36:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. 25.60/10.71 [2019-03-28 12:36:50,119 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. 25.60/10.71 [2019-03-28 12:36:50,119 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. 25.60/10.71 [2019-03-28 12:36:50,119 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.60/10.71 [2019-03-28 12:36:50,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. 25.60/10.71 [2019-03-28 12:36:50,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 25.60/10.71 [2019-03-28 12:36:50,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.60/10.71 [2019-03-28 12:36:50,120 INFO L119 BuchiIsEmpty]: Starting construction of run 25.60/10.71 [2019-03-28 12:36:50,120 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.60/10.71 [2019-03-28 12:36:50,120 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.60/10.71 [2019-03-28 12:36:50,121 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 363#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 364#L24-2 [129] L24-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 365#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 351#L11-3 25.60/10.71 [2019-03-28 12:36:50,121 INFO L796 eck$LassoCheckResult]: Loop: 351#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 354#L11-1 [101] L11-1-->L12: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 355#L12 [158] L12-->L12-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_23))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_15))) (and (= (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~a.base_21) .cse0) |v_ULTIMATE.start_test_fun_#t~mem2_5|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~a.base_21) 1) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_15 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~a.base_21)) (= |v_ULTIMATE.start_test_fun_#t~post3_5| |v_ULTIMATE.start_test_fun_#t~mem2_5|) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_15, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_21, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_23} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_15, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_21, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_23} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3] 350#L12-2 [160] L12-2-->L11-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_26))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_test_fun_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~a.base_22) .cse1 (+ |v_ULTIMATE.start_test_fun_#t~post3_7| 1))) |v_#memory_int_10|) (<= 0 .cse1) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~a.base_22) 1) (= v_ULTIMATE.start_test_fun_~neg~0_5 (+ v_ULTIMATE.start_test_fun_~neg~0_6 1))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_16, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_22, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_6, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_7|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_16, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_22, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_5, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_6|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_4|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~post4, #memory_int] 351#L11-3 25.60/10.71 [2019-03-28 12:36:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 5622102, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:50,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:50,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:50,136 INFO L82 PathProgramCache]: Analyzing trace with hash 3319547, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:50,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:50,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash -483803696, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:50,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:50,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:50,339 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 25.60/10.71 [2019-03-28 12:36:50,401 INFO L216 LassoAnalysis]: Preferences: 25.60/10.71 [2019-03-28 12:36:50,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.60/10.71 [2019-03-28 12:36:50,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.60/10.71 [2019-03-28 12:36:50,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.60/10.71 [2019-03-28 12:36:50,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.60/10.71 [2019-03-28 12:36:50,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.60/10.71 [2019-03-28 12:36:50,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.60/10.71 [2019-03-28 12:36:50,402 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.60/10.71 [2019-03-28 12:36:50,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 25.60/10.71 [2019-03-28 12:36:50,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.60/10.71 [2019-03-28 12:36:50,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.60/10.71 [2019-03-28 12:36:50,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:50,836 INFO L300 LassoAnalysis]: Preprocessing complete. 25.60/10.71 [2019-03-28 12:36:50,837 INFO L497 LassoAnalysis]: Using template 'affine'. 25.60/10.71 [2019-03-28 12:36:50,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:50,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:50,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:50,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:50,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:50,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:50,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:50,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:50,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:50,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.60/10.71 [2019-03-28 12:36:50,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.60/10.71 [2019-03-28 12:36:50,926 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 25.60/10.71 [2019-03-28 12:36:50,926 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.60/10.71 [2019-03-28 12:36:50,927 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.60/10.71 [2019-03-28 12:36:50,927 INFO L518 LassoAnalysis]: Proved termination. 25.60/10.71 [2019-03-28 12:36:50,927 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.60/10.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 25.60/10.71 Supporting invariants [] 25.60/10.71 [2019-03-28 12:36:50,938 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 25.60/10.71 [2019-03-28 12:36:50,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.60/10.71 [2019-03-28 12:36:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:50,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:50,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:50,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.71 [2019-03-28 12:36:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,067 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.60/10.71 [2019-03-28 12:36:51,067 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 25.60/10.71 [2019-03-28 12:36:51,067 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 25.60/10.71 [2019-03-28 12:36:51,067 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. 25.60/10.71 [2019-03-28 12:36:51,118 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 44 states and 53 transitions. Complement of second has 10 states. 25.60/10.71 [2019-03-28 12:36:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 25.60/10.71 [2019-03-28 12:36:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.60/10.71 [2019-03-28 12:36:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. 25.60/10.71 [2019-03-28 12:36:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 4 letters. 25.60/10.71 [2019-03-28 12:36:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 8 letters. Loop has 4 letters. 25.60/10.71 [2019-03-28 12:36:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 8 letters. 25.60/10.71 [2019-03-28 12:36:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. 25.60/10.71 [2019-03-28 12:36:51,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.60/10.71 [2019-03-28 12:36:51,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:51,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 25.60/10.71 [2019-03-28 12:36:51,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 25.60/10.71 [2019-03-28 12:36:51,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:51,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.60/10.71 [2019-03-28 12:36:51,126 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. 25.60/10.71 [2019-03-28 12:36:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. 25.60/10.71 [2019-03-28 12:36:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.60/10.71 [2019-03-28 12:36:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. 25.60/10.71 [2019-03-28 12:36:51,129 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 25.60/10.71 [2019-03-28 12:36:51,129 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 25.60/10.71 [2019-03-28 12:36:51,129 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.60/10.71 [2019-03-28 12:36:51,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. 25.60/10.71 [2019-03-28 12:36:51,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.60/10.71 [2019-03-28 12:36:51,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.60/10.71 [2019-03-28 12:36:51,130 INFO L119 BuchiIsEmpty]: Starting construction of run 25.60/10.71 [2019-03-28 12:36:51,130 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 25.60/10.71 [2019-03-28 12:36:51,130 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.60/10.71 [2019-03-28 12:36:51,131 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY [154] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 498#L24 [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 499#L24-2 [129] L24-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7))) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 500#L10-3 [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 502#L11-3 [77] L11-3-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 491#L11-1 [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 492#L15-2 25.60/10.71 [2019-03-28 12:36:51,131 INFO L796 eck$LassoCheckResult]: Loop: 492#L15-2 [106] L15-2-->L15: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 484#L15 [94] L15-->L16: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 485#L16 [161] L16-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (= |v_ULTIMATE.start_test_fun_#t~mem6_5| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_23) .cse0)) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~post7_5| |v_ULTIMATE.start_test_fun_#t~mem6_5|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_23)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_23))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_23, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_23, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#t~mem6] 495#L16-2 [162] L16-2-->L15-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (+ v_ULTIMATE.start_test_fun_~pos~0_6 1) v_ULTIMATE.start_test_fun_~pos~0_5) (= (store |v_#memory_int_14| v_ULTIMATE.start_test_fun_~a.base_24 (store (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~a.base_24) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post7_7| (- 1)))) |v_#memory_int_13|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_24)) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_7|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_6} OutVars{ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_6|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_4|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_5, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#t~post8, #memory_int, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_test_fun_#t~mem6] 492#L15-2 25.60/10.71 [2019-03-28 12:36:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1107875231, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:51,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 4176854, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:51,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:51,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1064791436, now seen corresponding path program 1 times 25.60/10.71 [2019-03-28 12:36:51,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.60/10.71 [2019-03-28 12:36:51,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.60/10.71 [2019-03-28 12:36:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.60/10.71 [2019-03-28 12:36:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,326 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 25.60/10.71 [2019-03-28 12:36:51,377 INFO L216 LassoAnalysis]: Preferences: 25.60/10.71 [2019-03-28 12:36:51,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.60/10.71 [2019-03-28 12:36:51,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.60/10.71 [2019-03-28 12:36:51,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.60/10.71 [2019-03-28 12:36:51,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.60/10.71 [2019-03-28 12:36:51,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.60/10.71 [2019-03-28 12:36:51,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.60/10.71 [2019-03-28 12:36:51,378 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.60/10.71 [2019-03-28 12:36:51,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 25.60/10.71 [2019-03-28 12:36:51,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.60/10.71 [2019-03-28 12:36:51,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.60/10.71 [2019-03-28 12:36:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.60/10.71 [2019-03-28 12:36:51,750 INFO L300 LassoAnalysis]: Preprocessing complete. 25.60/10.71 [2019-03-28 12:36:51,750 INFO L497 LassoAnalysis]: Using template 'affine'. 25.60/10.71 [2019-03-28 12:36:51,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:51,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:51,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:51,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:51,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:51,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:51,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:51,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:51,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:51,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:51,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.60/10.71 [2019-03-28 12:36:51,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:51,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:51,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:51,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:51,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:51,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.60/10.71 [2019-03-28 12:36:51,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.60/10.71 Termination analysis: LINEAR_WITH_GUESSES 25.60/10.71 Number of strict supporting invariants: 0 25.60/10.71 Number of non-strict supporting invariants: 1 25.60/10.71 Consider only non-deceasing supporting invariants: true 25.60/10.71 Simplify termination arguments: true 25.60/10.71 Simplify supporting invariants: trueOverapproximate stem: false 25.60/10.71 [2019-03-28 12:36:51,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.60/10.71 [2019-03-28 12:36:51,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.60/10.71 [2019-03-28 12:36:51,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.60/10.71 [2019-03-28 12:36:51,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.60/10.71 [2019-03-28 12:36:51,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.60/10.71 [2019-03-28 12:36:51,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.60/10.71 [2019-03-28 12:36:51,767 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.60/10.71 [2019-03-28 12:36:51,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.60/10.71 [2019-03-28 12:36:51,770 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 25.60/10.71 [2019-03-28 12:36:51,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.60/10.71 [2019-03-28 12:36:51,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.60/10.71 [2019-03-28 12:36:51,771 INFO L518 LassoAnalysis]: Proved termination. 25.60/10.71 [2019-03-28 12:36:51,771 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.60/10.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_4 25.60/10.71 Supporting invariants [] 25.60/10.71 [2019-03-28 12:36:51,778 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.60/10.71 [2019-03-28 12:36:51,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.60/10.71 [2019-03-28 12:36:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.60/10.71 [2019-03-28 12:36:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:51,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:51,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.60/10.71 [2019-03-28 12:36:51,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core 25.60/10.71 [2019-03-28 12:36:51,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.60/10.71 [2019-03-28 12:36:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.60/10.71 [2019-03-28 12:36:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.60/10.71 [2019-03-28 12:36:51,917 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.60/10.71 [2019-03-28 12:36:51,918 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 25.60/10.71 [2019-03-28 12:36:51,918 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 25.60/10.71 [2019-03-28 12:36:51,918 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. 25.60/10.71 [2019-03-28 12:36:51,978 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 31 states and 40 transitions. Complement of second has 8 states. 25.60/10.71 [2019-03-28 12:36:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.60/10.71 [2019-03-28 12:36:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.60/10.71 [2019-03-28 12:36:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. 25.60/10.71 [2019-03-28 12:36:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. 25.60/10.71 [2019-03-28 12:36:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. 25.60/10.71 [2019-03-28 12:36:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. 25.60/10.71 [2019-03-28 12:36:51,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.60/10.71 [2019-03-28 12:36:51,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. 25.60/10.71 [2019-03-28 12:36:51,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.60/10.71 [2019-03-28 12:36:51,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.60/10.71 [2019-03-28 12:36:51,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.60/10.71 [2019-03-28 12:36:51,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.60/10.71 [2019-03-28 12:36:51,985 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,985 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,985 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,985 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.60/10.71 [2019-03-28 12:36:51,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.60/10.71 [2019-03-28 12:36:51,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.60/10.71 [2019-03-28 12:36:51,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.60/10.71 [2019-03-28 12:36:51,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:51 BasicIcfg 25.60/10.71 [2019-03-28 12:36:51,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.60/10.71 [2019-03-28 12:36:51,993 INFO L168 Benchmark]: Toolchain (without parser) took 6130.90 ms. Allocated memory was 649.6 MB in the beginning and 770.7 MB in the end (delta: 121.1 MB). Free memory was 565.7 MB in the beginning and 434.2 MB in the end (delta: 131.5 MB). Peak memory consumption was 252.6 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,994 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.04 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.7 MB in the beginning and 642.3 MB in the end (delta: -76.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.78 ms. Allocated memory is still 674.8 MB. Free memory was 642.3 MB in the beginning and 638.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,996 INFO L168 Benchmark]: Boogie Preprocessor took 27.82 ms. Allocated memory is still 674.8 MB. Free memory was 638.4 MB in the beginning and 637.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,996 INFO L168 Benchmark]: RCFGBuilder took 351.85 ms. Allocated memory is still 674.8 MB. Free memory was 636.2 MB in the beginning and 613.7 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,997 INFO L168 Benchmark]: BlockEncodingV2 took 134.19 ms. Allocated memory is still 674.8 MB. Free memory was 613.7 MB in the beginning and 604.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,997 INFO L168 Benchmark]: TraceAbstraction took 1059.81 ms. Allocated memory is still 674.8 MB. Free memory was 604.0 MB in the beginning and 507.9 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:51,998 INFO L168 Benchmark]: BuchiAutomizer took 4192.84 ms. Allocated memory was 674.8 MB in the beginning and 770.7 MB in the end (delta: 95.9 MB). Free memory was 506.9 MB in the beginning and 434.2 MB in the end (delta: 72.7 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. 25.60/10.71 [2019-03-28 12:36:52,002 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.60/10.71 --- Results --- 25.60/10.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.60/10.71 - StatisticsResult: Initial Icfg 25.60/10.71 34 locations, 40 edges 25.60/10.71 - StatisticsResult: Encoded RCFG 25.60/10.71 24 locations, 40 edges 25.60/10.71 * Results from de.uni_freiburg.informatik.ultimate.core: 25.60/10.71 - StatisticsResult: Toolchain Benchmarks 25.60/10.71 Benchmark results are: 25.60/10.71 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.60/10.71 * CACSL2BoogieTranslator took 314.04 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.7 MB in the beginning and 642.3 MB in the end (delta: -76.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 25.60/10.71 * Boogie Procedure Inliner took 44.78 ms. Allocated memory is still 674.8 MB. Free memory was 642.3 MB in the beginning and 638.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 25.60/10.71 * Boogie Preprocessor took 27.82 ms. Allocated memory is still 674.8 MB. Free memory was 638.4 MB in the beginning and 637.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.60/10.71 * RCFGBuilder took 351.85 ms. Allocated memory is still 674.8 MB. Free memory was 636.2 MB in the beginning and 613.7 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 50.3 GB. 25.60/10.71 * BlockEncodingV2 took 134.19 ms. Allocated memory is still 674.8 MB. Free memory was 613.7 MB in the beginning and 604.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 25.60/10.71 * TraceAbstraction took 1059.81 ms. Allocated memory is still 674.8 MB. Free memory was 604.0 MB in the beginning and 507.9 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 50.3 GB. 25.60/10.71 * BuchiAutomizer took 4192.84 ms. Allocated memory was 674.8 MB in the beginning and 770.7 MB in the end (delta: 95.9 MB). Free memory was 506.9 MB in the beginning and 434.2 MB in the end (delta: 72.7 MB). Peak memory consumption was 168.6 MB. Max. memory is 50.3 GB. 25.60/10.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #length 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #memory_int 25.60/10.71 - GenericResult: Unfinished Backtranslation 25.60/10.71 unknown boogie variable #memory_int 25.60/10.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.60/10.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 15]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 15]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 25.60/10.71 For all program executions holds that pointer dereference always succeeds at this location 25.60/10.71 - AllSpecificationsHoldResult: All specifications hold 25.60/10.71 12 specifications checked. All of them hold 25.60/10.71 - InvariantResult [Line: 10]: Loop Invariant 25.60/10.71 [2019-03-28 12:36:52,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 [2019-03-28 12:36:52,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] 25.60/10.71 - InvariantResult [Line: 11]: Loop Invariant 25.60/10.71 [2019-03-28 12:36:52,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 [2019-03-28 12:36:52,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 [2019-03-28 12:36:52,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 [2019-03-28 12:36:52,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.60/10.71 Derived loop invariant: (((4 * N <= unknown-#length-unknown[a] && 0 == a) && 4 * i + 4 <= unknown-#length-unknown[a]) && 0 <= 4 * i + a) && 1 == \valid[a] 25.60/10.71 - StatisticsResult: Ultimate Automizer benchmark data 25.60/10.71 CFG has 1 procedures, 24 locations, 12 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 78 SDslu, 20 SDs, 0 SdLazy, 113 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 55 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.60/10.71 - StatisticsResult: Constructed decomposition of program 25.60/10.71 Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 5 locations. One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 5 locations. 25.60/10.71 - StatisticsResult: Timing statistics 25.60/10.71 BüchiAutomizer plugin needed 4.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 171 SDslu, 19 SDs, 0 SdLazy, 237 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp89 ukn81 mio100 lsp56 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.60/10.71 - TerminationAnalysisResult: Termination proven 25.60/10.71 Buchi Automizer proved that your program is terminating 25.60/10.71 RESULT: Ultimate proved your program to be correct! 25.60/10.71 !SESSION 2019-03-28 12:36:42.572 ----------------------------------------------- 25.60/10.71 eclipse.buildId=unknown 25.60/10.71 java.version=1.8.0_181 25.60/10.71 java.vendor=Oracle Corporation 25.60/10.71 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.60/10.71 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.60/10.71 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.60/10.71 25.60/10.71 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:36:52.241 25.60/10.71 !MESSAGE The workspace will exit with unsaved changes in this session. 25.60/10.71 Received shutdown request... 25.60/10.71 Ultimate: 25.60/10.71 GTK+ Version Check 25.60/10.71 EOF