./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-635dfa2 [2018-12-09 01:06:08,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:06:08,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:06:08,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:06:08,370 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:06:08,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:06:08,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:06:08,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:06:08,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:06:08,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:06:08,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:06:08,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:06:08,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:06:08,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:06:08,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:06:08,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:06:08,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:06:08,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:06:08,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:06:08,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:06:08,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:06:08,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:06:08,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:06:08,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:06:08,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:06:08,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:06:08,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:06:08,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:06:08,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:06:08,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:06:08,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:06:08,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:06:08,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:06:08,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:06:08,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:06:08,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:06:08,388 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 01:06:08,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:06:08,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:06:08,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:06:08,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:06:08,399 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:06:08,400 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:06:08,400 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:06:08,400 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:06:08,400 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:06:08,400 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:06:08,400 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:06:08,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:06:08,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:06:08,402 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:06:08,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:06:08,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:06:08,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:06:08,403 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:06:08,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:06:08,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:06:08,403 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:06:08,404 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:06:08,404 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_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-12-09 01:06:08,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:06:08,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:06:08,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:06:08,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:06:08,439 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:06:08,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-09 01:06:08,479 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/data/538d351e4/6e0108429f5f41c59ce3a1b4c274ee27/FLAG8a2872da1 [2018-12-09 01:06:08,803 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:06:08,804 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-09 01:06:08,810 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/data/538d351e4/6e0108429f5f41c59ce3a1b4c274ee27/FLAG8a2872da1 [2018-12-09 01:06:09,216 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/bin-2019/uautomizer/data/538d351e4/6e0108429f5f41c59ce3a1b4c274ee27 [2018-12-09 01:06:09,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:06:09,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:06:09,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:06:09,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:06:09,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:06:09,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09, skipping insertion in model container [2018-12-09 01:06:09,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:06:09,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:06:09,423 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:06:09,430 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:06:09,487 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:06:09,523 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:06:09,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09 WrapperNode [2018-12-09 01:06:09,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:06:09,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:06:09,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:06:09,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:06:09,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:06:09,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:06:09,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:06:09,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:06:09,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... [2018-12-09 01:06:09,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:06:09,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:06:09,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:06:09,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:06:09,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-09 01:06:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-09 01:06:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:06:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:06:09,717 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:06:09,744 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:06:09,744 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 01:06:09,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:06:09 BoogieIcfgContainer [2018-12-09 01:06:09,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:06:09,745 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:06:09,745 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:06:09,749 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:06:09,749 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:06:09,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:06:09" (1/3) ... [2018-12-09 01:06:09,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61d06e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:06:09, skipping insertion in model container [2018-12-09 01:06:09,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:06:09,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:06:09" (2/3) ... [2018-12-09 01:06:09,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61d06e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:06:09, skipping insertion in model container [2018-12-09 01:06:09,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:06:09,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:06:09" (3/3) ... [2018-12-09 01:06:09,753 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-12-09 01:06:09,790 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:06:09,791 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:06:09,791 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:06:09,791 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:06:09,791 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:06:09,791 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:06:09,791 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:06:09,792 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:06:09,792 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:06:09,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 01:06:09,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-09 01:06:09,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:09,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:09,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:06:09,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:09,833 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:06:09,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-12-09 01:06:09,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-12-09 01:06:09,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:09,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:09,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:06:09,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:09,839 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 9#L-1true 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$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);< 13##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-12-09 01:06:09,840 INFO L796 eck$LassoCheckResult]: Loop: 7#L-1-1true assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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-12-09 01:06:09,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2018-12-09 01:06:09,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:09,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:09,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:09,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:09,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2018-12-09 01:06:09,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:09,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:09,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2018-12-09 01:06:09,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:09,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:10,384 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2018-12-09 01:06:10,462 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:06:10,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:06:10,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:06:10,463 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:06:10,463 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:06:10,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:06:10,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:06:10,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:06:10,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-09 01:06:10,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:06:10,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:06:10,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:10,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:11,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:06:11,026 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:06:11,028 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-12-09 01:06:11,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:06:11,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:06:11,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:06:11,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,034 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-12-09 01:06:11,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:06:11,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:06:11,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:06:11,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,036 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-12-09 01:06:11,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:06:11,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:06:11,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:06:11,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,038 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-12-09 01:06:11,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,043 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-12-09 01:06:11,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,044 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:06:11,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,045 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:06:11,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,049 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-12-09 01:06:11,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,057 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-12-09 01:06:11,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,057 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:06:11,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,060 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:06:11,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,069 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-12-09 01:06:11,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,080 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-12-09 01:06:11,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,086 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-12-09 01:06:11,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,092 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-12-09 01:06:11,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,098 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-12-09 01:06:11,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,105 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-12-09 01:06:11,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:06:11,110 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-12-09 01:06:11,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:06:11,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:06:11,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:06:11,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:06:11,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:06:11,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:06:11,130 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:06:11,146 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 01:06:11,146 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 01:06:11,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:06:11,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:06:11,148 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:06:11,149 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-12-09 01:06:11,183 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-12-09 01:06:11,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-12-09 01:06:11,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,232 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-12-09 01:06:11,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2018-12-09 01:06:11,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 2 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2018-12-09 01:06:11,275 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-12-09 01:06:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-09 01:06:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-09 01:06:11,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-12-09 01:06:11,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:06:11,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-12-09 01:06:11,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:06:11,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 01:06:11,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:06:11,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-09 01:06:11,281 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2018-12-09 01:06:11,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 01:06:11,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 01:06:11,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-09 01:06:11,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:06:11,285 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-09 01:06:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-09 01:06:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 01:06:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 01:06:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-09 01:06:11,302 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-09 01:06:11,302 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-09 01:06:11,302 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:06:11,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-09 01:06:11,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:11,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:11,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 01:06:11,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:11,304 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 133#L-1 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 134#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);< 142##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; 149#$Ultimate##0 #t~loopctr5 := 0; 148#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 147#L-1-3 [2018-12-09 01:06:11,304 INFO L796 eck$LassoCheckResult]: Loop: 147#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 147#L-1-3 [2018-12-09 01:06:11,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,304 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2018-12-09 01:06:11,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:06:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:06:11,364 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:06:11,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2018-12-09 01:06:11,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:06:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:06:11,394 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 01:06:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:11,412 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-09 01:06:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:06:11,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-09 01:06:11,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-12-09 01:06:11,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 01:06:11,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 01:06:11,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-09 01:06:11,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:06:11,414 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 01:06:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-09 01:06:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 01:06:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 01:06:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-09 01:06:11,416 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 01:06:11,416 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 01:06:11,416 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:06:11,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-09 01:06:11,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:11,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:11,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:11,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:11,417 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 175#L-1 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 176#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);< 185##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; 192#$Ultimate##0 #t~loopctr5 := 0; 191#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 189#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 190#L-1-3 [2018-12-09 01:06:11,417 INFO L796 eck$LassoCheckResult]: Loop: 190#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 190#L-1-3 [2018-12-09 01:06:11,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2018-12-09 01:06:11,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:06:11,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-12-09 01:06:11,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:06:11,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-09 01:06:11,502 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:06:11,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2018-12-09 01:06:11,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:06:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:06:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:06:11,539 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-12-09 01:06:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:11,568 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-09 01:06:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:06:11,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-09 01:06:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 01:06:11,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-09 01:06:11,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-09 01:06:11,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-09 01:06:11,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:06:11,570 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 01:06:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-09 01:06:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 01:06:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 01:06:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 01:06:11,571 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 01:06:11,571 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 01:06:11,571 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:06:11,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 01:06:11,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:11,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:11,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:11,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:11,573 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 242#L-1 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 243#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);< 251##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; 246#$Ultimate##0 #t~loopctr5 := 0; 247#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 255#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 256#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 257#L-1-3 [2018-12-09 01:06:11,573 INFO L796 eck$LassoCheckResult]: Loop: 257#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 257#L-1-3 [2018-12-09 01:06:11,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2018-12-09 01:06:11,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:06:11,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-12-09 01:06:11,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:06:11,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:06:11,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:06:11,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:06:11,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-09 01:06:11,660 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:06:11,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2018-12-09 01:06:11,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:06:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:06:11,692 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-12-09 01:06:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:11,721 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-09 01:06:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:06:11,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-12-09 01:06:11,722 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-12-09 01:06:11,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 01:06:11,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 01:06:11,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-12-09 01:06:11,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:06:11,723 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 01:06:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-12-09 01:06:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 01:06:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 01:06:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-09 01:06:11,725 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 01:06:11,725 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 01:06:11,725 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:06:11,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-12-09 01:06:11,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:11,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:11,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:11,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:11,727 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 318#L-1 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 319#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);< 327##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; 339#$Ultimate##0 #t~loopctr5 := 0; 337#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 332#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 333#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 335#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 334#L-1-3 [2018-12-09 01:06:11,727 INFO L796 eck$LassoCheckResult]: Loop: 334#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 334#L-1-3 [2018-12-09 01:06:11,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2018-12-09 01:06:11,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:06:11,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdd6f2ef-646d-4791-96fa-70e6f8f457c8/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-12-09 01:06:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:06:11,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 01:06:11,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:06:11,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:06:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:06:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-12-09 01:06:11,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 01:06:11,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2018-12-09 01:06:11,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:06:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:06:11,871 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-12-09 01:06:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:06:11,896 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-09 01:06:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:06:11,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-12-09 01:06:11,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-12-09 01:06:11,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 01:06:11,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 01:06:11,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-09 01:06:11,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:06:11,897 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 01:06:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-09 01:06:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 01:06:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 01:06:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-09 01:06:11,898 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 01:06:11,898 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 01:06:11,899 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:06:11,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-12-09 01:06:11,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-12-09 01:06:11,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:06:11,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:06:11,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2018-12-09 01:06:11,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 01:06:11,899 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 403#L-1 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;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 foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 404#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);< 413##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; 424#$Ultimate##0 #t~loopctr5 := 0; 422#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 417#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 418#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 421#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~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; 420#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 419#L-1-3 [2018-12-09 01:06:11,899 INFO L796 eck$LassoCheckResult]: Loop: 419#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 419#L-1-3 [2018-12-09 01:06:11,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2018-12-09 01:06:11,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2018-12-09 01:06:11,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:06:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2018-12-09 01:06:11,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:06:11,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:06:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:06:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:06:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:06:12,618 WARN L180 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2018-12-09 01:06:12,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:12,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:12,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:12,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:12,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:12,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,134 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,143 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,257 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,354 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,358 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-09 01:06:13,407 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:367, output treesize:287 [2018-12-09 01:06:13,658 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-09 01:06:13,832 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-09 01:06:14,295 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-12-09 01:06:14,466 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-09 01:06:14,468 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:06:14,468 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:06:14,468 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:06:14,468 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:06:14,468 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:06:14,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:06:14,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:06:14,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:06:14,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-09 01:06:14,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:06:14,469 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:06:14,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:14,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:14,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:14,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:06:14,811 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-12-09 01:06:14,812 INFO L168 Benchmark]: Toolchain (without parser) took 5593.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -307.7 MB). Peak memory consumption was 366.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:06:14,813 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:06:14,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:06:14,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.98 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-12-09 01:06:14,814 INFO L168 Benchmark]: Boogie Preprocessor took 18.54 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:06:14,814 INFO L168 Benchmark]: RCFGBuilder took 171.43 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:06:14,815 INFO L168 Benchmark]: BuchiAutomizer took 5066.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.3 MB). Peak memory consumption was 362.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:06:14,817 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.54 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.43 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5066.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.3 MB). Peak memory consumption was 362.8 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...