./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca-2.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/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/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 4654dbed0e523ad65784c661074162c44d8abe4e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:55,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:55,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:55,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:55,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:55,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:55,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:55,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:55,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:55,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:55,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:55,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:55,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:55,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:55,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:55,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:55,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:55,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:55,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:55,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:55,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:55,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:55,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:55,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:55,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:55,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:55,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:55,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:55,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:55,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:55,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:55,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:55,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:55,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:55,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:55,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:55,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:55,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:55,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:55,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:55,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:55,204 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:55,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:55,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:55,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:55,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:55,217 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:55,217 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:55,217 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:55,217 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:55,218 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:55,218 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:55,218 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:55,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:55,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:55,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:55,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:55,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:55,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:55,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:55,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:55,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:55,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:55,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:55,221 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:55,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:55,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:55,221 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:55,222 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:55,222 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/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/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 -> 4654dbed0e523ad65784c661074162c44d8abe4e [2019-10-22 09:00:55,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:55,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:55,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:55,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:55,258 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:55,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-10-22 09:00:55,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/data/80eb9e8cd/2c3fde22ce7240df898a7d60ac3b3ec3/FLAGfc8c5cc1e [2019-10-22 09:00:55,747 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:55,747 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-10-22 09:00:55,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/data/80eb9e8cd/2c3fde22ce7240df898a7d60ac3b3ec3/FLAGfc8c5cc1e [2019-10-22 09:00:56,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/bin/uautomizer/data/80eb9e8cd/2c3fde22ce7240df898a7d60ac3b3ec3 [2019-10-22 09:00:56,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:56,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:56,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:56,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:56,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:56,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de4a8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56, skipping insertion in model container [2019-10-22 09:00:56,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,103 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:56,140 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:56,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:56,458 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:56,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:56,535 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:56,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56 WrapperNode [2019-10-22 09:00:56,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:56,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:56,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:56,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:56,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:56,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:56,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:56,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:56,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... [2019-10-22 09:00:56,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:56,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:56,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:56,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:56,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/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-10-22 09:00:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:56,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:56,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:57,052 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:57,053 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 09:00:57,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:57 BoogieIcfgContainer [2019-10-22 09:00:57,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:57,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:57,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:57,059 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:57,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:57,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:56" (1/3) ... [2019-10-22 09:00:57,061 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56fd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:57, skipping insertion in model container [2019-10-22 09:00:57,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:57,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:56" (2/3) ... [2019-10-22 09:00:57,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56fd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:57, skipping insertion in model container [2019-10-22 09:00:57,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:57,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:57" (3/3) ... [2019-10-22 09:00:57,064 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2019-10-22 09:00:57,112 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:57,112 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:57,112 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:57,112 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:57,113 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:57,113 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:57,113 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:57,113 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:57,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:00:57,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 09:00:57,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:57,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:57,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:57,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:57,160 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:57,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:00:57,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 09:00:57,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:57,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:57,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:57,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:57,171 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 18#L539true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 3#L539-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 14#L542-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 5#L549-3true [2019-10-22 09:00:57,171 INFO L793 eck$LassoCheckResult]: Loop: 5#L549-3true assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 4#L549-2true main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 5#L549-3true [2019-10-22 09:00:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:00:57,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955934902] [2019-10-22 09:00:57,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 09:00:57,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741853892] [2019-10-22 09:00:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,345 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 09:00:57,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:57,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314326146] [2019-10-22 09:00:57,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:57,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:57,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:57,601 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 09:00:57,724 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-22 09:00:57,736 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:57,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:57,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:57,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:57,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:57,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:57,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:57,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:57,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2019-10-22 09:00:57,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:57,738 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:57,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:57,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:58,036 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-22 09:00:58,772 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 09:00:58,805 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:58,815 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:58,818 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-10-22 09:00:58,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,829 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-10-22 09:00:58,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,847 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-10-22 09:00:58,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,850 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-10-22 09:00:58,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,853 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,866 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-10-22 09:00:58,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,869 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,872 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-10-22 09:00:58,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,874 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,881 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-10-22 09:00:58,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,888 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-10-22 09:00:58,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,890 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,890 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,896 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-10-22 09:00:58,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,899 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,910 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-10-22 09:00:58,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,911 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,918 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-10-22 09:00:58,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,926 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,926 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,929 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-10-22 09:00:58,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,938 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,942 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-10-22 09:00:58,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,948 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-10-22 09:00:58,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:58,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:58,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:58,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,953 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-10-22 09:00:58,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:58,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:58,973 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-10-22 09:00:58,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:58,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:58,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:58,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:58,987 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:58,987 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:59,066 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:59,092 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:59,093 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:00:59,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:59,097 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:59,097 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:59,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~Alen~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~Alen~0 Supporting invariants [] [2019-10-22 09:00:59,135 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-10-22 09:00:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:59,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:59,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:59,229 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-10-22 09:00:59,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-10-22 09:00:59,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 75 transitions. Complement of second has 7 states. [2019-10-22 09:00:59,275 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-10-22 09:00:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-10-22 09:00:59,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:00:59,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:59,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:00:59,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:59,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2019-10-22 09:00:59,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:59,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2019-10-22 09:00:59,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:00:59,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:59,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-10-22 09:00:59,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:59,291 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:00:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-10-22 09:00:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 09:00:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:00:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-10-22 09:00:59,334 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:00:59,335 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:00:59,335 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:59,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-10-22 09:00:59,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:59,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:59,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:59,336 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,336 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:59,336 INFO L791 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 166#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 156#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 157#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 160#L549-3 assume !(main_~i~1 < main_~Alen~0); 161#L549-4 main_~i~2 := 0; 162#L554-3 [2019-10-22 09:00:59,336 INFO L793 eck$LassoCheckResult]: Loop: 162#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 170#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 162#L554-3 [2019-10-22 09:00:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 09:00:59,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129588563] [2019-10-22 09:00:59,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:59,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129588563] [2019-10-22 09:00:59,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:59,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:59,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303982728] [2019-10-22 09:00:59,390 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 09:00:59,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467429866] [2019-10-22 09:00:59,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,413 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:59,446 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 09:00:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:59,478 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-10-22 09:00:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:59,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-10-22 09:00:59,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:59,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 09:00:59,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:59,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:59,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 09:00:59,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:59,482 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:00:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 09:00:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 09:00:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:00:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 09:00:59,484 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:00:59,484 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:00:59,484 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:59,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 09:00:59,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:00:59,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:59,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:59,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:59,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:59,486 INFO L791 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 208#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 198#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 199#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 202#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 200#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 201#L549-3 assume !(main_~i~1 < main_~Alen~0); 203#L549-4 main_~i~2 := 0; 204#L554-3 [2019-10-22 09:00:59,486 INFO L793 eck$LassoCheckResult]: Loop: 204#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 211#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 204#L554-3 [2019-10-22 09:00:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-10-22 09:00:59,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699911839] [2019-10-22 09:00:59,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,527 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-10-22 09:00:59,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182346960] [2019-10-22 09:00:59,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,536 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-10-22 09:00:59,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:59,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058053657] [2019-10-22 09:00:59,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:59,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:59,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:59,888 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-10-22 09:01:00,004 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 09:01:00,011 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:00,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:00,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:00,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:00,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:00,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:00,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:00,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:00,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2019-10-22 09:01:00,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:00,012 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:00,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,211 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-10-22 09:01:00,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:00,718 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 09:01:00,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:00,756 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:00,756 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-10-22 09:01:00,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:00,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:00,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:00,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,759 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-10-22 09:01:00,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:00,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:00,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:00,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,761 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-10-22 09:01:00,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:00,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:00,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:00,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,763 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-10-22 09:01:00,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,764 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,767 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-10-22 09:01:00,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,768 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,768 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,770 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-10-22 09:01:00,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,772 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,772 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:00,778 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-10-22 09:01:00,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:00,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:00,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:00,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:00,782 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:00,782 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:00,825 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:00,845 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:00,845 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:01:00,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:00,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:00,853 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:00,854 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, ULTIMATE.start_main_~Blen~0) = -1*ULTIMATE.start_main_~i~2 + 1*ULTIMATE.start_main_~Blen~0 Supporting invariants [] [2019-10-22 09:01:00,894 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-10-22 09:01:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:00,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:00,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:00,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:00,942 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-10-22 09:01:00,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:01:00,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2019-10-22 09:01:00,966 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-10-22 09:01:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 09:01:00,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:01:00,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:01:00,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:01:00,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:00,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-10-22 09:01:00,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:00,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-10-22 09:01:00,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:01:00,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:01:00,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-10-22 09:01:00,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:00,969 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 09:01:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-10-22 09:01:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 09:01:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:01:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-10-22 09:01:00,974 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 09:01:00,975 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 09:01:00,975 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:00,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-10-22 09:01:00,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:00,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:00,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:00,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:00,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:00,977 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 362#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 352#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 353#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 356#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 354#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 355#L549-3 assume !(main_~i~1 < main_~Alen~0); 357#L549-4 main_~i~2 := 0; 358#L554-3 assume !(main_~i~2 < main_~Blen~0); 368#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 369#L519-2 [2019-10-22 09:01:00,977 INFO L793 eck$LassoCheckResult]: Loop: 369#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 360#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 363#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 367#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 369#L519-2 [2019-10-22 09:01:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-10-22 09:01:00,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:00,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604610921] [2019-10-22 09:01:00,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:00,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:01,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604610921] [2019-10-22 09:01:01,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:01,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:01,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559961913] [2019-10-22 09:01:01,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2019-10-22 09:01:01,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252321859] [2019-10-22 09:01:01,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:01,145 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 09:01:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,174 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-10-22 09:01:01,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:01,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-10-22 09:01:01,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:01,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 09:01:01,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:01:01,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:01:01,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-10-22 09:01:01,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:01,178 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:01:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-10-22 09:01:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-10-22 09:01:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:01:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 09:01:01,182 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:01:01,182 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:01:01,182 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:01,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 09:01:01,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:01,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:01,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:01,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,183 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:01,183 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 405#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 406#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 396#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 397#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 400#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 398#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 399#L549-3 assume !(main_~i~1 < main_~Alen~0); 401#L549-4 main_~i~2 := 0; 402#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 409#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 410#L554-3 assume !(main_~i~2 < main_~Blen~0); 412#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 413#L519-2 [2019-10-22 09:01:01,183 INFO L793 eck$LassoCheckResult]: Loop: 413#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 404#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 407#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 411#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 413#L519-2 [2019-10-22 09:01:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-10-22 09:01:01,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376491423] [2019-10-22 09:01:01,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,222 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2019-10-22 09:01:01,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221826326] [2019-10-22 09:01:01,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,235 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2019-10-22 09:01:01,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739923969] [2019-10-22 09:01:01,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:01:01,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739923969] [2019-10-22 09:01:01,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:01,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:01,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030629182] [2019-10-22 09:01:01,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:01,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:01,401 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 09:01:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,479 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-10-22 09:01:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:01,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-10-22 09:01:01,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:01:01,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2019-10-22 09:01:01,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:01:01,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:01:01,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-10-22 09:01:01,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:01,483 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 09:01:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-10-22 09:01:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 09:01:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:01:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 09:01:01,485 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:01:01,485 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:01:01,485 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:01,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 09:01:01,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:01:01,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:01,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:01,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,486 INFO L791 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 458#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 448#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 449#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 452#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 450#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 451#L549-3 assume !(main_~i~1 < main_~Alen~0); 453#L549-4 main_~i~2 := 0; 454#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 461#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 462#L554-3 assume !(main_~i~2 < main_~Blen~0); 465#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 466#L519-2 [2019-10-22 09:01:01,487 INFO L793 eck$LassoCheckResult]: Loop: 466#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 459#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 455#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 456#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 463#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 464#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 466#L519-2 [2019-10-22 09:01:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2019-10-22 09:01:01,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907337618] [2019-10-22 09:01:01,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,521 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2019-10-22 09:01:01,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378003189] [2019-10-22 09:01:01,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:01,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378003189] [2019-10-22 09:01:01,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:01,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:01,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537272912] [2019-10-22 09:01:01,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:01,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:01,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:01,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:01,542 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-10-22 09:01:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:01,572 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-10-22 09:01:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:01,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-10-22 09:01:01,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 09:01:01,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2019-10-22 09:01:01,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:01:01,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 09:01:01,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-10-22 09:01:01,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:01,574 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-10-22 09:01:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-10-22 09:01:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-10-22 09:01:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:01:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-22 09:01:01,576 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 09:01:01,576 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 09:01:01,576 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:01,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-10-22 09:01:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:01:01,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:01,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:01,580 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,581 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:01,581 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 510#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 499#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 500#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 503#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 501#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 502#L549-3 assume !(main_~i~1 < main_~Alen~0); 504#L549-4 main_~i~2 := 0; 505#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 513#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 514#L554-3 assume !(main_~i~2 < main_~Blen~0); 516#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 517#L519-2 [2019-10-22 09:01:01,581 INFO L793 eck$LassoCheckResult]: Loop: 517#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 518#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 506#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 507#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 511#L522-2 assume !(0 == diff_~found~0); 515#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 517#L519-2 [2019-10-22 09:01:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2019-10-22 09:01:01,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266820736] [2019-10-22 09:01:01,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,610 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2019-10-22 09:01:01,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289376810] [2019-10-22 09:01:01,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2019-10-22 09:01:01,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:01,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520764998] [2019-10-22 09:01:01,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:01,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:01,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:02,260 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 143 [2019-10-22 09:01:02,470 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-10-22 09:01:02,471 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:02,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:02,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:02,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:02,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:02,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:02,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:02,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:02,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2019-10-22 09:01:02,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:02,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:02,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,848 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-10-22 09:01:02,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,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-10-22 09:01:02,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:02,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-10-22 09:01:02,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-10-22 09:01:02,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-10-22 09:01:03,203 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-10-22 09:01:03,566 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-22 09:01:04,204 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-22 09:01:04,244 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:04,244 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:04,245 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-10-22 09:01:04,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:04,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:04,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:04,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:04,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:04,246 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:04,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:04,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:04,247 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-10-22 09:01:04,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:04,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:04,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:04,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:04,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:04,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:04,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:04,251 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-10-22 09:01:04,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:04,251 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:04,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:04,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:04,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:04,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:04,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:04,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:04,253 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-10-22 09:01:04,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:04,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:04,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:04,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:04,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:04,259 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:04,305 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:04,355 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:04,355 INFO L444 ModelExtractionUtils]: 68 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:04,356 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:04,357 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:04,357 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:04,357 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset) = 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2019-10-22 09:01:04,432 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2019-10-22 09:01:04,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:04,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:04,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:04,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:04,481 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-10-22 09:01:04,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-10-22 09:01:04,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:01:04,498 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-10-22 09:01:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-10-22 09:01:04,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 09:01:04,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:04,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 6 letters. [2019-10-22 09:01:04,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:04,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 12 letters. [2019-10-22 09:01:04,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:04,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-10-22 09:01:04,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:04,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-10-22 09:01:04,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:04,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:01:04,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-10-22 09:01:04,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:04,501 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 09:01:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-10-22 09:01:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-22 09:01:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:01:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 09:01:04,503 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:01:04,503 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:01:04,503 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:04,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 09:01:04,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:04,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:04,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:04,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:04,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:04,504 INFO L791 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 726#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 713#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 714#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 717#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 715#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 716#L549-3 assume !(main_~i~1 < main_~Alen~0); 718#L549-4 main_~i~2 := 0; 719#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 731#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 732#L554-3 assume !(main_~i~2 < main_~Blen~0); 733#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 734#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 721#L523-2 [2019-10-22 09:01:04,504 INFO L793 eck$LassoCheckResult]: Loop: 721#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 720#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 721#L523-2 [2019-10-22 09:01:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2019-10-22 09:01:04,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024755988] [2019-10-22 09:01:04,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2019-10-22 09:01:04,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172554890] [2019-10-22 09:01:04,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2019-10-22 09:01:04,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:04,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952167154] [2019-10-22 09:01:04,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:04,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:04,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:05,110 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 153 [2019-10-22 09:01:05,309 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-10-22 09:01:05,311 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:05,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:05,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:05,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:05,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:05,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:05,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:05,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:05,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2019-10-22 09:01:05,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:05,312 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:05,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,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-10-22 09:01:05,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,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-10-22 09:01:05,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-10-22 09:01:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,805 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 126 [2019-10-22 09:01:05,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:05,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:06,227 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-10-22 09:01:06,887 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-22 09:01:07,020 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 09:01:07,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:07,073 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:07,073 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-10-22 09:01:07,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,075 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,078 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-10-22 09:01:07,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,081 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-10-22 09:01:07,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,083 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,084 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-10-22 09:01:07,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,087 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-10-22 09:01:07,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,089 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-10-22 09:01:07,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,090 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,092 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-10-22 09:01:07,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,095 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-10-22 09:01:07,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,097 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-10-22 09:01:07,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,101 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-10-22 09:01:07,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,106 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-10-22 09:01:07,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,108 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-10-22 09:01:07,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,110 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-10-22 09:01:07,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,113 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-10-22 09:01:07,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,115 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-10-22 09:01:07,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,116 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,118 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-10-22 09:01:07,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,120 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,122 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-10-22 09:01:07,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,124 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-10-22 09:01:07,124 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,126 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-10-22 09:01:07,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:07,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:07,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:07,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,145 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-10-22 09:01:07,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,145 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 09:01:07,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,151 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 09:01:07,158 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,187 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-10-22 09:01:07,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,189 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,189 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,190 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-10-22 09:01:07,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,190 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:07,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,193 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 09:01:07,193 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:01:07,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:07,204 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-10-22 09:01:07,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:07,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:07,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:07,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:07,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:07,210 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:07,284 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:07,374 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:01:07,374 INFO L444 ModelExtractionUtils]: 77 out of 82 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:01:07,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:07,375 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:07,376 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:07,376 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_~l2~0) = -1*ULTIMATE.start_diff_~j~0 + 1*ULTIMATE.start_diff_~l2~0 Supporting invariants [] [2019-10-22 09:01:07,464 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2019-10-22 09:01:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:07,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:07,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:07,514 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-10-22 09:01:07,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:01:07,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 46 states and 63 transitions. Complement of second has 7 states. [2019-10-22 09:01:07,533 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-10-22 09:01:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-10-22 09:01:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 09:01:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 09:01:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:07,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 09:01:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:07,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-10-22 09:01:07,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:07,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2019-10-22 09:01:07,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:07,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:07,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-10-22 09:01:07,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:07,536 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-10-22 09:01:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-10-22 09:01:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-10-22 09:01:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:01:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-10-22 09:01:07,538 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:01:07,538 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:01:07,538 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:07,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-10-22 09:01:07,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:07,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:07,542 INFO L791 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 982#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 983#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 971#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 972#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 975#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 973#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 974#L549-3 assume !(main_~i~1 < main_~Alen~0); 976#L549-4 main_~i~2 := 0; 977#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 988#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 989#L554-3 assume !(main_~i~2 < main_~Blen~0); 990#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 991#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 993#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 980#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 981#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 996#L522-2 assume !(0 == diff_~found~0); 987#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 992#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 979#L523-2 [2019-10-22 09:01:07,543 INFO L793 eck$LassoCheckResult]: Loop: 979#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 978#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 979#L523-2 [2019-10-22 09:01:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2019-10-22 09:01:07,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602956501] [2019-10-22 09:01:07,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:07,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602956501] [2019-10-22 09:01:07,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:07,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:07,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951733828] [2019-10-22 09:01:07,562 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2019-10-22 09:01:07,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532320850] [2019-10-22 09:01:07,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:07,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:07,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:07,617 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:01:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:07,628 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-10-22 09:01:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:07,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-10-22 09:01:07,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:07,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2019-10-22 09:01:07,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:07,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:07,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-10-22 09:01:07,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:07,631 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-10-22 09:01:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-10-22 09:01:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-22 09:01:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:01:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-10-22 09:01:07,634 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-10-22 09:01:07,634 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-10-22 09:01:07,634 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:07,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2019-10-22 09:01:07,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:07,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:07,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:07,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:07,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:07,636 INFO L791 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1046#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1047#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1035#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1036#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1039#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1037#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1038#L549-3 assume !(main_~i~1 < main_~Alen~0); 1040#L549-4 main_~i~2 := 0; 1041#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1053#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1054#L554-3 assume !(main_~i~2 < main_~Blen~0); 1055#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1056#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1058#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1044#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1045#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1060#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1052#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1057#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1043#L523-2 [2019-10-22 09:01:07,636 INFO L793 eck$LassoCheckResult]: Loop: 1043#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1042#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1043#L523-2 [2019-10-22 09:01:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2019-10-22 09:01:07,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621586226] [2019-10-22 09:01:07,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:07,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621586226] [2019-10-22 09:01:07,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143886071] [2019-10-22 09:01:07,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19d08cc1-0264-41f8-a13d-99029f8f9ef4/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-10-22 09:01:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:07,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:01:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:01:07,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:07,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:01:07,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010739409] [2019-10-22 09:01:07,888 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2019-10-22 09:01:07,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:07,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652224596] [2019-10-22 09:01:07,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:07,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:07,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:07,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:01:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:07,945 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 14 states. [2019-10-22 09:01:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:08,084 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-10-22 09:01:08,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:08,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-10-22 09:01:08,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:08,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 40 transitions. [2019-10-22 09:01:08,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:01:08,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:01:08,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-10-22 09:01:08,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:08,086 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 09:01:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-10-22 09:01:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-22 09:01:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:01:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 09:01:08,088 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:01:08,088 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:01:08,088 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:08,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-10-22 09:01:08,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:01:08,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:08,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:08,089 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:08,089 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:08,089 INFO L791 eck$LassoCheckResult]: Stem: 1212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1209#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1196#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1197#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1200#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1198#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1199#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1201#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1221#L549-3 assume !(main_~i~1 < main_~Alen~0); 1202#L549-4 main_~i~2 := 0; 1203#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1213#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1214#L554-3 assume !(main_~i~2 < main_~Blen~0); 1217#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1218#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1220#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1206#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1207#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1222#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1216#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1219#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1205#L523-2 [2019-10-22 09:01:08,089 INFO L793 eck$LassoCheckResult]: Loop: 1205#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1204#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1205#L523-2 [2019-10-22 09:01:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2019-10-22 09:01:08,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348300351] [2019-10-22 09:01:08,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,127 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2019-10-22 09:01:08,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348833541] [2019-10-22 09:01:08,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2019-10-22 09:01:08,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:08,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195139079] [2019-10-22 09:01:08,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:08,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:09,252 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 252 DAG size of output: 201 [2019-10-22 09:01:09,622 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-10-22 09:01:09,625 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:09,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:09,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:09,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:09,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:09,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:09,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:09,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:09,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2019-10-22 09:01:09,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:09,625 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:09,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:09,861 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 09:01:09,864 INFO L168 Benchmark]: Toolchain (without parser) took 13775.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.1 MB). Free memory was 939.2 MB in the beginning and 906.1 MB in the end (delta: 33.0 MB). Peak memory consumption was 456.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,864 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:09,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -208.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.86 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-10-22 09:01:09,865 INFO L168 Benchmark]: Boogie Preprocessor took 28.11 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-10-22 09:01:09,865 INFO L168 Benchmark]: RCFGBuilder took 439.84 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,866 INFO L168 Benchmark]: BuchiAutomizer took 12807.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 252.7 MB). Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 214.0 MB). Peak memory consumption was 466.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:09,868 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 446.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -208.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.86 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 28.11 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. * RCFGBuilder took 439.84 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12807.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 252.7 MB). Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 214.0 MB). Peak memory consumption was 466.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...