./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/simple-ext_false-unreach-call_false-valid-memcleanup_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 9becd42a466bdbd2531661a22b57e70854c9d9ea .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:38:52,686 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:38:52,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:38:52,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:38:52,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:38:52,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:38:52,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:38:52,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:38:52,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:38:52,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:38:52,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:38:52,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:38:52,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:38:52,722 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:38:52,723 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:38:52,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:38:52,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:38:52,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:38:52,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:38:52,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:38:52,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:38:52,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:38:52,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:38:52,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:38:52,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:38:52,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:38:52,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:38:52,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:38:52,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:38:52,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:38:52,749 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:38:52,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:38:52,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:38:52,750 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:38:52,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:38:52,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:38:52,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:38:52,778 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:38:52,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:38:52,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:38:52,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:38:52,779 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:38:52,780 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:38:52,780 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:38:52,780 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:38:52,780 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:38:52,780 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:38:52,780 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:38:52,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:38:52,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:38:52,783 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:38:52,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:38:52,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:38:52,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:38:52,785 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:38:52,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:38:52,786 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:38:52,786 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:38:52,787 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:38:52,788 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 -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2019-01-14 03:38:52,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:38:52,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:38:52,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:38:52,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:38:52,843 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:38:52,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 03:38:52,899 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50735/0f2dadc788e6479da8a1d30e2b95a489/FLAGb6a250cc8 [2019-01-14 03:38:53,401 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:38:53,402 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 03:38:53,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50735/0f2dadc788e6479da8a1d30e2b95a489/FLAGb6a250cc8 [2019-01-14 03:38:53,718 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aee50735/0f2dadc788e6479da8a1d30e2b95a489 [2019-01-14 03:38:53,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:38:53,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:38:53,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:38:53,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:38:53,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:38:53,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:38:53" (1/1) ... [2019-01-14 03:38:53,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185eb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:53, skipping insertion in model container [2019-01-14 03:38:53,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:38:53" (1/1) ... [2019-01-14 03:38:53,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:38:53,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:38:54,146 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:38:54,159 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:38:54,205 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:38:54,338 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:38:54,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54 WrapperNode [2019-01-14 03:38:54,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:38:54,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:38:54,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:38:54,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:38:54,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:38:54,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:38:54,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:38:54,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:38:54,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... [2019-01-14 03:38:54,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:38:54,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:38:54,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:38:54,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:38:54,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:38:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:38:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:38:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 03:38:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 03:38:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 03:38:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:38:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:38:54,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:38:54,903 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:38:54,904 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 03:38:54,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:38:54 BoogieIcfgContainer [2019-01-14 03:38:54,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:38:54,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:38:54,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:38:54,909 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:38:54,910 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:38:54,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:38:53" (1/3) ... [2019-01-14 03:38:54,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@455fa292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:38:54, skipping insertion in model container [2019-01-14 03:38:54,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:38:54,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:38:54" (2/3) ... [2019-01-14 03:38:54,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@455fa292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:38:54, skipping insertion in model container [2019-01-14 03:38:54,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:38:54,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:38:54" (3/3) ... [2019-01-14 03:38:54,914 INFO L375 chiAutomizerObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-14 03:38:54,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:38:54,966 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:38:54,967 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:38:54,967 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:38:54,967 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:38:54,967 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:38:54,967 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:38:54,967 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:38:54,968 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:38:54,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 03:38:55,002 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:38:55,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:55,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:55,008 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:38:55,008 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:38:55,008 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:38:55,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 03:38:55,010 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:38:55,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:55,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:55,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:38:55,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:38:55,019 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 12#L629true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L621true [2019-01-14 03:38:55,019 INFO L796 eck$LassoCheckResult]: Loop: 5#L621true assume true; 5#L621true [2019-01-14 03:38:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-14 03:38:55,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:38:55,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash 101, now seen corresponding path program 1 times [2019-01-14 03:38:55,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:38:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:38:55,211 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-01-14 03:38:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:55,237 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-14 03:38:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:38:55,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-01-14 03:38:55,242 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:38:55,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-01-14 03:38:55,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 03:38:55,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 03:38:55,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-14 03:38:55,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:38:55,249 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 03:38:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-14 03:38:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 03:38:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 03:38:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-14 03:38:55,278 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 03:38:55,279 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 03:38:55,279 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:38:55,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-14 03:38:55,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:38:55,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:55,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:55,281 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:38:55,281 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:55,281 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 57#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L633-2 [2019-01-14 03:38:55,283 INFO L796 eck$LassoCheckResult]: Loop: 53#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 55#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 53#L633-2 [2019-01-14 03:38:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-01-14 03:38:55,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:55,308 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2019-01-14 03:38:55,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:55,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2019-01-14 03:38:55,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:56,058 WARN L181 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-01-14 03:38:56,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:56,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:56,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:56,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:56,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:56,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-01-14 03:38:56,764 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 03:38:56,900 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:38:56,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:38:56,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:38:56,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:38:56,901 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:38:56,902 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:38:56,902 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:38:56,902 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:38:56,902 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i_Iteration2_Lasso [2019-01-14 03:38:56,902 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:38:56,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:38:56,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:56,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:56,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:56,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:56,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:57,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:38:57,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:38:57,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:57,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:57,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:57,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:57,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:57,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:57,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:57,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:38:57,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:38:57,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:57,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:57,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:57,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:57,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:57,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:57,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:57,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:57,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:57,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:57,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:57,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:57,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:57,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:57,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:57,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:58,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:38:58,013 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:38:58,014 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:38:58,018 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:38:58,020 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:38:58,020 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:38:58,021 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-01-14 03:38:58,030 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 03:38:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:58,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:58,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:58,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:38:58,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 03:38:58,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2019-01-14 03:38:58,196 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 [2019-01-14 03:38:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:38:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 03:38:58,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 03:38:58,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:58,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 03:38:58,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:58,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 03:38:58,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:58,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 03:38:58,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-14 03:38:58,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-01-14 03:38:58,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 03:38:58,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 03:38:58,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-14 03:38:58,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:58,206 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 03:38:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-14 03:38:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 03:38:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 03:38:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-01-14 03:38:58,208 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 03:38:58,208 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 03:38:58,208 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:38:58,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-01-14 03:38:58,209 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-14 03:38:58,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:58,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:58,210 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:38:58,210 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:58,210 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 145#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 140#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L645-2 [2019-01-14 03:38:58,210 INFO L796 eck$LassoCheckResult]: Loop: 135#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 134#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 135#L645-2 [2019-01-14 03:38:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2019-01-14 03:38:58,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2019-01-14 03:38:58,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2102156855, now seen corresponding path program 1 times [2019-01-14 03:38:58,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:58,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:58,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:38:58,595 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 03:38:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:38:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:38:58,597 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 03:38:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:58,723 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-14 03:38:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:38:58,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-01-14 03:38:58,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-01-14 03:38:58,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-01-14 03:38:58,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 03:38:58,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 03:38:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-14 03:38:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:58,730 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 03:38:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-14 03:38:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-01-14 03:38:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 03:38:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-14 03:38:58,733 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 03:38:58,734 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 03:38:58,734 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:38:58,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-01-14 03:38:58,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-14 03:38:58,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:58,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:58,735 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:38:58,735 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:38:58,736 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 208#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 206#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 202#L636 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L621-1 [2019-01-14 03:38:58,736 INFO L796 eck$LassoCheckResult]: Loop: 205#L621-1 assume true; 205#L621-1 [2019-01-14 03:38:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2019-01-14 03:38:58,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:58,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:58,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:38:58,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2019-01-14 03:38:58,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:38:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:38:58,785 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:38:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:58,792 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-01-14 03:38:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:38:58,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-01-14 03:38:58,794 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-14 03:38:58,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-01-14 03:38:58,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 03:38:58,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 03:38:58,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-14 03:38:58,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:38:58,796 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 03:38:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-14 03:38:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 03:38:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 03:38:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 03:38:58,799 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 03:38:58,799 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 03:38:58,799 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:38:58,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-14 03:38:58,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:38:58,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:58,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:58,800 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:58,800 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:38:58,801 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 247#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 243#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L645-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L645-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L654-2 [2019-01-14 03:38:58,801 INFO L796 eck$LassoCheckResult]: Loop: 241#L654-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L654-2 [2019-01-14 03:38:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 206358786, now seen corresponding path program 1 times [2019-01-14 03:38:58,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:58,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:58,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:38:58,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2019-01-14 03:38:58,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:38:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:38:58,931 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 03:38:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:58,975 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-01-14 03:38:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:38:58,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-01-14 03:38:58,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:38:58,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-01-14 03:38:58,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 03:38:58,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 03:38:58,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-14 03:38:58,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:38:58,980 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 03:38:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-14 03:38:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-14 03:38:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 03:38:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 03:38:58,983 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 03:38:58,983 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 03:38:58,983 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:38:58,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-14 03:38:58,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:38:58,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:58,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:58,984 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:58,984 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:58,985 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 294#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 291#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 292#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 293#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2019-01-14 03:38:58,985 INFO L796 eck$LassoCheckResult]: Loop: 287#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 284#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 285#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2019-01-14 03:38:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2019-01-14 03:38:58,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:59,037 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 2 times [2019-01-14 03:38:59,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:59,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -60222244, now seen corresponding path program 1 times [2019-01-14 03:38:59,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:59,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:59,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:59,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:59,311 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 [2019-01-14 03:38:59,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:59,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:59,402 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 6 treesize of output 5 [2019-01-14 03:38:59,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 03:38:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:59,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 03:38:59,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2019-01-14 03:38:59,499 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 8 treesize of output 7 [2019-01-14 03:38:59,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-14 03:38:59,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-14 03:38:59,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:59,558 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 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 03:38:59,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-01-14 03:38:59,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 03:38:59,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 03:38:59,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:59,667 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 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 03:38:59,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-01-14 03:38:59,734 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 15 treesize of output 11 [2019-01-14 03:38:59,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2019-01-14 03:38:59,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:59,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-01-14 03:38:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:38:59,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 03:38:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 03:38:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 03:38:59,918 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-01-14 03:39:00,293 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-14 03:39:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:00,455 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-14 03:39:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 03:39:00,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-14 03:39:00,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:39:00,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-01-14 03:39:00,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 03:39:00,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 03:39:00,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-01-14 03:39:00,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:00,460 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-14 03:39:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-01-14 03:39:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-14 03:39:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 03:39:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 03:39:00,462 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 03:39:00,462 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 03:39:00,462 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:39:00,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-14 03:39:00,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:39:00,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:00,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:00,463 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:00,464 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:00,464 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 401#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 399#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 400#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 394#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 395#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 403#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 396#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 397#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 405#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 404#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 398#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 390#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L646 [2019-01-14 03:39:00,464 INFO L796 eck$LassoCheckResult]: Loop: 391#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 388#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 389#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L646 [2019-01-14 03:39:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2019-01-14 03:39:00,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 3 times [2019-01-14 03:39:00,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash 500492529, now seen corresponding path program 2 times [2019-01-14 03:39:00,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:00,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:39:00,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:39:00,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:39:00,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:39:00,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:39:00,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:00,921 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 6 treesize of output 5 [2019-01-14 03:39:00,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:00,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:00,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 03:39:01,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 03:39:01,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2019-01-14 03:39:01,105 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 8 treesize of output 7 [2019-01-14 03:39:01,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-01-14 03:39:01,145 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-14 03:39:01,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,155 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 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 03:39:01,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2019-01-14 03:39:01,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 03:39:01,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 03:39:01,222 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 8 treesize of output 7 [2019-01-14 03:39:01,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-01-14 03:39:01,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-14 03:39:01,335 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 16 treesize of output 1 [2019-01-14 03:39:01,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2019-01-14 03:39:01,376 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 03:39:01,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 03:39:01,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:39:01,386 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 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 03:39:01,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,412 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2019-01-14 03:39:01,439 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 15 treesize of output 11 [2019-01-14 03:39:01,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 03:39:01,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 03:39:01,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:39:01,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-01-14 03:39:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:39:01,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-14 03:39:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 03:39:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-01-14 03:39:01,551 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2019-01-14 03:39:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:01,710 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-14 03:39:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:39:01,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2019-01-14 03:39:01,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:39:01,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-14 03:39:01,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:39:01,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:39:01,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:39:01,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:01,713 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:39:01,713 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:39:01,713 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:39:01,713 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:39:01,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:39:01,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:39:01,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:39:01,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:39:01 BoogieIcfgContainer [2019-01-14 03:39:01,721 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:39:01,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:39:01,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:39:01,721 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:39:01,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:38:54" (3/4) ... [2019-01-14 03:39:01,725 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:39:01,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:39:01,726 INFO L168 Benchmark]: Toolchain (without parser) took 8004.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 951.4 MB in the beginning and 981.8 MB in the end (delta: -30.4 MB). Peak memory consumption was 184.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:01,728 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:01,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:01,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:01,729 INFO L168 Benchmark]: Boogie Preprocessor took 31.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:01,730 INFO L168 Benchmark]: RCFGBuilder took 478.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:01,730 INFO L168 Benchmark]: BuchiAutomizer took 6814.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 981.8 MB in the end (delta: 125.7 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:01,731 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:01,736 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 478.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6814.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 981.8 MB in the end (delta: 125.7 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 129 SDslu, 60 SDs, 0 SdLazy, 235 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf100 lsp94 ukn50 mio100 lsp31 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...