./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 2187ad12904216f135de1d4e0a00e45b56b4da69 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:23:23,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:23:23,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:23:23,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:23:23,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:23:23,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:23:23,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:23:23,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:23:23,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:23:23,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:23:23,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:23:23,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:23:23,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:23:23,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:23:23,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:23:23,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:23:23,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:23:23,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:23:23,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:23:23,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:23:23,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:23:23,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:23:23,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:23:23,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:23:23,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:23:23,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:23:23,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:23:23,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:23:23,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:23:23,854 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:23:23,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:23:23,855 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:23:23,855 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:23:23,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:23:23,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:23:23,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:23:23,859 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:23:23,890 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:23:23,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:23:23,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:23:23,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:23:23,892 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:23:23,892 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:23:23,892 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:23:23,893 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:23:23,893 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:23:23,893 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:23:23,893 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:23:23,893 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:23:23,893 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:23:23,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:23:23,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:23:23,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:23:23,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:23:23,896 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:23:23,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:23:23,896 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:23:23,897 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:23:23,898 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:23:23,898 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 2187ad12904216f135de1d4e0a00e45b56b4da69 [2019-01-02 00:23:23,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:23:23,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:23:23,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:23:23,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:23:23,950 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:23:23,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-02 00:23:24,011 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65c798e0/7879297f45b5465180c33a2fda6f871c/FLAGc08138b54 [2019-01-02 00:23:24,435 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:23:24,436 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-02 00:23:24,443 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65c798e0/7879297f45b5465180c33a2fda6f871c/FLAGc08138b54 [2019-01-02 00:23:24,790 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65c798e0/7879297f45b5465180c33a2fda6f871c [2019-01-02 00:23:24,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:23:24,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:23:24,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:24,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:23:24,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:23:24,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22099427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:24, skipping insertion in model container [2019-01-02 00:23:24,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:24" (1/1) ... [2019-01-02 00:23:24,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:23:24,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:23:25,009 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:25,029 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:23:25,052 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:25,078 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:23:25,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25 WrapperNode [2019-01-02 00:23:25,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:25,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:25,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:23:25,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:23:25,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:25,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:23:25,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:23:25,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:23:25,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... [2019-01-02 00:23:25,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:23:25,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:23:25,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:23:25,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:23:25,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-02 00:23:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-02 00:23:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-02 00:23:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-02 00:23:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-02 00:23:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:23:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:23:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-02 00:23:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:23:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:23:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:23:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:23:25,800 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-02 00:23:25,838 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:23:25,838 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-02 00:23:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25 BoogieIcfgContainer [2019-01-02 00:23:25,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:23:25,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:23:25,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:23:25,843 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:23:25,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:23:24" (1/3) ... [2019-01-02 00:23:25,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a7d3ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:25, skipping insertion in model container [2019-01-02 00:23:25,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:25" (2/3) ... [2019-01-02 00:23:25,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a7d3ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:25, skipping insertion in model container [2019-01-02 00:23:25,846 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:25,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25" (3/3) ... [2019-01-02 00:23:25,848 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2019-01-02 00:23:25,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:23:25,907 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:23:25,907 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:23:25,907 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:23:25,907 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:23:25,908 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:23:25,908 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:23:25,908 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:23:25,908 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:23:25,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-02 00:23:25,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:25,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:25,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:25,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:25,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:25,958 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:23:25,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-02 00:23:25,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:25,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:25,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:25,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:25,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:25,970 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#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);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 10#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_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, 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(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 24#L41true 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, 10);< 14##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; 5#$Ultimate##0true #t~loopctr13 := 0; 25#L-1-1true [2019-01-02 00:23:25,971 INFO L796 eck$LassoCheckResult]: Loop: 25#L-1-1true assume #t~loopctr13 < size;call #t~mem14 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 1);call write~unchecked~int(#t~mem14, dest.base, dest.offset + #t~loopctr13, 1);call #t~mem15 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 4);call write~unchecked~int(#t~mem15, dest.base, dest.offset + #t~loopctr13, 4);#t~loopctr13 := 1 + #t~loopctr13; 25#L-1-1true [2019-01-02 00:23:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash 28780603, now seen corresponding path program 1 times [2019-01-02 00:23:25,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:25,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:26,150 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2019-01-02 00:23:26,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:26,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:26,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:26,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash 892198776, now seen corresponding path program 1 times [2019-01-02 00:23:26,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:26,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:26,779 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-02 00:23:27,057 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-02 00:23:27,676 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-01-02 00:23:27,852 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-02 00:23:27,863 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:27,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:27,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:27,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:27,865 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:27,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:27,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:27,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:27,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:23:27,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:27,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:27,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:29,294 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-02 00:23:29,489 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-02 00:23:29,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:30,098 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:30,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:30,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:30,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:30,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:30,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,253 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:23:30,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,259 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-02 00:23:30,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:30,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:30,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:30,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:30,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:30,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:30,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:30,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:30,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:30,491 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:23:30,494 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:23:30,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:30,500 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:23:30,503 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:30,503 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr13, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr13 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-02 00:23:30,893 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2019-01-02 00:23:30,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:30,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:30,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:30,993 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-01-02 00:23:30,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2019-01-02 00:23:31,068 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 38 states and 53 transitions. Complement of second has 6 states. [2019-01-02 00:23:31,080 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-01-02 00:23:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-02 00:23:31,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-02 00:23:31,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:31,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:23:31,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:31,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-01-02 00:23:31,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:31,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 9 states and 11 transitions. [2019-01-02 00:23:31,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-02 00:23:31,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:23:31,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-02 00:23:31,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:31,103 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-02 00:23:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-02 00:23:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-02 00:23:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-02 00:23:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-02 00:23:31,126 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:31,126 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:31,127 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:23:31,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-02 00:23:31,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:31,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:31,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:31,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:23:31,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:31,128 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#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);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 221#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_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, 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(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 222#L41 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, 10);< 227##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; 223#$Ultimate##0 #t~loopctr13 := 0; 224#L-1-1 assume !(#t~loopctr13 < size);#t~loopctr16 := 0; 226#L-1-3 [2019-01-02 00:23:31,129 INFO L796 eck$LassoCheckResult]: Loop: 226#L-1-3 assume #t~loopctr16 < size;#t~loopctr16 := 4 + #t~loopctr16; 226#L-1-3 [2019-01-02 00:23:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 892198778, now seen corresponding path program 1 times [2019-01-02 00:23:31,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:23:31,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:23:31,309 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:23:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2019-01-02 00:23:31,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:31,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:31,351 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:31,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:31,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:31,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:31,351 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:23:31,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:31,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:31,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:31,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:31,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:31,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:31,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:31,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:31,383 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:31,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:23:31,389 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-02 00:23:31,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:23:31,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:23:31,546 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:23:31,548 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:31,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:31,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:31,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:31,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:31,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:31,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:31,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:31,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:31,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:31,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:31,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:31,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:31,646 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:31,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:31,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:31,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:31,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:31,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:31,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:31,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:31,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:31,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:31,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:23:31,659 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:23:31,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:31,659 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:23:31,659 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:31,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr16, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr16 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-02 00:23:31,661 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:23:31,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:31,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:31,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:31,973 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-01-02 00:23:31,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-02 00:23:31,994 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-01-02 00:23:32,001 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-01-02 00:23:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-01-02 00:23:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:32,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-02 00:23:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:32,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-02 00:23:32,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:32,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-02 00:23:32,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:32,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-02 00:23:32,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:32,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:32,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:32,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:32,006 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:32,006 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:23:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:23:32,010 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-02 00:23:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:23:32,013 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:23:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:23:32,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:23:32,013 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:32,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:23:32,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:32,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:32,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:32,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:32,014 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:32,014 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:32,014 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:32,015 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:23:32,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:23:32,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:32,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:23:32,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:23:32 BoogieIcfgContainer [2019-01-02 00:23:32,021 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:23:32,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:23:32,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:23:32,021 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:23:32,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:25" (3/4) ... [2019-01-02 00:23:32,025 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:23:32,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:23:32,026 INFO L168 Benchmark]: Toolchain (without parser) took 7231.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,027 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:23:32,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,030 INFO L168 Benchmark]: Boogie Preprocessor took 105.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,030 INFO L168 Benchmark]: RCFGBuilder took 591.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,031 INFO L168 Benchmark]: BuchiAutomizer took 6180.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:32,032 INFO L168 Benchmark]: Witness Printer took 4.08 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-01-02 00:23:32,037 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.59 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 591.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6180.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 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~loopctr13-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr16-aux + unknown-size-unknown 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 6.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: inital76 mio100 ax100 hnf100 lsp99 ukn88 mio100 lsp75 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf118 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms 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...