./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_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/list-ext-properties/test-0232_1_false-valid-memtrack_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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-28 23:40:45,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:40:45,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:40:45,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:40:45,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:40:45,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:40:45,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:40:45,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:40:45,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:40:45,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:40:45,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:40:45,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:40:45,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:40:45,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:40:45,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:40:45,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:40:45,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:40:45,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:40:45,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:40:45,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:40:45,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:40:45,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:40:45,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:40:45,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:40:45,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:40:45,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:40:45,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:40:45,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:40:45,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:40:45,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:40:45,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:40:45,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:40:45,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:40:45,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:40:45,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:40:45,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:40:45,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:40:45,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:40:45,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:40:45,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:40:45,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:40:45,804 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:40:45,804 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:40:45,804 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:40:45,805 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:40:45,805 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:40:45,805 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:40:45,805 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:40:45,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:40:45,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:40:45,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:40:45,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:40:45,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:40:45,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:40:45,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:40:45,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:40:45,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:40:45,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:40:45,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:40:45,808 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:40:45,809 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:40:45,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:40:45,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:40:45,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:40:45,810 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:40:45,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:40:45,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:40:45,811 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:40:45,812 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:40:45,812 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-28 23:40:45,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:40:45,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:40:45,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:40:45,877 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:40:45,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:40:45,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 23:40:45,951 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba91aaf14/e7fa0d87bf89493f8c28c4ec41387881/FLAG3979bb35c [2018-11-28 23:40:46,431 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:40:46,433 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 23:40:46,451 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba91aaf14/e7fa0d87bf89493f8c28c4ec41387881/FLAG3979bb35c [2018-11-28 23:40:46,738 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba91aaf14/e7fa0d87bf89493f8c28c4ec41387881 [2018-11-28 23:40:46,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:40:46,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:40:46,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:40:46,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:40:46,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:40:46,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:46" (1/1) ... [2018-11-28 23:40:46,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acf48ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:46, skipping insertion in model container [2018-11-28 23:40:46,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:46" (1/1) ... [2018-11-28 23:40:46,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:40:46,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:40:47,218 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:40:47,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:40:47,319 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:40:47,463 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:40:47,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47 WrapperNode [2018-11-28 23:40:47,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:40:47,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:40:47,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:40:47,465 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:40:47,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:40:47,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:40:47,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:40:47,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:40:47,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (1/1) ... [2018-11-28 23:40:47,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:40:47,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:40:47,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:40:47,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:40:47,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (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-28 23:40:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:40:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 23:40:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 23:40:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:40:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 23:40:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:40:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:40:48,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:40:48,093 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:40:48,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:48 BoogieIcfgContainer [2018-11-28 23:40:48,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:40:48,095 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:40:48,095 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:40:48,099 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:40:48,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:48,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:40:46" (1/3) ... [2018-11-28 23:40:48,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b1479e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:48, skipping insertion in model container [2018-11-28 23:40:48,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:48,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:47" (2/3) ... [2018-11-28 23:40:48,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b1479e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:48, skipping insertion in model container [2018-11-28 23:40:48,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:48,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:48" (3/3) ... [2018-11-28 23:40:48,104 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 23:40:48,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:40:48,165 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:40:48,166 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:40:48,166 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:40:48,166 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:40:48,166 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:40:48,166 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:40:48,166 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:40:48,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:40:48,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:40:48,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:40:48,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:48,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:48,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:40:48,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:40:48,214 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:40:48,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:40:48,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:40:48,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:48,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:48,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:40:48,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:40:48,226 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 13#L639-3true [2018-11-28 23:40:48,227 INFO L796 eck$LassoCheckResult]: Loop: 13#L639-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 5#L630true assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 9#L630-2true call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 15#L625true main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 10#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 13#L639-3true [2018-11-28 23:40:48,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:40:48,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:48,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:48,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-11-28 23:40:48,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:48,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:48,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-11-28 23:40:48,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:48,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:48,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:48,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:48,692 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-28 23:40:48,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:40:48,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:40:49,930 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-11-28 23:40:50,776 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 23:40:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:40:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:40:50,798 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2018-11-28 23:40:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:40:50,990 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-28 23:40:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:40:50,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-28 23:40:50,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:40:51,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2018-11-28 23:40:51,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:40:51,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:40:51,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:40:51,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:40:51,005 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:40:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:40:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-28 23:40:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:40:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 23:40:51,040 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:40:51,040 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:40:51,040 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:40:51,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 23:40:51,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:40:51,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:51,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:51,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:40:51,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:40:51,043 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 52#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 53#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 60#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 48#L630-2 [2018-11-28 23:40:51,043 INFO L796 eck$LassoCheckResult]: Loop: 48#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 49#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 54#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 56#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 59#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 48#L630-2 [2018-11-28 23:40:51,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-28 23:40:51,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:51,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:51,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-11-28 23:40:51,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:51,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-11-28 23:40:51,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:52,022 WARN L180 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-11-28 23:40:53,100 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 137 [2018-11-28 23:40:53,463 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-28 23:40:53,784 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 23:40:53,813 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:40:53,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:40:53,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:40:53,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:40:53,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:40:53,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:40:53,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:40:53,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:40:53,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-28 23:40:53,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:40:53,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:40:53,863 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-28 23:40:53,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:53,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:53,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:53,909 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-28 23:40:53,912 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-28 23:40:53,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:53,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:53,927 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-28 23:40:53,941 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-28 23:40:53,948 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-28 23:40:53,950 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-28 23:40:53,952 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-28 23:40:53,954 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-28 23:40:53,956 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-28 23:40:53,968 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-28 23:40:53,973 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-28 23:40:53,979 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-28 23:40:53,982 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-28 23:40:53,987 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-28 23:40:53,991 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-28 23:40:54,482 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 23:40:55,905 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-28 23:40:55,906 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-28 23:40:55,909 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-28 23:40:55,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:55,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:55,916 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-28 23:40:55,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:40:55,921 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-28 23:40:55,924 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-28 23:40:55,926 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-28 23:40:55,928 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-28 23:40:55,931 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-28 23:40:55,933 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-28 23:40:56,588 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 23:40:57,104 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 23:41:01,026 WARN L180 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-28 23:41:01,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:01,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:01,154 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-28 23:41:01,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:01,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:01,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,198 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-28 23:41:01,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:01,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:01,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,211 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-28 23:41:01,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,215 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-28 23:41:01,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,221 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-28 23:41:01,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,226 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-28 23:41:01,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,231 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-28 23:41:01,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,236 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-28 23:41:01,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,241 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-28 23:41:01,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:01,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,251 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-28 23:41:01,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,256 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-28 23:41:01,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,259 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-28 23:41:01,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,262 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-28 23:41:01,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:01,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:01,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:01,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:01,264 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-28 23:41:01,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:01,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:01,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:01,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:01,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:01,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:01,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:01,306 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:41:01,308 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:41:01,313 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:01,316 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:01,318 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:01,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-11-28 23:41:01,455 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:41:01,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:01,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:01,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:01,726 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-28 23:41:01,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:41:01,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 23:41:01,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 23 states and 32 transitions. Complement of second has 6 states. [2018-11-28 23:41:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:41:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:41:01,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-28 23:41:01,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:01,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-28 23:41:01,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:01,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-28 23:41:01,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:01,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-11-28 23:41:01,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:01,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2018-11-28 23:41:01,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:41:01,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:41:01,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-28 23:41:01,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:01,818 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 23:41:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-28 23:41:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 23:41:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-28 23:41:01,820 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:41:01,820 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:41:01,820 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:01,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-28 23:41:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:01,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:01,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:41:01,823 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 167#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 168#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 177#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 179#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 164#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 171#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 172#L639-4 assume !(main_~length~0 > 0); 176#L652-1 [2018-11-28 23:41:01,823 INFO L796 eck$LassoCheckResult]: Loop: 176#L652-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 176#L652-1 [2018-11-28 23:41:01,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2018-11-28 23:41:01,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:01,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:01,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:01,894 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-28 23:41:01,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:01,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:41:01,895 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:01,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2018-11-28 23:41:01,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:01,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,107 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-28 23:41:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:41:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:41:02,152 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:41:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:02,200 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-28 23:41:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:02,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-28 23:41:02,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:02,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2018-11-28 23:41:02,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:41:02,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:41:02,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-28 23:41:02,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:02,211 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-28 23:41:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-28 23:41:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-28 23:41:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-28 23:41:02,214 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 23:41:02,214 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 23:41:02,214 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:02,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-28 23:41:02,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:02,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:02,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:02,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:02,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:41:02,217 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 212#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 213#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 220#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 222#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 209#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 214#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 215#L639-4 assume main_~length~0 > 0; 206#L644 assume !(main_~length~0 < 0); 207#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 219#L652-1 [2018-11-28 23:41:02,217 INFO L796 eck$LassoCheckResult]: Loop: 219#L652-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 219#L652-1 [2018-11-28 23:41:02,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2018-11-28 23:41:02,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:02,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2018-11-28 23:41:02,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2018-11-28 23:41:02,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:02,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:02,399 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-28 23:41:02,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:02,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:41:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:41:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:41:02,562 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 23:41:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:02,617 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-28 23:41:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:02,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-11-28 23:41:02,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:02,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2018-11-28 23:41:02,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:41:02,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:41:02,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2018-11-28 23:41:02,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:02,623 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 23:41:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2018-11-28 23:41:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-28 23:41:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 23:41:02,627 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 23:41:02,627 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 23:41:02,627 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:02,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 23:41:02,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:02,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:02,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:02,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:02,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:41:02,629 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 269#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 270#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 277#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 266#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 267#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 273#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 274#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 278#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 280#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 279#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 271#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 272#L639-4 assume main_~length~0 > 0; 264#L644 assume !(main_~length~0 < 0); 265#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 276#L652-1 [2018-11-28 23:41:02,629 INFO L796 eck$LassoCheckResult]: Loop: 276#L652-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 276#L652-1 [2018-11-28 23:41:02,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2018-11-28 23:41:02,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:02,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:02,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:02,717 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-28 23:41:02,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:02,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:03,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-28 23:41:03,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:41:03,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:03,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 23:41:03,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 23:41:03,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:41:03,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 23:41:03,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:03,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:41:03,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:41:03,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:41:03,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-11-28 23:41:03,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 23:41:03,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 23:41:03,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:41:03,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:03,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:41:03,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-28 23:41:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:03,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-28 23:41:03,325 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:03,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2018-11-28 23:41:03,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:03,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,530 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-28 23:41:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:41:03,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:41:03,572 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 23:41:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:03,677 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-28 23:41:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:41:03,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-28 23:41:03,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:03,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-11-28 23:41:03,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:41:03,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:41:03,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-28 23:41:03,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:03,680 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:41:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-28 23:41:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 23:41:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:41:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-28 23:41:03,682 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:41:03,682 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:41:03,682 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:03,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-28 23:41:03,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:41:03,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:03,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:03,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:03,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:41:03,683 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 357#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 358#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 368#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 359#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 360#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 364#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 365#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 369#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 371#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 370#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 362#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 363#L639-4 assume main_~length~0 > 0; 355#L644 assume !(main_~length~0 < 0); 356#L644-2 call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 367#L652-1 [2018-11-28 23:41:03,683 INFO L796 eck$LassoCheckResult]: Loop: 367#L652-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 367#L652-1 [2018-11-28 23:41:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2018-11-28 23:41:03,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2018-11-28 23:41:03,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2018-11-28 23:41:03,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:03,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:03,961 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-11-28 23:41:09,293 WARN L180 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 310 DAG size of output: 243 [2018-11-28 23:41:09,986 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-11-28 23:41:09,991 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:09,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:09,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:09,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:09,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:09,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:09,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:09,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:09,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_false-valid-memtrack_true-termination.i_Iteration6_Lasso [2018-11-28 23:41:09,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:09,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:09,999 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-28 23:41:10,032 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-28 23:41:10,046 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-28 23:41:10,047 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-28 23:41:10,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:10,607 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-28 23:41:10,617 INFO L168 Benchmark]: Toolchain (without parser) took 23874.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 951.3 MB in the beginning and 896.5 MB in the end (delta: 54.8 MB). Peak memory consumption was 405.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:10,618 INFO L168 Benchmark]: CDTParser took 0.18 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-28 23:41:10,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:10,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:10,624 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:10,624 INFO L168 Benchmark]: RCFGBuilder took 534.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:10,626 INFO L168 Benchmark]: BuchiAutomizer took 22521.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 179.4 MB). Peak memory consumption was 413.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:10,630 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.18 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 718.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 534.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22521.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 179.4 MB). Peak memory consumption was 413.2 MB. Max. memory is 11.5 GB. * 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...