./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/list-ext-properties/simple-ext.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 e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:16:06,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:16:06,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:16:06,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:16:06,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:16:06,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:16:06,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:16:06,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:16:06,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:16:06,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:16:06,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:16:06,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:16:06,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:16:06,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:16:06,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:16:06,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:16:06,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:16:06,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:16:06,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:16:06,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:16:06,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:16:06,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:16:06,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:16:06,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:16:06,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:16:06,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:16:06,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:16:06,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:16:06,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:16:06,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:16:06,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:16:06,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:16:06,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:16:06,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:16:06,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:16:06,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:16:06,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:16:06,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:16:06,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:16:06,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:16:06,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:16:06,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:16:06,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:16:06,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:16:06,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:16:06,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:16:06,836 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:16:06,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:16:06,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:16:06,837 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:16:06,837 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:16:06,838 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:16:06,838 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:16:06,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:16:06,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:16:06,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:16:06,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:16:06,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:16:06,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:16:06,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:16:06,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:16:06,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:16:06,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:16:06,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:16:06,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:16:06,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:16:06,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:16:06,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:16:06,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:16:06,843 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:16:06,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:16:06,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:16:06,844 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:16:06,845 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:16:06,846 INFO L138 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 -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-28 03:16:07,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:16:07,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:16:07,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:16:07,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:16:07,195 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:16:07,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-28 03:16:07,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a834c5a29/c903b3c7c4bb444bbafc3b147a30ce80/FLAG11c8ec310 [2019-11-28 03:16:07,773 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:16:07,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-28 03:16:07,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a834c5a29/c903b3c7c4bb444bbafc3b147a30ce80/FLAG11c8ec310 [2019-11-28 03:16:08,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a834c5a29/c903b3c7c4bb444bbafc3b147a30ce80 [2019-11-28 03:16:08,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:16:08,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:16:08,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:08,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:16:08,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:16:08,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b36a554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08, skipping insertion in model container [2019-11-28 03:16:08,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:16:08,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:16:08,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:08,594 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:16:08,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:16:08,716 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:16:08,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08 WrapperNode [2019-11-28 03:16:08,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:16:08,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:08,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:16:08,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:16:08,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:16:08,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:16:08,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:16:08,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:16:08,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (1/1) ... [2019-11-28 03:16:08,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:16:08,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:16:08,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:16:08,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:16:08,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (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-11-28 03:16:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:16:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:16:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:16:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:16:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:16:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:16:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:16:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:16:09,250 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:16:09,250 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-28 03:16:09,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:09 BoogieIcfgContainer [2019-11-28 03:16:09,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:16:09,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:16:09,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:16:09,256 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:16:09,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:09,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:08" (1/3) ... [2019-11-28 03:16:09,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44b5b7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:09, skipping insertion in model container [2019-11-28 03:16:09,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:09,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:08" (2/3) ... [2019-11-28 03:16:09,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44b5b7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:09, skipping insertion in model container [2019-11-28 03:16:09,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:16:09,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:09" (3/3) ... [2019-11-28 03:16:09,262 INFO L371 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2019-11-28 03:16:09,306 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:16:09,307 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:16:09,307 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:16:09,307 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:16:09,308 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:16:09,308 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:16:09,308 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:16:09,308 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:16:09,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:16:09,344 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 03:16:09,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:09,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:09,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:16:09,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:09,352 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:16:09,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:16:09,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-28 03:16:09,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:09,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:09,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:16:09,355 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:09,363 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 11#L522true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L514true [2019-11-28 03:16:09,364 INFO L796 eck$LassoCheckResult]: Loop: 5#L514true assume true; 5#L514true [2019-11-28 03:16:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 03:16:09,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:09,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-28 03:16:09,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:09,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-28 03:16:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:09,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:16:09,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826450583] [2019-11-28 03:16:09,549 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:09,550 INFO L82 PathProgramCache]: Analyzing trace with hash 101, now seen corresponding path program 1 times [2019-11-28 03:16:09,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:09,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830283207] [2019-11-28 03:16:09,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,581 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:09,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:09,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:16:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:16:09,620 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-28 03:16:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:09,647 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-11-28 03:16:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:16:09,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-11-28 03:16:09,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:16:09,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-11-28 03:16:09,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:16:09,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:16:09,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-28 03:16:09,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:09,663 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 03:16:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-28 03:16:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 03:16:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 03:16:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 03:16:09,701 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 03:16:09,702 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 03:16:09,702 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:16:09,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-28 03:16:09,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:16:09,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:09,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:09,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:16:09,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:16:09,705 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 57#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L522-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#L526-2 [2019-11-28 03:16:09,706 INFO L796 eck$LassoCheckResult]: Loop: 53#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 55#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L529-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~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 53#L526-2 [2019-11-28 03:16:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-11-28 03:16:09,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:09,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279871207] [2019-11-28 03:16:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2019-11-28 03:16:09,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:09,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094376022] [2019-11-28 03:16:09,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2019-11-28 03:16:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095134262] [2019-11-28 03:16:09,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:09,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:10,259 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-11-28 03:16:10,314 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:10,436 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 03:16:10,437 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:10,444 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:10,539 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:10,542 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:10,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-11-28 03:16:10,646 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 03:16:10,750 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-28 03:16:10,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:16:10,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:16:10,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:16:10,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:16:10,823 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:16:10,823 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:10,823 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:16:10,823 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:16:10,823 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2019-11-28 03:16:10,824 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:16:10,824 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:16:10,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:16:11,632 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:16:11,638 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,648 INFO L120 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-11-28 03:16:11,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:11,678 INFO L120 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-11-28 03:16:11,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,706 INFO L120 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-11-28 03:16:11,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:11,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:11,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,737 INFO L120 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-11-28 03:16:11,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:11,762 INFO L120 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,765 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:16:11,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,767 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:16:11,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,784 INFO L120 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-11-28 03:16:11,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:11,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:11,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,815 INFO L120 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-11-28 03:16:11,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:11,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:11,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,836 INFO L120 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-11-28 03:16:11,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,865 INFO L120 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-11-28 03:16:11,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,890 INFO L120 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-11-28 03:16:11,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:11,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:11,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,932 INFO L120 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-11-28 03:16:11,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:11,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:11,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:11,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:11,965 INFO L120 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-11-28 03:16:11,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:11,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:11,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:11,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:11,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:11,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:11,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:12,034 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 03:16:12,035 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:12,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:16:12,119 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:12,119 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:12,120 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-11-28 03:16:12,147 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 03:16:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:12,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:16:12,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,249 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-11-28 03:16:12,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 03:16:12,307 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-11-28 03:16:12,308 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-11-28 03:16:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:16:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 03:16:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 03:16:12,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 03:16:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 03:16:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:12,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:16:12,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 03:16:12,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-28 03:16:12,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:16:12,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:16:12,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-28 03:16:12,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:12,318 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 03:16:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-28 03:16:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 03:16:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:16:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 03:16:12,321 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 03:16:12,321 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 03:16:12,321 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:16:12,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-28 03:16:12,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 03:16:12,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:16:12,324 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 145#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L522-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#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 140#L526-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#L538-2 [2019-11-28 03:16:12,324 INFO L796 eck$LassoCheckResult]: Loop: 135#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 134#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 135#L538-2 [2019-11-28 03:16:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2019-11-28 03:16:12,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002583305] [2019-11-28 03:16:12,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2019-11-28 03:16:12,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617765725] [2019-11-28 03:16:12,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2102156855, now seen corresponding path program 1 times [2019-11-28 03:16:12,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285334329] [2019-11-28 03:16:12,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285334329] [2019-11-28 03:16:12,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:12,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:16:12,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433866673] [2019-11-28 03:16:12,639 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-28 03:16:12,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:12,707 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 03:16:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:12,816 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 03:16:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:12,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-28 03:16:12,819 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-11-28 03:16:12,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-11-28 03:16:12,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:16:12,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:16:12,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-28 03:16:12,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:16:12,823 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-28 03:16:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-28 03:16:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-11-28 03:16:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:16:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-28 03:16:12,826 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 03:16:12,827 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 03:16:12,827 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:16:12,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-28 03:16:12,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 03:16:12,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:12,829 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 206#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L522-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#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 202#L529 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L514-1 [2019-11-28 03:16:12,829 INFO L796 eck$LassoCheckResult]: Loop: 205#L514-1 assume true; 205#L514-1 [2019-11-28 03:16:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2019-11-28 03:16:12,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001675283] [2019-11-28 03:16:12,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001675283] [2019-11-28 03:16:12,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:12,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:16:12,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766280695] [2019-11-28 03:16:12,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2019-11-28 03:16:12,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493910809] [2019-11-28 03:16:12,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:12,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:16:12,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:16:12,868 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-28 03:16:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:12,877 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-28 03:16:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:16:12,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 03:16:12,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-28 03:16:12,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-11-28 03:16:12,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:16:12,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:16:12,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 03:16:12,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:12,880 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 03:16:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 03:16:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-28 03:16:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:16:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 03:16:12,882 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:16:12,882 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:16:12,882 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:16:12,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-28 03:16:12,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:16:12,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:12,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:12,884 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:12,884 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 03:16:12,884 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 249#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 247#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L522-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#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 243#L526-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#L538-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L538-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L546-2 [2019-11-28 03:16:12,884 INFO L796 eck$LassoCheckResult]: Loop: 241#L546-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.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#L546-2 [2019-11-28 03:16:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 206358786, now seen corresponding path program 1 times [2019-11-28 03:16:12,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077145334] [2019-11-28 03:16:12,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:12,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077145334] [2019-11-28 03:16:12,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:12,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:16:12,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761513521] [2019-11-28 03:16:12,922 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2019-11-28 03:16:12,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:12,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235939989] [2019-11-28 03:16:12,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:12,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:12,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:16:12,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:16:12,998 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 03:16:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:13,061 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-28 03:16:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:16:13,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-28 03:16:13,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:16:13,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-11-28 03:16:13,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:16:13,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:16:13,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-28 03:16:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:13,064 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 03:16:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-28 03:16:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-28 03:16:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:16:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 03:16:13,068 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 03:16:13,068 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 03:16:13,068 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:16:13,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-28 03:16:13,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:16:13,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:13,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:13,069 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:13,069 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:16:13,070 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 296#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 294#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L522-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#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 291#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L529-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~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 292#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 293#L526-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#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-28 03:16:13,071 INFO L796 eck$LassoCheckResult]: Loop: 287#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 284#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 285#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-28 03:16:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2019-11-28 03:16:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800436210] [2019-11-28 03:16:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 2 times [2019-11-28 03:16:13,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76225918] [2019-11-28 03:16:13,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:13,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash -60222244, now seen corresponding path program 1 times [2019-11-28 03:16:13,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:13,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707265736] [2019-11-28 03:16:13,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:13,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707265736] [2019-11-28 03:16:13,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947520272] [2019-11-28 03:16:13,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:13,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 03:16:13,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:13,412 INFO L377 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-11-28 03:16:13,413 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,425 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,426 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 03:16:13,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,492 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 03:16:13,493 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,506 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 03:16:13,511 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,522 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,523 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-11-28 03:16:13,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:13,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 03:16:13,571 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,583 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,583 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-11-28 03:16:13,638 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 03:16:13,639 INFO L377 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 1 case distinctions, treesize of input 30 treesize of output 18 [2019-11-28 03:16:13,640 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,652 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,653 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-11-28 03:16:13,694 INFO L377 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 7 [2019-11-28 03:16:13,695 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,706 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:13,709 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:13,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-28 03:16:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:13,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:13,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 03:16:13,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128900462] [2019-11-28 03:16:13,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:16:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:16:13,801 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-28 03:16:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:14,055 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-28 03:16:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:16:14,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-28 03:16:14,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:16:14,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-11-28 03:16:14,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:16:14,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:16:14,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-28 03:16:14,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:14,059 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 03:16:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-28 03:16:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-11-28 03:16:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:16:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-28 03:16:14,061 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 03:16:14,061 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 03:16:14,062 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:16:14,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-28 03:16:14,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:16:14,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:14,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:14,063 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:14,063 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:16:14,064 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 401#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 399#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 400#L522-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#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 395#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 403#L529-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~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 396#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 397#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 405#L529-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~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 404#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 398#L526-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#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-28 03:16:14,064 INFO L796 eck$LassoCheckResult]: Loop: 391#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 388#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 389#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 391#L539 [2019-11-28 03:16:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2019-11-28 03:16:14,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050095141] [2019-11-28 03:16:14,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 3 times [2019-11-28 03:16:14,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132434766] [2019-11-28 03:16:14,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:14,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 500492529, now seen corresponding path program 2 times [2019-11-28 03:16:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531736599] [2019-11-28 03:16:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:14,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531736599] [2019-11-28 03:16:14,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195441172] [2019-11-28 03:16:14,240 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:14,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:16:14,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:14,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 03:16:14,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:14,315 INFO L377 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-11-28 03:16:14,315 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,322 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,323 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 03:16:14,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 03:16:14,385 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,417 INFO L588 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-28 03:16:14,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 03:16:14,424 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,437 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,438 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-28 03:16:14,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:14,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 03:16:14,488 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,499 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,499 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-28 03:16:14,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-28 03:16:14,549 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,563 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 03:16:14,571 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,589 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,590 INFO L508 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-11-28 03:16:14,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:26 [2019-11-28 03:16:14,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-28 03:16:14,638 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,657 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,657 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-11-28 03:16:14,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-11-28 03:16:14,691 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,700 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,701 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2019-11-28 03:16:14,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:16:14,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2019-11-28 03:16:14,736 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,744 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:14,745 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:14,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-28 03:16:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:14,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:14,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-11-28 03:16:14,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69550968] [2019-11-28 03:16:14,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 03:16:14,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-28 03:16:14,842 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2019-11-28 03:16:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:15,259 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-28 03:16:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:16:15,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-11-28 03:16:15,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:15,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-28 03:16:15,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:16:15,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:16:15,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:16:15,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:15,261 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:15,261 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:15,262 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:15,262 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:16:15,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:16:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:15,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:16:15,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:15 BoogieIcfgContainer [2019-11-28 03:16:15,269 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:16:15,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:16:15,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:16:15,270 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:16:15,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:09" (3/4) ... [2019-11-28 03:16:15,274 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:16:15,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:16:15,276 INFO L168 Benchmark]: Toolchain (without parser) took 7157.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.5 MB). Free memory was 957.7 MB in the beginning and 851.3 MB in the end (delta: 106.4 MB). Peak memory consumption was 333.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:15,276 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:15,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:15,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.04 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:15,278 INFO L168 Benchmark]: Boogie Preprocessor took 43.32 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-11-28 03:16:15,279 INFO L168 Benchmark]: RCFGBuilder took 424.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:15,279 INFO L168 Benchmark]: BuchiAutomizer took 6016.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 851.3 MB in the end (delta: 247.5 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:15,280 INFO L168 Benchmark]: Witness Printer took 4.94 ms. Allocated memory is still 1.3 GB. Free memory is still 851.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:15,282 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.04 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.32 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 424.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6016.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 851.3 MB in the end (delta: 247.5 MB). Peak memory consumption was 326.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.94 ms. Allocated memory is still 1.3 GB. Free memory is still 851.3 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 5.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. 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, 127 SDslu, 62 SDs, 0 SdLazy, 263 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax109 hnf100 lsp86 ukn51 mio100 lsp33 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf172 smp93 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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...