./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep05-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/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 d0de1e24b39a951a670bac9cdad830e10aacf376 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:53:11,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:53:11,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:53:11,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:53:11,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:53:11,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:53:11,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:53:11,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:53:11,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:53:11,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:53:11,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:53:11,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:53:11,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:53:11,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:53:11,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:53:11,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:53:11,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:53:11,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:53:11,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:53:11,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:53:11,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:53:11,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:53:11,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:53:11,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:53:11,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:53:11,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:53:11,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:53:11,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:53:11,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:53:11,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:53:11,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:53:11,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:53:11,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:53:11,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:53:11,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:53:11,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:53:11,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:53:11,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:53:11,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:53:11,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:53:11,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:53:11,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:53:11,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:53:11,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:53:11,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:53:11,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:53:11,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:53:11,148 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:53:11,148 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:53:11,148 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:53:11,148 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:53:11,148 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:53:11,149 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:53:11,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:53:11,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:53:11,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:53:11,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:53:11,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:53:11,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:53:11,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:53:11,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:53:11,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:53:11,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:53:11,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:53:11,151 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:53:11,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:53:11,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:53:11,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:53:11,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:53:11,152 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:53:11,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:53:11,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:53:11,153 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:53:11,154 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:53:11,154 INFO L138 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/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/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 -> d0de1e24b39a951a670bac9cdad830e10aacf376 [2019-11-15 22:53:11,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:53:11,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:53:11,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:53:11,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:53:11,193 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:53:11,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep05-1.i [2019-11-15 22:53:11,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/data/4a8dfd43b/9666ce26fd224aacbc36940c04a0f1a5/FLAGfd7049167 [2019-11-15 22:53:11,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:53:11,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/sv-benchmarks/c/reducercommutativity/sep05-1.i [2019-11-15 22:53:11,655 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/data/4a8dfd43b/9666ce26fd224aacbc36940c04a0f1a5/FLAGfd7049167 [2019-11-15 22:53:11,665 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/data/4a8dfd43b/9666ce26fd224aacbc36940c04a0f1a5 [2019-11-15 22:53:11,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:53:11,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:53:11,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:11,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:53:11,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:53:11,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:11" (1/1) ... [2019-11-15 22:53:11,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c06bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:11, skipping insertion in model container [2019-11-15 22:53:11,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:11" (1/1) ... [2019-11-15 22:53:11,683 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:53:11,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:53:11,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:11,985 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:53:12,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:12,020 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:53:12,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12 WrapperNode [2019-11-15 22:53:12,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:12,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:12,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:53:12,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:53:12,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:12,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:53:12,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:53:12,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:53:12,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... [2019-11-15 22:53:12,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:53:12,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:53:12,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:53:12,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:53:12,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/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 [2019-11-15 22:53:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:53:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:53:12,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:53:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:53:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:53:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:53:12,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:53:12,565 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-15 22:53:12,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:12 BoogieIcfgContainer [2019-11-15 22:53:12,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:53:12,567 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:53:12,567 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:53:12,575 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:53:12,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:12,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:53:11" (1/3) ... [2019-11-15 22:53:12,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61fda3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:12, skipping insertion in model container [2019-11-15 22:53:12,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:12,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:12" (2/3) ... [2019-11-15 22:53:12,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61fda3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:12, skipping insertion in model container [2019-11-15 22:53:12,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:12,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:12" (3/3) ... [2019-11-15 22:53:12,581 INFO L371 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2019-11-15 22:53:12,624 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:53:12,624 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:53:12,624 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:53:12,625 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:53:12,625 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:53:12,625 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:53:12,625 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:53:12,625 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:53:12,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-15 22:53:12,663 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-15 22:53:12,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:12,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:12,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:53:12,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:53:12,672 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:53:12,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-15 22:53:12,678 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-15 22:53:12,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:12,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:12,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:53:12,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:53:12,685 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 28#L26-3true [2019-11-15 22:53:12,686 INFO L793 eck$LassoCheckResult]: Loop: 28#L26-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 29#L26-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 28#L26-3true [2019-11-15 22:53:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:53:12,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:12,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639919731] [2019-11-15 22:53:12,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,801 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 22:53:12,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:12,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173868344] [2019-11-15 22:53:12,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,817 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 22:53:12,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:12,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759886831] [2019-11-15 22:53:12,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:12,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:12,853 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:13,021 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:13,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:13,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:13,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:13,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:13,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:13,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:13,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:13,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2019-11-15 22:53:13,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:13,024 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:13,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:13,404 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:13,411 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:13,414 INFO L120 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 [2019-11-15 22:53:13,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,441 INFO L120 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 [2019-11-15 22:53:13,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,451 INFO L120 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 [2019-11-15 22:53:13,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,455 INFO L120 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 [2019-11-15 22:53:13,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,457 INFO L120 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 [2019-11-15 22:53:13,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,458 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,459 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,460 INFO L120 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 [2019-11-15 22:53:13,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,462 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,463 INFO L120 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 [2019-11-15 22:53:13,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:13,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:13,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,476 INFO L120 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 [2019-11-15 22:53:13,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,483 INFO L120 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 [2019-11-15 22:53:13,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,485 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,485 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,487 INFO L120 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 [2019-11-15 22:53:13,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,489 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,490 INFO L120 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 [2019-11-15 22:53:13,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,491 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:53:13,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,497 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:53:13,497 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:13,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,526 INFO L120 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 [2019-11-15 22:53:13,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,536 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:13,536 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:13,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,542 INFO L120 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 [2019-11-15 22:53:13,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,546 INFO L120 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 [2019-11-15 22:53:13,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:13,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:13,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,577 INFO L120 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 [2019-11-15 22:53:13,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:13,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:13,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:13,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:13,583 INFO L120 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 [2019-11-15 22:53:13,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:13,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:13,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:13,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:13,587 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:13,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:13,650 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:13,681 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:53:13,681 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:13,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:13,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:13,685 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:13,686 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 9 Supporting invariants [] [2019-11-15 22:53:13,696 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 22:53:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:13,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:13,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:13,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:13,784 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 [2019-11-15 22:53:13,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-11-15 22:53:13,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 78 states and 113 transitions. Complement of second has 7 states. [2019-11-15 22:53:13,839 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 [2019-11-15 22:53:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2019-11-15 22:53:13,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 22:53:13,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:13,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:53:13,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:13,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 22:53:13,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:13,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 113 transitions. [2019-11-15 22:53:13,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:13,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 30 transitions. [2019-11-15 22:53:13,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 22:53:13,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-15 22:53:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:13,856 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 22:53:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-15 22:53:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 22:53:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:53:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-15 22:53:13,878 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 22:53:13,878 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 22:53:13,878 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:53:13,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-15 22:53:13,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:13,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:13,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:13,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:53:13,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:13,880 INFO L791 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 162#L26-3 assume !(main_~i~1 < 5); 166#L26-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; 152#L7-3 [2019-11-15 22:53:13,880 INFO L793 eck$LassoCheckResult]: Loop: 152#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 158#L9 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; 151#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 152#L7-3 [2019-11-15 22:53:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 22:53:13,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:13,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750756852] [2019-11-15 22:53:13,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:13,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750756852] [2019-11-15 22:53:13,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:13,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:13,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283508934] [2019-11-15 22:53:13,923 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-11-15 22:53:13,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:13,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394037885] [2019-11-15 22:53:13,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:13,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:13,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:14,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:14,035 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:53:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:14,054 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-11-15 22:53:14,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:14,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-15 22:53:14,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 22:53:14,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:14,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:14,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-15 22:53:14,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:14,060 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 22:53:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-15 22:53:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 22:53:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:53:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-11-15 22:53:14,063 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 22:53:14,063 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 22:53:14,063 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:53:14,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-11-15 22:53:14,064 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:14,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:14,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:53:14,064 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:14,065 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 211#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 212#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 218#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 219#L26-3 assume !(main_~i~1 < 5); 217#L26-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; 204#L7-3 [2019-11-15 22:53:14,065 INFO L793 eck$LassoCheckResult]: Loop: 204#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 209#L9 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#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 204#L7-3 [2019-11-15 22:53:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,065 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 22:53:14,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243739016] [2019-11-15 22:53:14,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243739016] [2019-11-15 22:53:14,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166176564] [2019-11-15 22:53:14,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:14,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:53:14,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:14,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:53:14,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816297212] [2019-11-15 22:53:14,184 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-11-15 22:53:14,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11269898] [2019-11-15 22:53:14,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:14,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:14,294 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-15 22:53:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:14,317 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-15 22:53:14,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:14,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-15 22:53:14,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2019-11-15 22:53:14,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:14,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:14,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-15 22:53:14,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:14,321 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-15 22:53:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-15 22:53:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-15 22:53:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 22:53:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-15 22:53:14,324 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-15 22:53:14,324 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-15 22:53:14,324 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:53:14,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-11-15 22:53:14,325 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:14,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:14,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 22:53:14,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:14,331 INFO L791 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 283#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 288#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 289#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 290#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 293#L26-3 assume !(main_~i~1 < 5); 287#L26-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; 273#L7-3 [2019-11-15 22:53:14,331 INFO L793 eck$LassoCheckResult]: Loop: 273#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 279#L9 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; 272#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 273#L7-3 [2019-11-15 22:53:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-15 22:53:14,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749945449] [2019-11-15 22:53:14,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749945449] [2019-11-15 22:53:14,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22039098] [2019-11-15 22:53:14,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:14,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:53:14,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:53:14,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:14,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,462 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:14,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 22:53:14,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870460084] [2019-11-15 22:53:14,462 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-11-15 22:53:14,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604869740] [2019-11-15 22:53:14,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,492 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:14,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:14,587 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-15 22:53:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:14,613 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-15 22:53:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:14,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-15 22:53:14,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-11-15 22:53:14,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:14,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:14,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-15 22:53:14,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:14,617 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:53:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-15 22:53:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-15 22:53:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:53:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 22:53:14,619 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:53:14,620 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:53:14,620 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:53:14,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-15 22:53:14,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:14,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:14,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-15 22:53:14,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:14,622 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 362#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 369#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 370#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 371#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 376#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 375#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 374#L26-3 assume !(main_~i~1 < 5); 368#L26-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; 354#L7-3 [2019-11-15 22:53:14,622 INFO L793 eck$LassoCheckResult]: Loop: 354#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 360#L9 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; 353#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 354#L7-3 [2019-11-15 22:53:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-15 22:53:14,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548294529] [2019-11-15 22:53:14,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548294529] [2019-11-15 22:53:14,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565671243] [2019-11-15 22:53:14,665 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:14,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:53:14,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:53:14,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:53:14,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,742 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:14,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 22:53:14,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742883992] [2019-11-15 22:53:14,743 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-11-15 22:53:14,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345111839] [2019-11-15 22:53:14,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:14,763 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:14,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:53:14,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:14,841 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:53:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:14,868 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-15 22:53:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:53:14,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-15 22:53:14,869 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-11-15 22:53:14,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:14,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:14,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 22:53:14,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:14,871 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 22:53:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 22:53:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 22:53:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:53:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 22:53:14,874 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:53:14,874 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:53:14,874 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:53:14,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-15 22:53:14,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:14,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:14,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:14,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-15 22:53:14,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:14,876 INFO L791 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 453#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 454#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 461#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 462#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 463#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 464#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 470#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 469#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 468#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 467#L26-3 assume !(main_~i~1 < 5); 460#L26-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; 446#L7-3 [2019-11-15 22:53:14,876 INFO L793 eck$LassoCheckResult]: Loop: 446#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 452#L9 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; 445#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 446#L7-3 [2019-11-15 22:53:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-15 22:53:14,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:14,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296427496] [2019-11-15 22:53:14,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:14,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:14,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296427496] [2019-11-15 22:53:14,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783802975] [2019-11-15 22:53:14,942 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:15,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:53:15,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:53:15,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:53:15,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:15,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:15,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 22:53:15,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432825059] [2019-11-15 22:53:15,024 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-11-15 22:53:15,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:15,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995960305] [2019-11-15 22:53:15,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,043 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:15,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:15,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:53:15,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:53:15,126 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-15 22:53:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:15,156 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-15 22:53:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:53:15,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-11-15 22:53:15,158 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:15,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-11-15 22:53:15,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:15,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:15,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-15 22:53:15,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:15,159 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-15 22:53:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-15 22:53:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 22:53:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:53:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-15 22:53:15,162 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-15 22:53:15,162 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-15 22:53:15,163 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:53:15,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-11-15 22:53:15,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 22:53:15,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:15,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:15,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-15 22:53:15,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:15,165 INFO L791 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 556#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 563#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 564#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 565#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 574#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 573#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 572#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 571#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 570#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 569#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 568#L26-3 assume !(main_~i~1 < 5); 562#L26-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; 548#L7-3 [2019-11-15 22:53:15,165 INFO L793 eck$LassoCheckResult]: Loop: 548#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 554#L9 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; 547#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 548#L7-3 [2019-11-15 22:53:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-15 22:53:15,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:15,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344869126] [2019-11-15 22:53:15,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,188 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-11-15 22:53:15,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:15,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586972275] [2019-11-15 22:53:15,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,197 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-11-15 22:53:15,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:15,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250089851] [2019-11-15 22:53:15,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:15,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:15,249 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:15,795 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 102 [2019-11-15 22:53:15,914 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:53:15,917 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:15,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:15,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:15,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:15,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:15,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:15,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:15,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:15,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration7_Lasso [2019-11-15 22:53:15,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:15,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:15,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:15,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:16,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:16,402 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:16,402 INFO L120 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 [2019-11-15 22:53:16,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,405 INFO L120 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 [2019-11-15 22:53:16,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,407 INFO L120 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 [2019-11-15 22:53:16,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,409 INFO L120 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 [2019-11-15 22:53:16,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,411 INFO L120 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 [2019-11-15 22:53:16,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,413 INFO L120 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 [2019-11-15 22:53:16,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,416 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:16,417 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:16,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,419 INFO L120 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 [2019-11-15 22:53:16,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,422 INFO L120 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 [2019-11-15 22:53:16,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,424 INFO L120 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 [2019-11-15 22:53:16,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,427 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:16,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:16,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,432 INFO L120 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 [2019-11-15 22:53:16,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,436 INFO L120 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 [2019-11-15 22:53:16,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,438 INFO L120 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 [2019-11-15 22:53:16,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,441 INFO L120 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 [2019-11-15 22:53:16,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,443 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,444 INFO L120 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 [2019-11-15 22:53:16,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:16,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:16,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,448 INFO L120 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 [2019-11-15 22:53:16,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:16,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:16,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:16,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,451 INFO L120 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 [2019-11-15 22:53:16,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,452 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:53:16,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,454 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:53:16,454 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:16,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:16,461 INFO L120 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 [2019-11-15 22:53:16,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:16,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:16,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:16,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:16,465 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:16,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:16,480 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:16,493 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:16,493 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:16,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:16,494 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:16,495 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:16,495 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0) = -2*ULTIMATE.start_sep_~i~0 + 9 Supporting invariants [] [2019-11-15 22:53:16,510 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:53:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:16,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:16,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:16,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:16,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:16,559 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 [2019-11-15 22:53:16,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 22:53:16,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2019-11-15 22:53:16,580 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 [2019-11-15 22:53:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 22:53:16,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:53:16,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:16,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 22:53:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:16,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:53:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:16,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-11-15 22:53:16,584 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:16,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2019-11-15 22:53:16,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:53:16,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 22:53:16,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2019-11-15 22:53:16,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:16,586 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-15 22:53:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2019-11-15 22:53:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 22:53:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:53:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-15 22:53:16,588 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-15 22:53:16,588 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-15 22:53:16,588 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:53:16,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-11-15 22:53:16,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:16,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:16,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:16,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:16,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:16,590 INFO L791 eck$LassoCheckResult]: Stem: 711#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 707#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 708#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 716#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 717#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 718#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 727#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 726#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 725#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 724#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 723#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 722#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 721#L26-3 assume !(main_~i~1 < 5); 714#L26-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; 715#L7-3 assume !(sep_~i~0 < 5); 719#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 720#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 709#L7-8 [2019-11-15 22:53:16,590 INFO L793 eck$LassoCheckResult]: Loop: 709#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 702#L9-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; 703#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 709#L7-8 [2019-11-15 22:53:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2019-11-15 22:53:16,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:16,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437866657] [2019-11-15 22:53:16,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:53:16,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437866657] [2019-11-15 22:53:16,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:16,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:16,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911867010] [2019-11-15 22:53:16,617 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2019-11-15 22:53:16,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:16,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824695772] [2019-11-15 22:53:16,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:16,626 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:16,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:16,689 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:53:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:16,737 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-15 22:53:16,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:53:16,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-15 22:53:16,738 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:16,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-11-15 22:53:16,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 22:53:16,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:53:16,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-11-15 22:53:16,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:16,739 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-15 22:53:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-11-15 22:53:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-15 22:53:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:53:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-15 22:53:16,742 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 22:53:16,742 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 22:53:16,742 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:53:16,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-15 22:53:16,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:16,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:16,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:16,743 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:16,743 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:16,744 INFO L791 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 783#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 784#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 793#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 794#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 795#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 804#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 803#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 802#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 801#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 800#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 799#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 798#L26-3 assume !(main_~i~1 < 5); 791#L26-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; 792#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 782#L9 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; 776#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 777#L7-3 assume !(sep_~i~0 < 5); 796#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 797#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 785#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 778#L9-2 [2019-11-15 22:53:16,744 INFO L793 eck$LassoCheckResult]: Loop: 778#L9-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; 779#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 788#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 778#L9-2 [2019-11-15 22:53:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2019-11-15 22:53:16,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:16,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976850699] [2019-11-15 22:53:16,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:53:16,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976850699] [2019-11-15 22:53:16,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324234082] [2019-11-15 22:53:16,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:16,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:53:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:53:16,897 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:16,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 22:53:16,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712093171] [2019-11-15 22:53:16,898 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2019-11-15 22:53:16,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:16,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792329842] [2019-11-15 22:53:16,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:16,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:16,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:16,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:53:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:53:16,992 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-15 22:53:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:17,037 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-11-15 22:53:17,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:17,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2019-11-15 22:53:17,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 61 transitions. [2019-11-15 22:53:17,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 22:53:17,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 22:53:17,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2019-11-15 22:53:17,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:17,040 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-11-15 22:53:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2019-11-15 22:53:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2019-11-15 22:53:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:53:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-11-15 22:53:17,043 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-11-15 22:53:17,043 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-11-15 22:53:17,043 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:53:17,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2019-11-15 22:53:17,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:17,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:17,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:17,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:17,045 INFO L791 eck$LassoCheckResult]: Stem: 939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 934#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 935#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 942#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 943#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 944#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 958#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 957#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 956#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 955#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 954#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 953#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 952#L26-3 assume !(main_~i~1 < 5); 940#L26-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; 941#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 948#L9 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; 923#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 924#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 930#L9 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; 931#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 950#L7-3 assume !(sep_~i~0 < 5); 945#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 946#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 947#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 951#L9-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; 936#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 932#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 926#L9-2 [2019-11-15 22:53:17,045 INFO L793 eck$LassoCheckResult]: Loop: 926#L9-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; 927#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 949#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 926#L9-2 [2019-11-15 22:53:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1248848095, now seen corresponding path program 1 times [2019-11-15 22:53:17,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409722598] [2019-11-15 22:53:17,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:53:17,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409722598] [2019-11-15 22:53:17,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664538556] [2019-11-15 22:53:17,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:17,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:17,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:53:17,195 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:17,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 22:53:17,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410755756] [2019-11-15 22:53:17,195 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2019-11-15 22:53:17,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955201117] [2019-11-15 22:53:17,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,207 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:17,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:17,264 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-15 22:53:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:17,332 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-11-15 22:53:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:17,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2019-11-15 22:53:17,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions. [2019-11-15 22:53:17,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 22:53:17,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 22:53:17,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions. [2019-11-15 22:53:17,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:17,336 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-11-15 22:53:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions. [2019-11-15 22:53:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-11-15 22:53:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 22:53:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-11-15 22:53:17,340 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-15 22:53:17,340 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-15 22:53:17,340 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:53:17,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2019-11-15 22:53:17,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:17,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:17,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:17,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:17,344 INFO L791 eck$LassoCheckResult]: Stem: 1118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1114#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1115#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1125#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1126#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1127#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1140#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1139#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1138#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1137#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1136#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1135#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1134#L26-3 assume !(main_~i~1 < 5); 1123#L26-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; 1124#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1131#L9 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; 1141#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1144#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1145#L9 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; 1105#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1106#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1112#L9 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; 1113#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1133#L7-3 assume !(sep_~i~0 < 5); 1128#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1129#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1130#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1146#L9-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; 1119#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1120#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1142#L9-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; 1143#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1116#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1108#L9-2 [2019-11-15 22:53:17,344 INFO L793 eck$LassoCheckResult]: Loop: 1108#L9-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; 1109#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1132#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1108#L9-2 [2019-11-15 22:53:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1685621030, now seen corresponding path program 2 times [2019-11-15 22:53:17,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53566836] [2019-11-15 22:53:17,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:53:17,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53566836] [2019-11-15 22:53:17,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319804113] [2019-11-15 22:53:17,423 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:17,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:53:17,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:53:17,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:53:17,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:53:17,533 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:17,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 22:53:17,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592275097] [2019-11-15 22:53:17,534 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2019-11-15 22:53:17,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203628503] [2019-11-15 22:53:17,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:17,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:53:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:53:17,611 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-15 22:53:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:17,690 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-11-15 22:53:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:53:17,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2019-11-15 22:53:17,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 85 transitions. [2019-11-15 22:53:17,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 22:53:17,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 22:53:17,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 85 transitions. [2019-11-15 22:53:17,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:17,693 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-15 22:53:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 85 transitions. [2019-11-15 22:53:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-11-15 22:53:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:53:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-11-15 22:53:17,697 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-15 22:53:17,697 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-15 22:53:17,697 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:53:17,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2019-11-15 22:53:17,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:17,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:17,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:17,706 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:17,706 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:17,706 INFO L791 eck$LassoCheckResult]: Stem: 1336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1331#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1332#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1339#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1340#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1341#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1359#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1358#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1357#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1356#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1355#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1354#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1353#L26-3 assume !(main_~i~1 < 5); 1337#L26-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; 1338#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1345#L9 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; 1368#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1346#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1328#L9 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; 1321#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1322#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1367#L9 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; 1366#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1365#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1351#L9 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; 1352#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1350#L7-3 assume !(sep_~i~0 < 5); 1342#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1343#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1344#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1364#L9-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; 1333#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1329#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1324#L9-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; 1325#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1363#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1362#L9-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; 1361#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1360#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1348#L9-2 [2019-11-15 22:53:17,707 INFO L793 eck$LassoCheckResult]: Loop: 1348#L9-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; 1349#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1347#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1348#L9-2 [2019-11-15 22:53:17,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 3 times [2019-11-15 22:53:17,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624475204] [2019-11-15 22:53:17,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 22:53:17,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624475204] [2019-11-15 22:53:17,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119101459] [2019-11-15 22:53:17,795 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b48378a-7c7c-44d8-be66-4da061bf16d4/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:17,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 22:53:17,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:53:17,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:53:17,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 22:53:17,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:17,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 22:53:17,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896738251] [2019-11-15 22:53:17,940 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 5 times [2019-11-15 22:53:17,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:17,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295275899] [2019-11-15 22:53:17,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:17,960 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:18,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:53:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:53:18,011 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-11-15 22:53:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:18,119 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2019-11-15 22:53:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:53:18,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2019-11-15 22:53:18,121 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:18,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2019-11-15 22:53:18,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-15 22:53:18,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-15 22:53:18,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2019-11-15 22:53:18,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:18,122 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2019-11-15 22:53:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2019-11-15 22:53:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2019-11-15 22:53:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 22:53:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2019-11-15 22:53:18,130 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-11-15 22:53:18,131 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-11-15 22:53:18,131 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 22:53:18,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2019-11-15 22:53:18,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 22:53:18,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:18,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:18,134 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:18,134 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:18,136 INFO L791 eck$LassoCheckResult]: Stem: 1580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1575#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1576#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1583#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1584#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1585#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1618#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1617#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1616#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1614#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1613#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1611#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1610#L26-3 assume !(main_~i~1 < 5); 1581#L26-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; 1582#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1589#L9 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; 1612#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1590#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1572#L9 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; 1566#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1567#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1609#L9 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; 1608#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1607#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1605#L9 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; 1603#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1601#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1596#L9 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; 1598#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1595#L7-3 assume !(sep_~i~0 < 5); 1586#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1587#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1588#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1615#L9-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; 1577#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1573#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1568#L9-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; 1569#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1606#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1604#L9-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; 1602#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1600#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1599#L9-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; 1597#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1594#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1592#L9-2 [2019-11-15 22:53:18,137 INFO L793 eck$LassoCheckResult]: Loop: 1592#L9-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; 1593#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1591#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1592#L9-2 [2019-11-15 22:53:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 4 times [2019-11-15 22:53:18,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:18,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931565033] [2019-11-15 22:53:18,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 6 times [2019-11-15 22:53:18,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:18,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432089152] [2019-11-15 22:53:18,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,356 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2019-11-15 22:53:18,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:18,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570945596] [2019-11-15 22:53:18,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 22:53:18,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570945596] [2019-11-15 22:53:18,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:18,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:53:18,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238732419] [2019-11-15 22:53:18,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:18,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:53:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:53:18,556 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-11-15 22:53:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:18,801 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-11-15 22:53:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:53:18,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-11-15 22:53:18,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:53:18,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2019-11-15 22:53:18,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 22:53:18,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 22:53:18,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2019-11-15 22:53:18,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:18,805 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-11-15 22:53:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2019-11-15 22:53:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-15 22:53:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 22:53:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-11-15 22:53:18,808 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-11-15 22:53:18,808 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-11-15 22:53:18,812 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 22:53:18,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2019-11-15 22:53:18,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:53:18,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:18,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:18,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:18,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:53:18,817 INFO L791 eck$LassoCheckResult]: Stem: 1728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1723#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1724#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1731#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1732#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1733#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1765#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1764#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1763#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1762#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1761#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L26-3 assume !(main_~i~1 < 5); 1729#L26-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; 1730#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1721#L9 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; 1715#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1716#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1759#L9 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; 1757#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1755#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1753#L9 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; 1751#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1749#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1747#L9 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; 1745#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1743#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1741#L9 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; 1739#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1737#L7-3 assume !(sep_~i~0 < 5); 1734#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1735#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;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; 1722#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1717#L9-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; 1718#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1725#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1758#L9-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; 1756#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1754#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1752#L9-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; 1750#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1748#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1746#L9-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; 1744#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1742#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1740#L9-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; 1738#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1736#L7-8 assume !(sep_~i~0 < 5); 1719#L7-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1720#L14-1 main_#t~ret9 := sep_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1726#L35-3 [2019-11-15 22:53:18,818 INFO L793 eck$LassoCheckResult]: Loop: 1726#L35-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1727#L35-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1726#L35-3 [2019-11-15 22:53:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2019-11-15 22:53:18,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:18,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320775629] [2019-11-15 22:53:18,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:18,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2019-11-15 22:53:18,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:18,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085718521] [2019-11-15 22:53:18,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:18,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:19,007 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2019-11-15 22:53:19,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:19,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283412951] [2019-11-15 22:53:19,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:19,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:19,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:19,221 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:23,904 WARN L191 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 463 DAG size of output: 312 [2019-11-15 22:53:23,907 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-15 22:53:45,353 WARN L191 SmtUtils]: Spent 12.00 s on a formula simplification. DAG size of input: 638 DAG size of output: 128 [2019-11-15 22:53:45,355 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:45,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:45,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:45,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:45,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:45,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:45,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:45,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:45,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration14_Lasso [2019-11-15 22:53:45,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:45,356 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:45,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,762 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-11-15 22:53:45,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:45,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:46,453 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:46,454 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:46,454 INFO L120 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 [2019-11-15 22:53:46,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,456 INFO L120 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 [2019-11-15 22:53:46,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,458 INFO L120 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 [2019-11-15 22:53:46,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,460 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,461 INFO L120 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 [2019-11-15 22:53:46,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,465 INFO L120 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 [2019-11-15 22:53:46,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,468 INFO L120 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 [2019-11-15 22:53:46,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,470 INFO L120 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 [2019-11-15 22:53:46,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,473 INFO L120 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 [2019-11-15 22:53:46,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,480 INFO L120 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 [2019-11-15 22:53:46,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,482 INFO L120 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 [2019-11-15 22:53:46,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,486 INFO L120 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 [2019-11-15 22:53:46,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,487 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,487 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,488 INFO L120 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 [2019-11-15 22:53:46,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,489 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,490 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,493 INFO L120 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 [2019-11-15 22:53:46,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,494 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,495 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,495 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,498 INFO L120 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 [2019-11-15 22:53:46,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,501 INFO L120 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 [2019-11-15 22:53:46,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:46,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,502 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:46,502 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:46,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,503 INFO L120 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 [2019-11-15 22:53:46,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,504 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,505 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,505 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,507 INFO L120 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 [2019-11-15 22:53:46,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,512 INFO L120 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 [2019-11-15 22:53:46,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,515 INFO L120 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 [2019-11-15 22:53:46,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,517 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,520 INFO L120 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 [2019-11-15 22:53:46,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,521 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,521 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:46,523 INFO L120 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 [2019-11-15 22:53:46,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:46,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:46,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:46,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:46,525 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:53:46,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:53:46,538 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:46,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:53:46,549 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:46,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:46,550 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:53:46,550 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:46,550 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2019-11-15 22:53:46,637 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2019-11-15 22:53:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:46,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:46,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:46,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:46,726 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 [2019-11-15 22:53:46,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:53:46,742 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 54 states and 66 transitions. Complement of second has 4 states. [2019-11-15 22:53:46,742 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 [2019-11-15 22:53:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-15 22:53:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-15 22:53:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-15 22:53:46,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2019-11-15 22:53:46,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:46,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2019-11-15 22:53:46,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:46,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2019-11-15 22:53:46,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:53:46,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:53:46,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:53:46,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:46,746 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:46,746 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:46,746 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:46,746 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 22:53:46,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:53:46,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:46,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:53:46,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:53:46 BoogieIcfgContainer [2019-11-15 22:53:46,755 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:53:46,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:53:46,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:53:46,756 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:53:46,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:12" (3/4) ... [2019-11-15 22:53:46,762 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:53:46,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:53:46,763 INFO L168 Benchmark]: Toolchain (without parser) took 35094.31 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 622.9 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -290.7 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:46,763 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:46,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:46,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:46,765 INFO L168 Benchmark]: Boogie Preprocessor took 59.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:46,765 INFO L168 Benchmark]: RCFGBuilder took 409.47 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:46,766 INFO L168 Benchmark]: BuchiAutomizer took 34187.43 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 484.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.6 MB). Peak memory consumption was 356.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:46,766 INFO L168 Benchmark]: Witness Printer took 6.76 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:46,769 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 409.47 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34187.43 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 484.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.6 MB). Peak memory consumption was 356.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.76 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.1s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 32.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 340 SDtfs, 347 SDslu, 670 SDs, 0 SdLazy, 303 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax100 hnf99 lsp93 ukn51 mio100 lsp55 div100 bol100 ite100 ukn100 eq170 hnf85 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 2 VariablesLoop: 0 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...