./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-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_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/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 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:49,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:49,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:49,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:49,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:49,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:49,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:49,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:49,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:49,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:49,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:49,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:49,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:49,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:49,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:49,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:49,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:49,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:49,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:49,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:49,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:49,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:49,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:49,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:49,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:49,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:49,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:49,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:49,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:49,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:49,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:49,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:49,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:49,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:49,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:49,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:49,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:49,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:49,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:49,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:49,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:49,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:49,891 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:49,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:49,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:49,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:49,896 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:49,896 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:49,896 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:49,897 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:49,897 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:49,897 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:49,897 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:49,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:49,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:49,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:49,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:49,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:49,900 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:49,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:49,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:49,900 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:49,901 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:49,901 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_427716f3-723f-485c-b93a-6fc40287d2cf/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 -> 3dbc6bab9a799b7f4b90bf959cd96947d3b192e5 [2019-10-22 08:59:49,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:49,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:49,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:49,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:49,959 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:49,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i [2019-10-22 08:59:50,006 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/data/41790090f/878d9dc87d1a4235b838cb3131b7d7cd/FLAG63e9efd4c [2019-10-22 08:59:50,389 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:50,389 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2-2.i [2019-10-22 08:59:50,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/data/41790090f/878d9dc87d1a4235b838cb3131b7d7cd/FLAG63e9efd4c [2019-10-22 08:59:50,405 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/bin/uautomizer/data/41790090f/878d9dc87d1a4235b838cb3131b7d7cd [2019-10-22 08:59:50,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:50,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:50,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:50,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:50,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:50,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fc5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50, skipping insertion in model container [2019-10-22 08:59:50,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:50,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:50,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:50,688 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:50,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:50,724 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:50,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50 WrapperNode [2019-10-22 08:59:50,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:50,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:50,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:50,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:50,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:50,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:50,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:50,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:50,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... [2019-10-22 08:59:50,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:50,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:50,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:50,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:50,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/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 08:59:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-22 08:59:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-22 08:59:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 08:59:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-22 08:59:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:51,012 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:59:51,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:51,029 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:59:51,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:51 BoogieIcfgContainer [2019-10-22 08:59:51,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:51,030 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:51,030 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:51,034 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:51,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:51,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:50" (1/3) ... [2019-10-22 08:59:51,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@440d36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:51, skipping insertion in model container [2019-10-22 08:59:51,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:51,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:50" (2/3) ... [2019-10-22 08:59:51,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@440d36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:51, skipping insertion in model container [2019-10-22 08:59:51,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:51,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:51" (3/3) ... [2019-10-22 08:59:51,047 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2-2.i [2019-10-22 08:59:51,091 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:51,091 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:51,091 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:51,091 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:51,091 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:51,091 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:51,092 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:51,092 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:51,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-10-22 08:59:51,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-10-22 08:59:51,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:51,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:51,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:51,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:59:51,175 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:51,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-10-22 08:59:51,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-10-22 08:59:51,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:51,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:51,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:51,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:59:51,185 INFO L791 eck$LassoCheckResult]: Stem: 14#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_#t~mem6, 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(4);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, 4);< 18##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~loopctr8 := 0; 9#L-1-1true [2019-10-22 08:59:51,185 INFO L793 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr8 < size;call #t~mem9 := read~unchecked~int(src.base, src.offset + #t~loopctr8, 1);call write~unchecked~int(#t~mem9, dest.base, dest.offset + #t~loopctr8, 1);#t~loopctr8 := 1 + #t~loopctr8; 9#L-1-1true [2019-10-22 08:59:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28745848, now seen corresponding path program 1 times [2019-10-22 08:59:51,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704804267] [2019-10-22 08:59:51,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,412 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2019-10-22 08:59:51,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117746639] [2019-10-22 08:59:51,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 891121336, now seen corresponding path program 1 times [2019-10-22 08:59:51,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443409145] [2019-10-22 08:59:51,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,916 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-10-22 08:59:52,052 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 08:59:52,409 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-10-22 08:59:52,520 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-22 08:59:52,532 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:52,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:52,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:52,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:52,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:52,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:52,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:52,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:52,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration1_Lasso [2019-10-22 08:59:52,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:52,535 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:52,568 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 08:59:52,573 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 08:59:52,576 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 08:59:52,578 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 08:59:52,581 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 08:59:52,585 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 08:59:52,587 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 08:59:52,590 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 08:59:52,592 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 08:59:52,602 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 08:59:52,604 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 08:59:52,607 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 08:59:52,611 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 08:59:52,618 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 08:59:52,621 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 08:59:52,623 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 08:59:52,625 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 08:59:52,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 08:59:52,630 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 08:59:52,886 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 08:59:52,971 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 08:59:52,973 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 08:59:52,976 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 08:59:53,323 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:53,328 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:53,330 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 08:59:53,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,332 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,337 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 08:59:53,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,341 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 08:59:53,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,344 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 08:59:53,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,348 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 08:59:53,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,355 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 08:59:53,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,359 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 08:59:53,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,361 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,362 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 08:59:53,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,365 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 08:59:53,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,368 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 08:59:53,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,372 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 08:59:53,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,376 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 08:59:53,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,378 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,379 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 08:59:53,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,396 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 08:59:53,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,400 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 08:59:53,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,410 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 08:59:53,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:53,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:53,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:53,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,418 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 08:59:53,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,431 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 08:59:53,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,449 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 08:59:53,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,457 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,457 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,468 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,470 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,481 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 08:59:53,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,485 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,494 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 08:59:53,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,495 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 08:59:53,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,497 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:59:53,498 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,514 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 08:59:53,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,517 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:53,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,521 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,528 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 08:59:53,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,537 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 08:59:53,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,540 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,540 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:53,549 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 08:59:53,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:53,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:53,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:53,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:53,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:53,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:53,581 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:53,617 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:53,617 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:53,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:53,621 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:53,621 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:53,624 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr8, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr8 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-10-22 08:59:53,672 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:59:53,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-10-22 08:59:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,775 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 08:59:53,791 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-10-22 08:59:53,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 2 states. [2019-10-22 08:59:53,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 2 states. Result 28 states and 38 transitions. Complement of second has 6 states. [2019-10-22 08:59:53,859 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-10-22 08:59:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:59:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-10-22 08:59:53,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-10-22 08:59:53,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-10-22 08:59:53,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:53,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:53,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-10-22 08:59:53,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:59:53,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 11 transitions. [2019-10-22 08:59:53,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:59:53,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:53,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-10-22 08:59:53,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:53,890 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:59:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-10-22 08:59:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-10-22 08:59:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:59:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-10-22 08:59:53,917 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:59:53,917 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 08:59:53,917 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:53,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-10-22 08:59:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:59:53,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:53,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:53,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:53,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:59:53,920 INFO L791 eck$LassoCheckResult]: Stem: 160#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); 157#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_#t~mem6, 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(4);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); 158#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, 4);< 159##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; 161#$Ultimate##0 #t~loopctr8 := 0; 162#L-1-1 assume !(#t~loopctr8 < size);#t~loopctr10 := 0; 163#L-1-3 [2019-10-22 08:59:53,920 INFO L793 eck$LassoCheckResult]: Loop: 163#L-1-3 assume #t~loopctr10 < size;#t~loopctr10 := 4 + #t~loopctr10; 163#L-1-3 [2019-10-22 08:59:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 891121338, now seen corresponding path program 1 times [2019-10-22 08:59:53,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488378675] [2019-10-22 08:59:53,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,979 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 08:59:53,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488378675] [2019-10-22 08:59:53,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:53,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:53,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563733431] [2019-10-22 08:59:53,982 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2019-10-22 08:59:53,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684289485] [2019-10-22 08:59:53,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,002 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:54,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:54,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:54,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:54,003 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:59:54,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:54,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:54,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:54,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration2_Loop [2019-10-22 08:59:54,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:54,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:54,004 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 08:59:54,025 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:54,025 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/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) [2019-10-22 08:59:54,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:54,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_427716f3-723f-485c-b93a-6fc40287d2cf/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-10-22 08:59:54,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:59:54,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:54,130 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:59:54,140 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:54,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:54,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:54,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:54,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:54,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:54,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:54,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:54,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2-2.i_Iteration2_Loop [2019-10-22 08:59:54,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:54,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:54,142 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 08:59:54,165 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:54,165 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:54,165 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 08:59:54,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:54,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:54,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:54,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:54,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:54,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:54,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:54,169 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:54,172 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:54,172 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:54,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:54,172 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:59:54,173 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:54,173 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr10) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr10 Supporting invariants [] [2019-10-22 08:59:54,173 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:59:54,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable size [2019-10-22 08:59:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:54,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:54,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,210 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 08:59:54,211 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-10-22 08:59:54,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-10-22 08:59:54,215 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-10-22 08:59:54,216 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-10-22 08:59:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:59:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-10-22 08:59:54,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-10-22 08:59:54,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-10-22 08:59:54,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:54,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:54,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-10-22 08:59:54,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:54,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-10-22 08:59:54,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:54,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:54,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:54,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:54,219 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:54,219 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:54,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:54,223 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-10-22 08:59:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:54,226 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 08:59:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:59:54,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 08:59:54,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:54,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:54,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:54,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:54,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:54,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:54,227 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:54,227 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:54,227 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:54,228 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:54,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:54,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:54,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:54,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:54 BoogieIcfgContainer [2019-10-22 08:59:54,234 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:54,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:54,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:54,235 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:54,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:51" (3/4) ... [2019-10-22 08:59:54,239 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:54,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:54,240 INFO L168 Benchmark]: Toolchain (without parser) took 3832.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:54,241 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:54,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:54,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 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 08:59:54,242 INFO L168 Benchmark]: Boogie Preprocessor took 21.83 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 08:59:54,243 INFO L168 Benchmark]: RCFGBuilder took 248.73 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:54,243 INFO L168 Benchmark]: BuchiAutomizer took 3203.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:54,244 INFO L168 Benchmark]: Witness Printer took 4.64 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 08:59:54,246 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 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.37 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 21.83 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 248.73 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3203.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 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. * 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~loopctr8-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr10-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 3.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. 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: inital69 mio100 ax100 hnf100 lsp98 ukn87 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf122 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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...