./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cebb5f481285aa400c004636e713993debded4b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.24-91b1670 [2018-11-29 00:11:50,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:50,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:50,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:50,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:50,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:50,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:50,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:50,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:50,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:50,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:50,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:50,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:50,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:50,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:50,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:50,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:50,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:50,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:50,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:50,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:50,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:50,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:50,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:50,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:50,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:50,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:50,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:50,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:50,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:50,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:50,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:50,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:50,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:50,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:50,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:50,485 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:50,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:50,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:50,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:50,524 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:50,524 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:50,524 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:50,524 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:50,524 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:50,525 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:50,526 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:50,526 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:50,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:50,527 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:50,527 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:50,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:50,527 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:50,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:50,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:50,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:50,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:50,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:50,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:50,529 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:50,529 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:50,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:50,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:50,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:50,530 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:50,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:50,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:50,532 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:50,533 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:50,533 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cebb5f481285aa400c004636e713993debded4b [2018-11-29 00:11:50,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:50,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:50,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:50,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:50,630 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:50,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-29 00:11:50,696 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95d64c21/8f3d7c82e7df44fdadaa106003ff3341/FLAG4b1d460ab [2018-11-29 00:11:51,269 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:51,270 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-29 00:11:51,289 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95d64c21/8f3d7c82e7df44fdadaa106003ff3341/FLAG4b1d460ab [2018-11-29 00:11:51,489 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f95d64c21/8f3d7c82e7df44fdadaa106003ff3341 [2018-11-29 00:11:51,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:51,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:51,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:51,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:51,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:51,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:51" (1/1) ... [2018-11-29 00:11:51,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75abdb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:51, skipping insertion in model container [2018-11-29 00:11:51,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:51" (1/1) ... [2018-11-29 00:11:51,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:51,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:51,931 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:51,946 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:51,988 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:52,086 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:52,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52 WrapperNode [2018-11-29 00:11:52,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:52,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:52,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:52,088 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:52,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:52,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:52,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:52,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:52,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... [2018-11-29 00:11:52,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:52,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:52,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:52,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:52,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-29 00:11:52,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-11-29 00:11:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-11-29 00:11:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-29 00:11:52,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-29 00:11:52,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:11:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-29 00:11:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-29 00:11:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-29 00:11:52,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:52,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:52,638 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-29 00:11:52,723 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:52,723 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-29 00:11:52,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:52 BoogieIcfgContainer [2018-11-29 00:11:52,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:52,725 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:52,725 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:52,729 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:52,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:52,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:51" (1/3) ... [2018-11-29 00:11:52,730 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d64c738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:52, skipping insertion in model container [2018-11-29 00:11:52,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:52,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:52" (2/3) ... [2018-11-29 00:11:52,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d64c738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:52, skipping insertion in model container [2018-11-29 00:11:52,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:52,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:52" (3/3) ... [2018-11-29 00:11:52,733 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-29 00:11:52,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:52,792 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:52,792 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:52,792 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:52,793 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:52,793 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:52,793 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:52,793 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:52,793 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:52,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-29 00:11:52,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:11:52,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:52,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:52,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:52,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:52,843 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:52,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-29 00:11:52,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:11:52,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:52,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:52,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:52,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:52,855 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-11-29 00:11:52,855 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-11-29 00:11:52,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2018-11-29 00:11:52,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:52,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:52,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:52,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2018-11-29 00:11:53,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2018-11-29 00:11:53,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:53,349 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-29 00:11:53,800 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-29 00:11:54,071 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-29 00:11:54,273 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:11:54,809 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2018-11-29 00:11:55,031 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-29 00:11:55,043 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:55,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:55,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:55,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:55,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:55,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:55,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:55,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:55,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:11:55,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:55,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:55,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:55,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:55,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:55,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:55,939 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-11-29 00:11:56,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:56,808 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:56,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:56,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:56,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:56,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:56,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:56,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:56,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:56,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:56,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:56,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:56,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,851 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:56,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:56,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,875 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:56,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,879 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:56,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:56,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:56,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:56,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:56,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:56,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:56,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:56,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:56,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:57,023 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:57,082 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:57,082 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:11:57,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:57,086 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:57,087 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:57,088 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr5, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr5 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-29 00:11:57,226 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-29 00:11:57,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-29 00:11:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:57,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-29 00:11:57,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2018-11-29 00:11:57,454 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-11-29 00:11:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:11:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-29 00:11:57,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-29 00:11:57,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:57,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-29 00:11:57,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:57,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:11:57,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:57,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-29 00:11:57,468 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:57,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2018-11-29 00:11:57,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:11:57,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:11:57,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-29 00:11:57,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:57,476 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-29 00:11:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-29 00:11:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-29 00:11:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:11:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-29 00:11:57,504 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-29 00:11:57,504 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-29 00:11:57,504 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:57,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-29 00:11:57,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:57,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:57,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:57,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:57,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:57,507 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-11-29 00:11:57,507 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-11-29 00:11:57,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2018-11-29 00:11:57,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:57,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:57,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:11:57,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:57,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2018-11-29 00:11:57,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:11:57,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:11:57,701 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:57,776 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-29 00:11:57,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:11:57,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-29 00:11:57,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:57,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-29 00:11:57,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:11:57,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:11:57,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-29 00:11:57,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:57,780 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-29 00:11:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-29 00:11:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-29 00:11:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-29 00:11:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-29 00:11:57,783 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-29 00:11:57,783 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-29 00:11:57,783 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:57,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-29 00:11:57,784 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:57,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:57,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:57,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:57,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:57,785 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-11-29 00:11:57,786 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-11-29 00:11:57,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2018-11-29 00:11:57,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:57,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:57,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:57,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:11:57,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:57,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-29 00:11:58,021 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:58,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2018-11-29 00:11:58,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:58,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:11:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:11:58,156 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-29 00:11:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:58,268 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-29 00:11:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:11:58,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-29 00:11:58,271 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:58,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-29 00:11:58,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-29 00:11:58,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:11:58,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-29 00:11:58,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:58,273 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:11:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-29 00:11:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-29 00:11:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:11:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-29 00:11:58,276 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:11:58,276 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-29 00:11:58,276 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:58,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-29 00:11:58,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:58,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:58,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:58,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:58,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:58,279 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-11-29 00:11:58,279 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-11-29 00:11:58,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2018-11-29 00:11:58,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:58,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:58,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:11:58,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:11:58,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:11:58,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:11:58,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:58,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-29 00:11:58,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:58,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2018-11-29 00:11:58,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:58,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:11:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:11:58,850 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-29 00:11:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:58,903 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-29 00:11:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:11:58,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-29 00:11:58,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:58,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-11-29 00:11:58,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:11:58,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:11:58,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-29 00:11:58,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:58,908 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-29 00:11:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-29 00:11:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-29 00:11:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:11:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-29 00:11:58,911 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-29 00:11:58,911 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-29 00:11:58,911 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:58,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-29 00:11:58,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:58,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:58,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:58,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:58,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:58,913 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-11-29 00:11:58,913 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-11-29 00:11:58,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2018-11-29 00:11:58,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:58,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:58,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:58,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:59,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:59,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:11:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:11:59,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-29 00:11:59,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:11:59,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:59,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:59,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-11-29 00:11:59,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:59,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2018-11-29 00:11:59,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-29 00:11:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-29 00:11:59,259 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-29 00:11:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:59,381 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-29 00:11:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:11:59,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-29 00:11:59,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:59,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-11-29 00:11:59,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:11:59,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:11:59,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-29 00:11:59,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:59,387 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-29 00:11:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-29 00:11:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-29 00:11:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-29 00:11:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-29 00:11:59,391 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-29 00:11:59,391 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-29 00:11:59,391 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:59,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-29 00:11:59,392 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2018-11-29 00:11:59,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:59,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:59,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:59,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:11:59,393 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-11-29 00:11:59,393 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-11-29 00:11:59,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2018-11-29 00:11:59,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,457 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2018-11-29 00:11:59,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:59,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2018-11-29 00:11:59,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:59,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:00,575 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2018-11-29 00:12:00,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:00,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:00,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:00,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,155 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,174 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,351 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,518 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,524 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,671 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,678 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-29 00:12:01,752 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:367, output treesize:287 [2018-11-29 00:12:02,054 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-29 00:12:02,166 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-29 00:12:02,272 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-29 00:12:02,863 WARN L180 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-11-29 00:12:03,107 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-29 00:12:03,110 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:03,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:03,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:03,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:03,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:03,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:03,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:03,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:03,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-29 00:12:03,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:03,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:03,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:03,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:03,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:03,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:03,979 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-29 00:12:03,982 INFO L168 Benchmark]: Toolchain (without parser) took 12488.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -287.2 MB). Peak memory consumption was 357.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:03,983 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:03,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 920.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:03,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:03,986 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:03,986 INFO L168 Benchmark]: RCFGBuilder took 480.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:03,987 INFO L168 Benchmark]: BuchiAutomizer took 11256.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.8 MB). Peak memory consumption was 374.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:03,996 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 920.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 480.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11256.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.8 MB). Peak memory consumption was 374.3 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...