./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cebb5f481285aa400c004636e713993debded4b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:43:02,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:43:02,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:43:02,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:43:02,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:43:02,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:43:02,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:43:02,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:43:02,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:43:02,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:43:02,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:43:02,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:43:02,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:43:02,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:43:02,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:43:02,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:43:02,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:43:02,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:43:02,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:43:02,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:43:02,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:43:02,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:43:03,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:43:03,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:43:03,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:43:03,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:43:03,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:43:03,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:43:03,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:43:03,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:43:03,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:43:03,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:43:03,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:43:03,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:43:03,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:43:03,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:43:03,005 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:43:03,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:43:03,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:43:03,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:43:03,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:43:03,014 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:43:03,014 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:43:03,014 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:43:03,014 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:43:03,014 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:43:03,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:43:03,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:43:03,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:43:03,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:43:03,017 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:43:03,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:43:03,017 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:43:03,017 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:43:03,017 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:43:03,017 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cebb5f481285aa400c004636e713993debded4b [2018-11-18 13:43:03,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:43:03,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:43:03,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:43:03,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:43:03,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:43:03,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-18 13:43:03,095 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/data/e6266c222/1bc3b04830234dddab30515adb472877/FLAGa7b8c8aad [2018-11-18 13:43:03,456 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:43:03,457 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-18 13:43:03,467 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/data/e6266c222/1bc3b04830234dddab30515adb472877/FLAGa7b8c8aad [2018-11-18 13:43:03,477 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/data/e6266c222/1bc3b04830234dddab30515adb472877 [2018-11-18 13:43:03,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:43:03,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:43:03,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:43:03,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:43:03,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:43:03,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3356d25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03, skipping insertion in model container [2018-11-18 13:43:03,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:43:03,519 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:43:03,714 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:43:03,724 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:43:03,750 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:43:03,833 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:43:03,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03 WrapperNode [2018-11-18 13:43:03,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:43:03,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:43:03,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:43:03,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:43:03,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:43:03,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:43:03,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:43:03,862 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:43:03,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... [2018-11-18 13:43:03,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:43:03,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:43:03,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:43:03,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:43:03,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 13:43:03,916 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:43:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:43:03,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:43:04,055 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:43:04,068 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:43:04,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:43:04 BoogieIcfgContainer [2018-11-18 13:43:04,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:43:04,069 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:43:04,069 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:43:04,071 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:43:04,071 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:04,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:43:03" (1/3) ... [2018-11-18 13:43:04,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b3810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:43:04, skipping insertion in model container [2018-11-18 13:43:04,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:04,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:43:03" (2/3) ... [2018-11-18 13:43:04,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b3810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:43:04, skipping insertion in model container [2018-11-18 13:43:04,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:43:04,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:43:04" (3/3) ... [2018-11-18 13:43:04,074 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-18 13:43:04,116 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:43:04,116 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:43:04,116 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:43:04,116 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:43:04,117 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:43:04,117 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:43:04,117 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:43:04,117 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:43:04,117 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:43:04,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 13:43:04,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:04,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:04,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:04,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:04,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:04,148 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:43:04,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-18 13:43:04,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:04,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:04,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:04,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 13:43:04,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:04,154 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 11#L744true call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 12##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; 4#$Ultimate##0true #t~loopctr5 := 0; 7#L-1-1true [2018-11-18 13:43:04,155 INFO L796 eck$LassoCheckResult]: Loop: 7#L-1-1true assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 7#L-1-1true [2018-11-18 13:43:04,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 28709299, now seen corresponding path program 1 times [2018-11-18 13:43:04,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:04,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2018-11-18 13:43:04,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:04,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:04,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:04,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 889988286, now seen corresponding path program 1 times [2018-11-18 13:43:04,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:04,558 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-18 13:43:04,790 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-18 13:43:04,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:43:04,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:43:04,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:43:04,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:43:04,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:43:04,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:43:04,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:43:04,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:43:04,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 13:43:04,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:43:04,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:43:04,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:04,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:05,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:05,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:05,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:43:05,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:43:05,247 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 [2018-11-18 13:43:05,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,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 [2018-11-18 13:43:05,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,254 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 [2018-11-18 13:43:05,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,257 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 [2018-11-18 13:43:05,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,263 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 [2018-11-18 13:43:05,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,266 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 [2018-11-18 13:43:05,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,268 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 [2018-11-18 13:43:05,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,271 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 [2018-11-18 13:43:05,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,273 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 [2018-11-18 13:43:05,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,276 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 [2018-11-18 13:43:05,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,278 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 [2018-11-18 13:43:05,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,284 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 [2018-11-18 13:43:05,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,286 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 [2018-11-18 13:43:05,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,292 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 [2018-11-18 13:43:05,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,294 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 [2018-11-18 13:43:05,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,306 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 [2018-11-18 13:43:05,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,308 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 [2018-11-18 13:43:05,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,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 [2018-11-18 13:43:05,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:43:05,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:43:05,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:43:05,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,312 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 [2018-11-18 13:43:05,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,312 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:43:05,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:43:05,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,319 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 [2018-11-18 13:43:05,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,320 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:43:05,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,321 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:43:05,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,328 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 [2018-11-18 13:43:05,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,333 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 [2018-11-18 13:43:05,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,339 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 [2018-11-18 13:43:05,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,346 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 [2018-11-18 13:43:05,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:43:05,353 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 [2018-11-18 13:43:05,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:43:05,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:43:05,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:43:05,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:43:05,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:43:05,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:43:05,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:43:05,407 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:43:05,407 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:43:05,409 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:43:05,410 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:43:05,410 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:43:05,411 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr5, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr5 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-18 13:43:05,433 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 13:43:05,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable size [2018-11-18 13:43:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:05,484 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 [2018-11-18 13:43:05,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 2 states. [2018-11-18 13:43:05,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 2 states. Result 23 states and 26 transitions. Complement of second has 6 states. [2018-11-18 13:43:05,514 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 [2018-11-18 13:43:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 13:43:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-18 13:43:05,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-18 13:43:05,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:05,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-18 13:43:05,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:05,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-18 13:43:05,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:43:05,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-18 13:43:05,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 17 transitions. [2018-11-18 13:43:05,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 13:43:05,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 13:43:05,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-18 13:43:05,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:05,525 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 13:43:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-18 13:43:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 13:43:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 13:43:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-18 13:43:05,541 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 13:43:05,541 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-18 13:43:05,541 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:43:05,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-18 13:43:05,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:05,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:05,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:05,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:05,543 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 105#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 113##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; 118#$Ultimate##0 #t~loopctr5 := 0; 117#L-1-1 assume !(#t~loopctr5 < size); 114##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 111##Ultimate.C_memcpyEXIT >#22#return; 112#L744-1 havoc foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset;call ULTIMATE.dealloc(foo_~#p~0.base, foo_~#p~0.offset);havoc foo_~#p~0.base, foo_~#p~0.offset; 115#L741 assume { :end_inline_foo } true;call main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc(4); 106#L750 call main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 107##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; 108#$Ultimate##0 #t~loopctr5 := 0; 109#L-1-1 [2018-11-18 13:43:05,543 INFO L796 eck$LassoCheckResult]: Loop: 109#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 109#L-1-1 [2018-11-18 13:43:05,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash 543666708, now seen corresponding path program 1 times [2018-11-18 13:43:05,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:05,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:43:05,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:43:05,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:43:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 2 times [2018-11-18 13:43:05,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:43:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:43:05,635 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 13:43:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:43:05,648 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 13:43:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:43:05,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2018-11-18 13:43:05,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 17 transitions. [2018-11-18 13:43:05,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 13:43:05,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 13:43:05,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-18 13:43:05,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:05,650 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 13:43:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-18 13:43:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-18 13:43:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 13:43:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 13:43:05,652 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 13:43:05,652 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 13:43:05,652 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:43:05,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-18 13:43:05,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:05,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:05,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:05,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:05,653 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 147#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 155##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 156#$Ultimate##0 #t~loopctr5 := 0; 160#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 159#L-1-1 assume !(#t~loopctr5 < size); 157##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 152##Ultimate.C_memcpyEXIT >#22#return; 153#L744-1 havoc foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset;call ULTIMATE.dealloc(foo_~#p~0.base, foo_~#p~0.offset);havoc foo_~#p~0.base, foo_~#p~0.offset; 158#L741 assume { :end_inline_foo } true;call main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc(4); 148#L750 call main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 149##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; 150#$Ultimate##0 #t~loopctr5 := 0; 151#L-1-1 [2018-11-18 13:43:05,653 INFO L796 eck$LassoCheckResult]: Loop: 151#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 151#L-1-1 [2018-11-18 13:43:05,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash 283871775, now seen corresponding path program 1 times [2018-11-18 13:43:05,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:05,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:43:05,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:43:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:05,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:43:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 13:43:05,789 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:43:05,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 3 times [2018-11-18 13:43:05,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:05,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:43:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:43:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:43:05,824 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-18 13:43:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:43:05,856 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-18 13:43:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:43:05,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2018-11-18 13:43:05,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 19 transitions. [2018-11-18 13:43:05,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 13:43:05,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 13:43:05,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-18 13:43:05,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:05,858 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 13:43:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-18 13:43:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-18 13:43:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 13:43:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 13:43:05,860 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 13:43:05,860 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 13:43:05,860 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:43:05,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2018-11-18 13:43:05,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:05,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:05,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:05,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:05,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:05,861 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 236#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 244##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; 250#$Ultimate##0 #t~loopctr5 := 0; 249#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 247#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 248#L-1-1 assume !(#t~loopctr5 < size); 245##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 239##Ultimate.C_memcpyEXIT >#22#return; 240#L744-1 havoc foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset;call ULTIMATE.dealloc(foo_~#p~0.base, foo_~#p~0.offset);havoc foo_~#p~0.base, foo_~#p~0.offset; 246#L741 assume { :end_inline_foo } true;call main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc(4); 237#L750 call main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 238##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; 241#$Ultimate##0 #t~loopctr5 := 0; 242#L-1-1 [2018-11-18 13:43:05,861 INFO L796 eck$LassoCheckResult]: Loop: 242#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 242#L-1-1 [2018-11-18 13:43:05,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 820163444, now seen corresponding path program 2 times [2018-11-18 13:43:05,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:05,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:05,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:43:05,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:43:05,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:43:05,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:43:05,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:43:05,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:06,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:43:06,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 13:43:06,050 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:43:06,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 4 times [2018-11-18 13:43:06,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:43:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:43:06,081 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-18 13:43:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:43:06,100 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-18 13:43:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:43:06,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2018-11-18 13:43:06,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:06,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 21 transitions. [2018-11-18 13:43:06,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 13:43:06,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 13:43:06,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-18 13:43:06,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:06,102 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-18 13:43:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-18 13:43:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-18 13:43:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:43:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-18 13:43:06,104 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 13:43:06,104 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 13:43:06,104 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:43:06,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-18 13:43:06,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:06,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:06,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:06,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:06,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:06,105 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 331#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 339##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; 340#$Ultimate##0 #t~loopctr5 := 0; 346#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 343#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 344#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 345#L-1-1 assume !(#t~loopctr5 < size); 342##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 334##Ultimate.C_memcpyEXIT >#22#return; 335#L744-1 havoc foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset;call ULTIMATE.dealloc(foo_~#p~0.base, foo_~#p~0.offset);havoc foo_~#p~0.base, foo_~#p~0.offset; 341#L741 assume { :end_inline_foo } true;call main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc(4); 332#L750 call main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 333##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; 336#$Ultimate##0 #t~loopctr5 := 0; 337#L-1-1 [2018-11-18 13:43:06,105 INFO L796 eck$LassoCheckResult]: Loop: 337#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 337#L-1-1 [2018-11-18 13:43:06,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash 265335999, now seen corresponding path program 3 times [2018-11-18 13:43:06,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:43:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:06,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:43:06,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e1cb00-a4d6-4137-b83f-d9a530f16e3a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:43:06,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:43:06,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 13:43:06,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:43:06,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:43:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:43:06,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:43:06,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 13:43:06,259 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:43:06,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 5 times [2018-11-18 13:43:06,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:43:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:43:06,284 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-18 13:43:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:43:06,311 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 13:43:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:43:06,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-18 13:43:06,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:06,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 23 transitions. [2018-11-18 13:43:06,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 13:43:06,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 13:43:06,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2018-11-18 13:43:06,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:43:06,313 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-18 13:43:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2018-11-18 13:43:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-18 13:43:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 13:43:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 13:43:06,314 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 13:43:06,314 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 13:43:06,314 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:43:06,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-18 13:43:06,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-18 13:43:06,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:43:06,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:43:06,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:43:06,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-18 13:43:06,316 INFO L794 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); 435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, foo_~#p~0.base, foo_~#p~0.offset, 4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 436#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 444##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; 445#$Ultimate##0 #t~loopctr5 := 0; 452#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 448#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 449#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 451#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 450#L-1-1 assume !(#t~loopctr5 < size); 446##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 439##Ultimate.C_memcpyEXIT >#22#return; 440#L744-1 havoc foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset;call ULTIMATE.dealloc(foo_~#p~0.base, foo_~#p~0.offset);havoc foo_~#p~0.base, foo_~#p~0.offset; 447#L741 assume { :end_inline_foo } true;call main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc(4); 437#L750 call main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 438##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; 441#$Ultimate##0 #t~loopctr5 := 0; 442#L-1-1 [2018-11-18 13:43:06,316 INFO L796 eck$LassoCheckResult]: Loop: 442#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 442#L-1-1 [2018-11-18 13:43:06,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 245554388, now seen corresponding path program 4 times [2018-11-18 13:43:06,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 6 times [2018-11-18 13:43:06,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:43:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -977748547, now seen corresponding path program 5 times [2018-11-18 13:43:06,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:43:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:43:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:43:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:43:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:43:06,644 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2018-11-18 13:43:06,906 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-11-18 13:43:07,510 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 149 [2018-11-18 13:43:07,644 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-18 13:43:07,902 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2018-11-18 13:43:08,023 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-18 13:43:08,025 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:43:08,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:43:08,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:43:08,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:43:08,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:43:08,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:43:08,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:43:08,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:43:08,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 13:43:08,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:43:08,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:43:08,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:43:08,081 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 13:43:08,083 INFO L168 Benchmark]: Toolchain (without parser) took 4603.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -70.0 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:43:08,084 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:43:08,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:43:08,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:43:08,085 INFO L168 Benchmark]: Boogie Preprocessor took 17.34 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. [2018-11-18 13:43:08,085 INFO L168 Benchmark]: RCFGBuilder took 188.96 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:43:08,086 INFO L168 Benchmark]: BuchiAutomizer took 4013.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 231.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:43:08,088 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.96 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4013.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 231.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...