./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e150e83dea41703782a488455769a24bf6c8f600 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:42:57,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:42:57,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:42:57,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:42:57,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:42:57,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:42:57,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:42:57,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:42:57,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:42:57,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:42:57,052 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:42:57,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:42:57,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:42:57,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:42:57,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:42:57,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:42:57,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:42:57,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:42:57,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:42:57,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:42:57,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:42:57,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:42:57,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:42:57,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:42:57,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:42:57,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:42:57,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:42:57,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:42:57,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:42:57,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:42:57,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:42:57,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:42:57,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:42:57,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:42:57,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:42:57,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:42:57,067 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:42:57,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:42:57,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:42:57,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:42:57,080 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:42:57,080 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:42:57,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:42:57,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:42:57,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:42:57,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:42:57,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:42:57,083 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:42:57,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:42:57,083 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:42:57,083 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:42:57,084 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:42:57,084 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e150e83dea41703782a488455769a24bf6c8f600 [2018-11-23 06:42:57,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:42:57,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:42:57,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:42:57,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:42:57,123 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:42:57,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 06:42:57,172 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/data/34202eb17/0586365811f247028d481e8ec6c3c7df/FLAGdda02a5d9 [2018-11-23 06:42:57,511 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:42:57,512 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 06:42:57,515 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/data/34202eb17/0586365811f247028d481e8ec6c3c7df/FLAGdda02a5d9 [2018-11-23 06:42:57,933 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/data/34202eb17/0586365811f247028d481e8ec6c3c7df [2018-11-23 06:42:57,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:42:57,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:42:57,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:42:57,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:42:57,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:42:57,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:42:57" (1/1) ... [2018-11-23 06:42:57,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8670d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:57, skipping insertion in model container [2018-11-23 06:42:57,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:42:57" (1/1) ... [2018-11-23 06:42:57,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:42:57,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:42:58,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:42:58,134 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:42:58,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:42:58,160 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:42:58,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58 WrapperNode [2018-11-23 06:42:58,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:42:58,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:42:58,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:42:58,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:42:58,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:42:58,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:42:58,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:42:58,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:42:58,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... [2018-11-23 06:42:58,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:42:58,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:42:58,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:42:58,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:42:58,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:42:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:42:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:42:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:42:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:42:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:42:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:42:58,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:42:58,510 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 06:42:58,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:42:58 BoogieIcfgContainer [2018-11-23 06:42:58,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:42:58,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:42:58,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:42:58,514 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:42:58,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:42:58,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:42:57" (1/3) ... [2018-11-23 06:42:58,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eed8162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:42:58, skipping insertion in model container [2018-11-23 06:42:58,516 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:42:58,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:42:58" (2/3) ... [2018-11-23 06:42:58,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eed8162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:42:58, skipping insertion in model container [2018-11-23 06:42:58,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:42:58,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:42:58" (3/3) ... [2018-11-23 06:42:58,518 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-23 06:42:58,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:42:58,564 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:42:58,564 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:42:58,564 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:42:58,564 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:42:58,564 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:42:58,565 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:42:58,565 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:42:58,565 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:42:58,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 06:42:58,591 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 06:42:58,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:42:58,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:42:58,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:42:58,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:42:58,596 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:42:58,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-23 06:42:58,598 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 06:42:58,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:42:58,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:42:58,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:42:58,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:42:58,604 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 14#L23true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L9-3true [2018-11-23 06:42:58,604 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 28#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 7#L9-2true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 6#L9-3true [2018-11-23 06:42:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-23 06:42:58,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:58,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2018-11-23 06:42:58,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:58,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2018-11-23 06:42:58,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:58,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:58,966 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:42:58,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:42:58,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:42:58,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:42:58,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:42:58,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:42:58,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:42:58,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:42:58,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 06:42:58,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:42:58,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:42:58,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:58,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:58,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:42:59,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:42:59,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:42:59,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:42:59,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:42:59,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:42:59,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:42:59,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:42:59,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:42:59,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:42:59,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:42:59,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:42:59,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:42:59,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:42:59,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:42:59,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:42:59,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:42:59,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:42:59,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:42:59,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:42:59,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:42:59,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:42:59,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:42:59,387 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:42:59,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:42:59,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:42:59,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:42:59,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:42:59,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:42:59,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:42:59,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:42:59,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:42:59,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:42:59,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:42:59,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:42:59,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:42:59,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:42:59,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:42:59,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:42:59,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:42:59,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:42:59,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:42:59,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:42:59,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:42:59,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:42:59,492 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 06:42:59,492 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:42:59,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:42:59,497 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:42:59,497 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:42:59,497 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-23 06:42:59,518 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:42:59,523 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:42:59,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:59,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:42:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:59,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:42:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:42:59,595 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:42:59,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2018-11-23 06:42:59,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 57 states and 81 transitions. Complement of second has 8 states. [2018-11-23 06:42:59,631 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 [2018-11-23 06:42:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:42:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 06:42:59,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 06:42:59,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:42:59,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 06:42:59,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:42:59,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 06:42:59,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:42:59,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2018-11-23 06:42:59,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:42:59,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2018-11-23 06:42:59,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 06:42:59,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:42:59,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-11-23 06:42:59,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:42:59,645 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 06:42:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-11-23 06:42:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 06:42:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 06:42:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 06:42:59,664 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 06:42:59,664 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 06:42:59,664 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:42:59,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 06:42:59,665 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:42:59,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:42:59,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:42:59,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:42:59,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:42:59,666 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 156#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 157#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 147#L9-3 assume !(sep_~i~0 < ~N~0); 144#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 145#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 146#L9-8 [2018-11-23 06:42:59,666 INFO L796 eck$LassoCheckResult]: Loop: 146#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 154#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 155#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 146#L9-8 [2018-11-23 06:42:59,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2018-11-23 06:42:59,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:59,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:42:59,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:42:59,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:42:59,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:42:59,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2018-11-23 06:42:59,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:59,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:42:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:42:59,767 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 06:42:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:42:59,789 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2018-11-23 06:42:59,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:42:59,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2018-11-23 06:42:59,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:42:59,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2018-11-23 06:42:59,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:42:59,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:42:59,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-23 06:42:59,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:42:59,791 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-23 06:42:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-23 06:42:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 06:42:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 06:42:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-23 06:42:59,793 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 06:42:59,793 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 06:42:59,793 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:42:59,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-23 06:42:59,794 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:42:59,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:42:59,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:42:59,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:42:59,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:42:59,794 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 204#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 205#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 195#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 196#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 200#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 197#L9-3 assume !(sep_~i~0 < ~N~0); 192#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 193#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 194#L9-8 [2018-11-23 06:42:59,794 INFO L796 eck$LassoCheckResult]: Loop: 194#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 202#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 203#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 194#L9-8 [2018-11-23 06:42:59,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2018-11-23 06:42:59,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:59,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:59,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:59,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:42:59,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:42:59,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:42:59,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:59,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:42:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:42:59,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:42:59,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:42:59,900 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:42:59,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2018-11-23 06:42:59,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:42:59,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:42:59,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:42:59,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:42:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:42:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:42:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:42:59,980 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-23 06:43:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:00,009 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-11-23 06:43:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:43:00,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2018-11-23 06:43:00,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:43:00,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 06:43:00,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:43:00,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:43:00,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-23 06:43:00,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:00,011 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 06:43:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-23 06:43:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 06:43:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:43:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 06:43:00,013 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 06:43:00,013 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 06:43:00,014 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:43:00,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-23 06:43:00,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:43:00,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:00,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:00,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:00,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:00,015 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 284#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 285#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 273#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 274#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 279#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 275#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 276#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 289#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 290#L9-3 assume !(sep_~i~0 < ~N~0); 270#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 271#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 272#L9-8 [2018-11-23 06:43:00,015 INFO L796 eck$LassoCheckResult]: Loop: 272#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 281#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 282#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 272#L9-8 [2018-11-23 06:43:00,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2018-11-23 06:43:00,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:00,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:00,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2018-11-23 06:43:00,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:00,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2018-11-23 06:43:00,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:00,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:00,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:43:00,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:43:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:00,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:00,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 06:43:00,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 06:43:00,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 06:43:00,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-23 06:43:00,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 06:43:00,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-23 06:43:00,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:00,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-23 06:43:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-11-23 06:43:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 06:43:00,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:43:00,652 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-23 06:43:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:01,246 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2018-11-23 06:43:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:43:01,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2018-11-23 06:43:01,247 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2018-11-23 06:43:01,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 101 transitions. [2018-11-23 06:43:01,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-23 06:43:01,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-23 06:43:01,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2018-11-23 06:43:01,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:01,248 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2018-11-23 06:43:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2018-11-23 06:43:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 31. [2018-11-23 06:43:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 06:43:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-11-23 06:43:01,251 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-23 06:43:01,251 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-11-23 06:43:01,251 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:43:01,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2018-11-23 06:43:01,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 06:43:01,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:01,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:01,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:01,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:01,252 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 462#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 463#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 451#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 452#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 458#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 453#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 454#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 468#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 470#L9-3 assume !(sep_~i~0 < ~N~0); 471#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 449#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 450#L9-8 [2018-11-23 06:43:01,252 INFO L796 eck$LassoCheckResult]: Loop: 450#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 469#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 460#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 450#L9-8 [2018-11-23 06:43:01,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2018-11-23 06:43:01,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2018-11-23 06:43:01,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:01,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:01,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:01,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:01,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2018-11-23 06:43:01,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:01,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:01,545 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-23 06:43:01,730 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-23 06:43:01,732 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:43:01,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:43:01,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:43:01,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:43:01,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:43:01,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:43:01,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:43:01,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:43:01,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-23 06:43:01,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:43:01,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:43:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:01,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:02,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:43:02,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:43:02,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:02,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:02,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:02,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:02,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:02,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:02,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:02,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:02,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:02,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:02,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:02,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:02,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:02,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:02,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:02,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:02,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:02,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:02,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:02,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,073 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:43:02,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,075 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:43:02,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:02,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:02,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:02,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:02,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:02,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:02,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:02,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:02,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:02,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:43:02,100 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:43:02,100 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:43:02,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:43:02,101 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:43:02,101 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:43:02,101 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-23 06:43:02,133 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:43:02,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:02,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:02,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:02,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:43:02,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-23 06:43:02,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2018-11-23 06:43:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:43:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:43:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-23 06:43:02,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 06:43:02,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:02,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 06:43:02,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:02,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-23 06:43:02,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:02,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2018-11-23 06:43:02,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2018-11-23 06:43:02,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:43:02,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 06:43:02,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2018-11-23 06:43:02,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:02,201 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-23 06:43:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2018-11-23 06:43:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 06:43:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 06:43:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-23 06:43:02,204 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-23 06:43:02,204 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-23 06:43:02,204 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:43:02,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-11-23 06:43:02,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:02,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:02,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:02,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:43:02,206 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 618#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 619#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 607#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 608#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 614#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 609#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 610#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 629#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 627#L9-3 assume !(sep_~i~0 < ~N~0); 626#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 605#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 606#L9-8 assume !(sep_~i~0 < ~N~0); 620#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 601#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 602#L35-3 [2018-11-23 06:43:02,206 INFO L796 eck$LassoCheckResult]: Loop: 602#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 621#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 602#L35-3 [2018-11-23 06:43:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2018-11-23 06:43:02,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:43:02,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:43:02,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:43:02,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:43:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2018-11-23 06:43:02,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:43:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:43:02,280 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-23 06:43:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:02,305 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-11-23 06:43:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:43:02,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2018-11-23 06:43:02,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2018-11-23 06:43:02,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 06:43:02,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 06:43:02,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2018-11-23 06:43:02,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:02,309 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-11-23 06:43:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2018-11-23 06:43:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-23 06:43:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 06:43:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-11-23 06:43:02,311 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 06:43:02,311 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 06:43:02,312 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:43:02,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2018-11-23 06:43:02,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:02,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:02,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:02,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:43:02,313 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 692#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 693#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 682#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 683#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 688#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 684#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 685#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 707#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 700#L9-3 assume !(sep_~i~0 < ~N~0); 701#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 706#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 705#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 699#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 691#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 698#L9-8 assume !(sep_~i~0 < ~N~0); 696#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 677#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 678#L35-3 [2018-11-23 06:43:02,313 INFO L796 eck$LassoCheckResult]: Loop: 678#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 697#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 678#L35-3 [2018-11-23 06:43:02,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2018-11-23 06:43:02,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:02,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:02,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:02,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:43:02,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:43:02,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:43:02,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:02,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:43:02,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:02,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 06:43:02,439 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:43:02,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2018-11-23 06:43:02,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:43:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:43:02,471 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-23 06:43:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:02,504 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2018-11-23 06:43:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:43:02,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2018-11-23 06:43:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2018-11-23 06:43:02,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 06:43:02,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 06:43:02,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2018-11-23 06:43:02,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:02,506 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-23 06:43:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2018-11-23 06:43:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-11-23 06:43:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:43:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-11-23 06:43:02,508 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-23 06:43:02,508 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-11-23 06:43:02,508 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:43:02,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2018-11-23 06:43:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:02,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:02,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:02,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:02,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:43:02,510 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 833#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 834#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 822#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 823#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 847#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 824#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 825#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 840#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 851#L9-3 assume !(sep_~i~0 < ~N~0); 850#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 849#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 848#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 846#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 843#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 842#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 831#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 832#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 844#L9-8 assume !(sep_~i~0 < ~N~0); 837#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 817#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 818#L35-3 [2018-11-23 06:43:02,510 INFO L796 eck$LassoCheckResult]: Loop: 818#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 838#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 818#L35-3 [2018-11-23 06:43:02,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2018-11-23 06:43:02,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:02,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:02,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:02,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:03,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:43:03,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:43:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:43:03,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:43:03,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:43:03,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:03,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-23 06:43:03,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-23 06:43:03,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-23 06:43:03,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2018-11-23 06:43:03,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:43:03,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 06:43:03,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:03,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 06:43:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 06:43:03,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:03,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-11-23 06:43:03,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:43:03,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2018-11-23 06:43:03,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:03,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:03,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 06:43:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:43:03,379 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand 22 states. [2018-11-23 06:43:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:03,982 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2018-11-23 06:43:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 06:43:03,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 89 transitions. [2018-11-23 06:43:03,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2018-11-23 06:43:03,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 89 transitions. [2018-11-23 06:43:03,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 06:43:03,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-23 06:43:03,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 89 transitions. [2018-11-23 06:43:03,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:03,985 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-11-23 06:43:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 89 transitions. [2018-11-23 06:43:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 35. [2018-11-23 06:43:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:43:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-11-23 06:43:03,988 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 06:43:03,988 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-23 06:43:03,988 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:43:03,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2018-11-23 06:43:03,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 06:43:03,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:03,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:03,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:03,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:43:03,989 INFO L794 eck$LassoCheckResult]: Stem: 1049#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1046#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1047#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1036#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1037#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1043#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1038#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1039#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1064#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1058#L9-3 assume !(sep_~i~0 < ~N~0); 1059#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1034#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1035#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1063#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1057#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1056#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1044#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1045#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1062#L9-8 assume !(sep_~i~0 < ~N~0); 1050#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1030#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1031#L35-3 [2018-11-23 06:43:03,989 INFO L796 eck$LassoCheckResult]: Loop: 1031#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1051#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1031#L35-3 [2018-11-23 06:43:03,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2018-11-23 06:43:03,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:03,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:03,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2018-11-23 06:43:04,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:04,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2018-11-23 06:43:04,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:04,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:04,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:04,479 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 163 [2018-11-23 06:43:04,703 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2018-11-23 06:43:04,704 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:43:04,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:43:04,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:43:04,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:43:04,705 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:43:04,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:43:04,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:43:04,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:43:04,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 06:43:04,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:43:04,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:43:04,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:04,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:05,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:43:05,090 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:43:05,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:05,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:05,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:05,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,152 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:43:05,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:43:05,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:05,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:05,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:05,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:05,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:05,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:05,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:05,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:05,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:43:05,176 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:43:05,177 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:43:05,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:43:05,177 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:43:05,178 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:43:05,178 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#x~0.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~1) = -1*ULTIMATE.start_main_~#x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 06:43:05,219 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 06:43:05,221 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:43:05,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:05,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:05,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:05,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:43:05,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-23 06:43:05,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 41 states and 56 transitions. Complement of second has 6 states. [2018-11-23 06:43:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:43:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:43:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 06:43:05,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-23 06:43:05,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:05,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-23 06:43:05,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:05,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-23 06:43:05,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:05,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2018-11-23 06:43:05,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:05,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 47 transitions. [2018-11-23 06:43:05,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 06:43:05,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:43:05,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2018-11-23 06:43:05,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:05,290 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-23 06:43:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2018-11-23 06:43:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 06:43:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 06:43:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-23 06:43:05,292 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-23 06:43:05,292 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-23 06:43:05,292 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 06:43:05,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2018-11-23 06:43:05,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:05,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:05,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:05,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:05,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:05,294 INFO L794 eck$LassoCheckResult]: Stem: 1254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1250#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1251#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1239#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1240#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1246#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1241#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1242#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1267#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1268#L9-3 assume !(sep_~i~0 < ~N~0); 1236#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1237#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1238#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1256#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1259#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1257#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1247#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1248#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1258#L9-8 assume !(sep_~i~0 < ~N~0); 1255#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1234#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1235#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1249#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1243#L9-13 [2018-11-23 06:43:05,294 INFO L796 eck$LassoCheckResult]: Loop: 1243#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1244#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1245#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1243#L9-13 [2018-11-23 06:43:05,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2018-11-23 06:43:05,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:05,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 06:43:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:43:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:43:05,318 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:43:05,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2018-11-23 06:43:05,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:05,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:43:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:43:05,394 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 06:43:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:05,412 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 06:43:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:43:05,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-23 06:43:05,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:05,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 06:43:05,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:43:05,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:43:05,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2018-11-23 06:43:05,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:05,414 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 06:43:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2018-11-23 06:43:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 06:43:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 06:43:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-11-23 06:43:05,415 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-23 06:43:05,415 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-23 06:43:05,416 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 06:43:05,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2018-11-23 06:43:05,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:05,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:05,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:05,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:05,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:05,417 INFO L794 eck$LassoCheckResult]: Stem: 1336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1331#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1332#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1319#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1320#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1349#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1321#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1322#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1348#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1346#L9-3 assume !(sep_~i~0 < ~N~0); 1345#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1344#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1343#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1342#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1340#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1339#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1328#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1329#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1341#L9-8 assume !(sep_~i~0 < ~N~0); 1333#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1314#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1315#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1334#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1335#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1330#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1323#L9-13 [2018-11-23 06:43:05,417 INFO L796 eck$LassoCheckResult]: Loop: 1323#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1324#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1327#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1323#L9-13 [2018-11-23 06:43:05,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2018-11-23 06:43:05,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:05,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2018-11-23 06:43:05,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:05,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:05,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2018-11-23 06:43:05,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:43:05,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:43:05,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:43:05,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:05,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:06,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-23 06:43:06,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:43:06,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-11-23 06:43:06,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:43:06,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 06:43:06,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2018-11-23 06:43:06,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 06:43:06,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:43:06,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-23 06:43:06,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-23 06:43:06,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-23 06:43:06,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:43:06,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 48 [2018-11-23 06:43:06,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:43:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:43:06,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:43:06,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:46 [2018-11-23 06:43:06,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 06:43:06,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-23 06:43:06,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:06,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-23 06:43:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 06:43:06,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:06,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2018-11-23 06:43:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 06:43:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:43:06,205 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-11-23 06:43:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:06,918 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2018-11-23 06:43:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 06:43:06,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 126 transitions. [2018-11-23 06:43:06,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:43:06,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 126 transitions. [2018-11-23 06:43:06,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-23 06:43:06,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-23 06:43:06,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 126 transitions. [2018-11-23 06:43:06,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:06,921 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 126 transitions. [2018-11-23 06:43:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 126 transitions. [2018-11-23 06:43:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2018-11-23 06:43:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 06:43:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-11-23 06:43:06,928 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-23 06:43:06,928 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-23 06:43:06,928 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 06:43:06,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2018-11-23 06:43:06,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:06,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:06,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:06,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:06,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:06,929 INFO L794 eck$LassoCheckResult]: Stem: 1614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1608#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1609#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1595#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1596#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1603#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1604#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1636#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1617#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1632#L9-3 assume !(sep_~i~0 < ~N~0); 1591#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1592#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1628#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1629#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1649#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1648#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1646#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1647#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1645#L9-8 assume !(sep_~i~0 < ~N~0); 1644#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1643#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1641#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1640#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1639#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1607#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1599#L9-13 [2018-11-23 06:43:06,929 INFO L796 eck$LassoCheckResult]: Loop: 1599#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1600#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1602#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1599#L9-13 [2018-11-23 06:43:06,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1953404899, now seen corresponding path program 1 times [2018-11-23 06:43:06,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:06,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:43:07,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:43:07,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ebf8b22-caac-4516-ae2c-6a2446ca4b7b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:43:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:07,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:07,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-23 06:43:07,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 06:43:07,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 06:43:07,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-11-23 06:43:07,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:43:07,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 06:43:07,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:43:07,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 06:43:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:43:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 06:43:07,384 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:43:07,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2018-11-23 06:43:07,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:07,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:07,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:07,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 06:43:07,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:43:07,446 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. cyclomatic complexity: 27 Second operand 20 states. [2018-11-23 06:43:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:08,512 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-23 06:43:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 06:43:08,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 162 transitions. [2018-11-23 06:43:08,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:43:08,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 162 transitions. [2018-11-23 06:43:08,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 06:43:08,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-23 06:43:08,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 162 transitions. [2018-11-23 06:43:08,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:08,515 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 162 transitions. [2018-11-23 06:43:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 162 transitions. [2018-11-23 06:43:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-11-23 06:43:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 06:43:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2018-11-23 06:43:08,520 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 127 transitions. [2018-11-23 06:43:08,520 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 127 transitions. [2018-11-23 06:43:08,520 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 06:43:08,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 127 transitions. [2018-11-23 06:43:08,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:43:08,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:43:08,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:43:08,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:08,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:43:08,521 INFO L794 eck$LassoCheckResult]: Stem: 1971#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1963#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1964#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1951#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1952#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2002#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2001#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2000#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1957#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1953#L9-3 assume !(sep_~i~0 < ~N~0); 1948#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1949#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1950#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1973#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2043#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2042#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2041#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2040#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2038#L9-8 assume !(sep_~i~0 < ~N~0); 1965#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1946#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1947#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1984#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1983#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1962#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1955#L9-13 [2018-11-23 06:43:08,521 INFO L796 eck$LassoCheckResult]: Loop: 1955#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1956#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1959#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1955#L9-13 [2018-11-23 06:43:08,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash -462632739, now seen corresponding path program 2 times [2018-11-23 06:43:08,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:08,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 4 times [2018-11-23 06:43:08,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:08,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:08,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 258193932, now seen corresponding path program 2 times [2018-11-23 06:43:08,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:43:08,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:43:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:43:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:43:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:43:09,394 WARN L180 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2018-11-23 06:43:09,757 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-23 06:43:09,758 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:43:09,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:43:09,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:43:09,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:43:09,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:43:09,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:43:09,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:43:09,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:43:09,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-23 06:43:09,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:43:09,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:43:09,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:09,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:43:10,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:43:10,047 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:43:10,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:43:10,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:43:10,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:43:10,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,086 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:43:10,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,087 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:43:10,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:43:10,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:43:10,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:43:10,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:43:10,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:43:10,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:43:10,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:43:10,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:43:10,107 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:43:10,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:43:10,116 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:43:10,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:43:10,117 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:43:10,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:43:10,118 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_4, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_4 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-23 06:43:10,182 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 06:43:10,183 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:43:10,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:10,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:10,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:43:10,230 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:43:10,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 127 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-23 06:43:10,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 127 transitions. cyclomatic complexity: 36. Second operand 3 states. Result 107 states and 136 transitions. Complement of second has 4 states. [2018-11-23 06:43:10,240 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 [2018-11-23 06:43:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:43:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 06:43:10,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-23 06:43:10,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:10,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-23 06:43:10,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:10,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-23 06:43:10,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:43:10,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 136 transitions. [2018-11-23 06:43:10,246 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:43:10,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 0 states and 0 transitions. [2018-11-23 06:43:10,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:43:10,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:43:10,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:43:10,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:43:10,246 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:43:10,247 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:43:10,247 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:43:10,247 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 06:43:10,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:43:10,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:43:10,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:43:10,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:43:10 BoogieIcfgContainer [2018-11-23 06:43:10,252 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:43:10,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:43:10,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:43:10,253 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:43:10,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:42:58" (3/4) ... [2018-11-23 06:43:10,256 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:43:10,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:43:10,257 INFO L168 Benchmark]: Toolchain (without parser) took 12320.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 958.2 MB in the beginning and 970.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 272.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:43:10,258 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:43:10,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.34 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:43:10,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:43:10,258 INFO L168 Benchmark]: Boogie Preprocessor took 74.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:43:10,259 INFO L168 Benchmark]: RCFGBuilder took 244.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:43:10,259 INFO L168 Benchmark]: BuchiAutomizer took 11741.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 970.8 MB in the end (delta: 145.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:43:10,259 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.3 GB. Free memory is still 970.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:43:10,262 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.34 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.67 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11741.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 970.8 MB in the end (delta: 145.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.3 GB. Free memory is still 970.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (9 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 8.1s. Construction of modules took 1.2s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 102 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 260 SDtfs, 516 SDslu, 788 SDs, 0 SdLazy, 2198 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital184 mio100 ax100 hnf99 lsp89 ukn71 mio100 lsp60 div100 bol100 ite100 ukn100 eq167 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...