./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/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 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:11:11,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:11:11,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:11:11,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:11:11,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:11:11,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:11:11,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:11:11,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:11:11,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:11:11,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:11:11,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:11:11,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:11:11,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:11:11,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:11:11,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:11:11,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:11:11,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:11:11,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:11:11,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:11:11,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:11:11,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:11:11,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:11:11,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:11:11,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:11:11,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:11:11,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:11:11,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:11:11,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:11:11,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:11:11,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:11:11,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:11:11,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:11:11,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:11:11,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:11:11,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:11:11,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:11:11,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:11:11,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:11:11,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:11:11,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:11:11,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:11:11,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:11:11,656 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:11:11,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:11:11,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:11:11,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:11:11,658 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:11:11,658 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:11:11,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:11:11,659 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:11:11,659 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:11:11,659 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:11:11,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:11:11,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:11:11,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:11:11,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:11:11,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:11:11,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:11:11,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:11:11,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:11:11,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:11:11,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:11:11,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:11:11,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:11:11,663 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:11:11,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:11:11,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:11:11,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:11:11,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:11:11,664 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:11:11,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:11:11,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:11:11,665 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:11:11,666 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:11:11,666 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/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 -> 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 [2019-11-15 21:11:11,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:11:11,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:11:11,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:11:11,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:11:11,725 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:11:11,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i [2019-11-15 21:11:11,794 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/data/3bc10dd1a/2b15cdca7652424abaf9cb3d94d9fa49/FLAGe78f57247 [2019-11-15 21:11:12,329 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:11:12,329 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1-1.i [2019-11-15 21:11:12,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/data/3bc10dd1a/2b15cdca7652424abaf9cb3d94d9fa49/FLAGe78f57247 [2019-11-15 21:11:12,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/data/3bc10dd1a/2b15cdca7652424abaf9cb3d94d9fa49 [2019-11-15 21:11:12,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:11:12,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:11:12,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:12,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:11:12,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:11:12,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:12" (1/1) ... [2019-11-15 21:11:12,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b1f48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:12, skipping insertion in model container [2019-11-15 21:11:12,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:12" (1/1) ... [2019-11-15 21:11:12,637 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:11:12,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:11:12,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:12,987 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:11:13,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:13,045 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:11:13,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13 WrapperNode [2019-11-15 21:11:13,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:13,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:11:13,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:11:13,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:11:13,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:11:13,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:11:13,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:11:13,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:11:13,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... [2019-11-15 21:11:13,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:11:13,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:11:13,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:11:13,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:11:13,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 21:11:13,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 21:11:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 21:11:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 21:11:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:11:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:11:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:11:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 21:11:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:11:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:11:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:11:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:11:13,567 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:11:13,590 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:11:13,591 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:11:13,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:13 BoogieIcfgContainer [2019-11-15 21:11:13,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:11:13,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:11:13,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:11:13,597 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:11:13,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:13,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:11:12" (1/3) ... [2019-11-15 21:11:13,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198649bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:11:13, skipping insertion in model container [2019-11-15 21:11:13,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:13,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:13" (2/3) ... [2019-11-15 21:11:13,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198649bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:11:13, skipping insertion in model container [2019-11-15 21:11:13,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:13,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:13" (3/3) ... [2019-11-15 21:11:13,602 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2.1-1.i [2019-11-15 21:11:13,667 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:11:13,682 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:11:13,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:11:13,682 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:11:13,682 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:11:13,683 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:11:13,683 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:11:13,683 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:11:13,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 21:11:13,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 21:11:13,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:13,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:13,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:11:13,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:11:13,756 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:11:13,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 21:11:13,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-11-15 21:11:13,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:13,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:13,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:11:13,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:11:13,766 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 11#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 17##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 3#$Ultimate##0true #t~loopctr7 := 0; 9#L-1-1true [2019-11-15 21:11:13,767 INFO L793 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 9#L-1-1true [2019-11-15 21:11:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash 28738897, now seen corresponding path program 1 times [2019-11-15 21:11:13,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:13,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839176461] [2019-11-15 21:11:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:13,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:13,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:13,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2019-11-15 21:11:13,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:13,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314298793] [2019-11-15 21:11:13,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:13,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:13,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:13,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 890905848, now seen corresponding path program 1 times [2019-11-15 21:11:13,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:14,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328436112] [2019-11-15 21:11:14,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:14,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:14,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:14,092 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:14,811 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-15 21:11:15,007 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 21:11:15,483 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-11-15 21:11:15,681 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:11:15,694 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:15,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:15,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:15,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:15,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:11:15,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:15,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:15,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:15,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration1_Lasso [2019-11-15 21:11:15,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:15,698 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:15,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,160 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 21:11:16,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,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-11-15 21:11:16,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:16,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-11-15 21:11:16,907 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:16,913 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:11:16,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:16,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:16,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,923 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:16,923 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:16,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:16,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:16,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:16,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:16,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:16,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:16,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:16,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:16,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,950 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:16,951 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:16,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:16,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:16,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:16,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,964 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:16,964 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:16,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:16,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-11-15 21:11:16,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:16,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,977 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:16,977 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:16,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:16,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:16,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:16,987 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-15 21:11:16,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:16,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:16,993 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 21:11:16,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:17,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:17,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,033 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:17,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:17,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:17,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:17,061 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:17,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:17,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,071 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:17,072 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:17,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:17,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:17,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:17,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-11-15 21:11:17,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,116 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:17,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:17,194 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:11:17,233 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:11:17,234 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 21:11:17,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:11:17,244 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:11:17,245 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:11:17,246 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-11-15 21:11:17,324 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 21:11:17,333 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-15 21:11:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:17,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:17,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:17,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:17,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:17,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:11:17,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 2 states. [2019-11-15 21:11:17,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 2 states. Result 26 states and 35 transitions. Complement of second has 6 states. [2019-11-15 21:11:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:11:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:11:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-15 21:11:17,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-15 21:11:17,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:17,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 21:11:17,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:17,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:11:17,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:17,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 35 transitions. [2019-11-15 21:11:17,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:11:17,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 11 transitions. [2019-11-15 21:11:17,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:11:17,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:11:17,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 21:11:17,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:11:17,577 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 21:11:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 21:11:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-15 21:11:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:11:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 21:11:17,609 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 21:11:17,609 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 21:11:17,610 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:11:17,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 21:11:17,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:11:17,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:17,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:17,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:11:17,612 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:11:17,612 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 153#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 154#L31 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 155##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 157#$Ultimate##0 #t~loopctr7 := 0; 158#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 159#L-1-3 [2019-11-15 21:11:17,612 INFO L793 eck$LassoCheckResult]: Loop: 159#L-1-3 assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; 159#L-1-3 [2019-11-15 21:11:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 890905850, now seen corresponding path program 1 times [2019-11-15 21:11:17,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:17,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854260310] [2019-11-15 21:11:17,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:17,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:17,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:17,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854260310] [2019-11-15 21:11:17,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:17,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:11:17,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703514410] [2019-11-15 21:11:17,698 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:11:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2019-11-15 21:11:17,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:17,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692204296] [2019-11-15 21:11:17,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:17,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:17,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:17,705 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:17,725 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:17,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:17,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:17,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:17,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:11:17,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:17,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:17,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:17,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration2_Loop [2019-11-15 21:11:17,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:17,726 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:17,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:17,763 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:17,764 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:17,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:11:17,788 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8eb1176e-b5c9-42e3-a549-c623ec142f8f/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:17,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:11:17,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:11:17,930 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:11:17,932 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:17,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:17,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:17,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:17,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:11:17,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:17,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:17,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:17,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1-1.i_Iteration2_Loop [2019-11-15 21:11:17,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:17,933 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:17,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:17,959 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:17,959 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:11:17,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:17,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:17,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:17,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:17,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:17,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:17,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:17,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:17,965 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:11:17,968 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:11:17,968 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:11:17,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:11:17,969 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:11:17,969 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:11:17,969 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr9) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr9 Supporting invariants [] [2019-11-15 21:11:17,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:11:17,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-11-15 21:11:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:18,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:18,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:18,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:18,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:18,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:11:18,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 21:11:18,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2019-11-15 21:11:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-15 21:11:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:11:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-11-15 21:11:18,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 21:11:18,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:18,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 21:11:18,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:18,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 21:11:18,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:18,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-15 21:11:18,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:11:18,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-15 21:11:18,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:11:18,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:11:18,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:11:18,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:11:18,056 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:18,056 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:18,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:11:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:11:18,061 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-15 21:11:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:18,065 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 21:11:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:11:18,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 21:11:18,066 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:11:18,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:11:18,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:11:18,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:11:18,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:11:18,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:11:18,067 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:18,067 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:18,067 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:18,067 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:11:18,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:11:18,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:11:18,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:11:18,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:11:18 BoogieIcfgContainer [2019-11-15 21:11:18,075 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:11:18,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:11:18,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:11:18,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:11:18,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:13" (3/4) ... [2019-11-15 21:11:18,081 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:11:18,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:11:18,084 INFO L168 Benchmark]: Toolchain (without parser) took 5467.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -74.4 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,084 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:18,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:18,087 INFO L168 Benchmark]: Boogie Preprocessor took 74.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,088 INFO L168 Benchmark]: RCFGBuilder took 398.37 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,089 INFO L168 Benchmark]: BuchiAutomizer took 4482.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.6 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,089 INFO L168 Benchmark]: Witness Printer took 5.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:18,094 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.58 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 74.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 398.37 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4482.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.6 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr7-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr9-aux and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital71 mio100 ax100 hnf100 lsp98 ukn86 mio100 lsp76 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf122 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...