./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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 8dfe6e301265e265404ce5be2c9f54235040b69e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:46:03,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:46:03,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:46:03,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:46:03,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:46:03,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:46:03,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:46:03,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:46:03,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:46:03,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:46:03,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:46:03,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:46:03,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:46:03,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:46:03,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:46:03,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:46:03,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:46:03,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:46:03,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:46:03,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:46:03,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:46:03,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:46:03,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:46:03,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:46:03,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:46:03,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:46:03,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:46:03,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:46:03,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:46:03,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:46:03,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:46:03,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:46:03,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:46:03,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:46:03,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:46:03,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:46:03,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:46:03,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:46:03,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:46:03,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:46:03,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:46:03,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:46:03,748 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:46:03,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:46:03,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:46:03,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:46:03,753 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:46:03,755 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:46:03,756 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:46:03,756 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:46:03,756 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:46:03,756 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:46:03,758 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:46:03,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:46:03,758 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:46:03,759 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:46:03,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:46:03,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:46:03,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:46:03,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:46:03,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:46:03,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:46:03,760 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:46:03,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:46:03,761 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:46:03,761 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:46:03,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:46:03,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:46:03,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:46:03,762 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:46:03,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:46:03,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:46:03,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:46:03,763 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:46:03,766 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:46:03,766 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 8dfe6e301265e265404ce5be2c9f54235040b69e [2020-10-26 04:46:04,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:46:04,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:46:04,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:46:04,251 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:46:04,252 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:46:04,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-26 04:46:04,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400687582/05a656b3cf3c41cdbae94cb2704f3ee9/FLAG0389bcac8 [2020-10-26 04:46:05,047 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:46:05,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-26 04:46:05,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400687582/05a656b3cf3c41cdbae94cb2704f3ee9/FLAG0389bcac8 [2020-10-26 04:46:05,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400687582/05a656b3cf3c41cdbae94cb2704f3ee9 [2020-10-26 04:46:05,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:46:05,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:46:05,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:05,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:46:05,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:46:05,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c530365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05, skipping insertion in model container [2020-10-26 04:46:05,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:46:05,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:46:05,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:05,748 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:46:05,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:05,864 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:46:05,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05 WrapperNode [2020-10-26 04:46:05,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:05,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:05,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:46:05,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:46:05,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:05,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:46:05,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:46:05,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:46:05,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (1/1) ... [2020-10-26 04:46:05,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:46:06,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:46:06,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:46:06,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:46:06,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (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 [2020-10-26 04:46:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:46:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:46:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 04:46:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-26 04:46:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:46:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-26 04:46:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:46:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:46:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:46:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:46:06,506 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:46:06,507 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-26 04:46:06,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:06 BoogieIcfgContainer [2020-10-26 04:46:06,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:46:06,510 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:46:06,510 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:46:06,514 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:46:06,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:06,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:46:05" (1/3) ... [2020-10-26 04:46:06,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5152cff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:06, skipping insertion in model container [2020-10-26 04:46:06,517 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:06,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:05" (2/3) ... [2020-10-26 04:46:06,518 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5152cff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:06, skipping insertion in model container [2020-10-26 04:46:06,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:06,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:06" (3/3) ... [2020-10-26 04:46:06,520 INFO L373 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2020-10-26 04:46:06,575 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:46:06,576 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:46:06,576 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:46:06,576 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:46:06,577 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:46:06,577 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:46:06,577 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:46:06,577 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:46:06,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-26 04:46:06,613 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-26 04:46:06,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:06,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:06,621 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:46:06,621 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:06,621 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:46:06,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-26 04:46:06,624 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-26 04:46:06,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:06,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:06,624 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:46:06,625 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:06,634 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 13#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 11#L533true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L525true [2020-10-26 04:46:06,634 INFO L796 eck$LassoCheckResult]: Loop: 5#L525true assume true; 5#L525true [2020-10-26 04:46:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-26 04:46:06,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:06,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864985645] [2020-10-26 04:46:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:06,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864985645] [2020-10-26 04:46:06,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:06,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:46:06,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135005476] [2020-10-26 04:46:06,866 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2020-10-26 04:46:06,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:06,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695392620] [2020-10-26 04:46:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:06,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:06,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:06,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:06,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:46:06,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:46:06,936 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-10-26 04:46:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:06,962 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-10-26 04:46:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:46:06,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-10-26 04:46:06,966 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-26 04:46:06,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2020-10-26 04:46:06,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:46:06,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:46:06,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-10-26 04:46:06,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:06,974 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:46:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-10-26 04:46:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-26 04:46:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-26 04:46:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-10-26 04:46:07,007 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:46:07,008 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:46:07,008 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:46:07,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-10-26 04:46:07,009 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-26 04:46:07,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:07,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:07,010 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:46:07,010 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:46:07,010 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 62#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 60#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 61#L533-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; 56#L537-2 [2020-10-26 04:46:07,010 INFO L796 eck$LassoCheckResult]: Loop: 56#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 58#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 64#L540-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~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; 56#L537-2 [2020-10-26 04:46:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2020-10-26 04:46:07,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:07,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81201277] [2020-10-26 04:46:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2020-10-26 04:46:07,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:07,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244670947] [2020-10-26 04:46:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,106 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2020-10-26 04:46:07,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:07,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304335832] [2020-10-26 04:46:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:07,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:07,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:07,709 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2020-10-26 04:46:07,781 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:07,943 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-26 04:46:07,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:07,954 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:08,065 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-26 04:46:08,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:08,068 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:08,068 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2020-10-26 04:46:08,186 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-26 04:46:08,498 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-10-26 04:46:08,655 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-26 04:46:08,665 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:08,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:08,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:08,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:08,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:08,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:08,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:08,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:08,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2020-10-26 04:46:08,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:08,668 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:08,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:08,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,072 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-10-26 04:46:09,320 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-10-26 04:46:09,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:46:09,910 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2020-10-26 04:46:10,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:46:10,097 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 [2020-10-26 04:46:10,104 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 [2020-10-26 04:46:10,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:10,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:10,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:10,114 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:10,144 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 [2020-10-26 04:46:10,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,163 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 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 [2020-10-26 04:46:10,193 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 [2020-10-26 04:46:10,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,202 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 [2020-10-26 04:46:10,236 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 [2020-10-26 04:46:10,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,251 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:10,278 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 [2020-10-26 04:46:10,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,295 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 [2020-10-26 04:46:10,338 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 [2020-10-26 04:46:10,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,371 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 [2020-10-26 04:46:10,412 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 [2020-10-26 04:46:10,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:10,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:10,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:10,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:10,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:10,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:10,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:46:10,441 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-26 04:46:10,442 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. 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) [2020-10-26 04:46:10,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:10,453 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:46:10,453 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:46:10,454 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2020-10-26 04:46:10,535 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-10-26 04:46:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:10,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:46:10,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:10,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:46:10,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:10,788 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 [2020-10-26 04:46:10,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-26 04:46:10,847 INFO L75 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. [2020-10-26 04:46:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:46:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:46:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-26 04:46:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-26 04:46:10,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-26 04:46:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-26 04:46:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:10,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-26 04:46:10,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-26 04:46:10,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-26 04:46:10,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 04:46:10,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:46:10,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-26 04:46:10,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:10,858 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-26 04:46:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-26 04:46:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-26 04:46:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:46:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-10-26 04:46:10,861 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-26 04:46:10,861 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-26 04:46:10,861 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:46:10,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-10-26 04:46:10,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-26 04:46:10,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:10,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:10,864 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:10,864 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:46:10,864 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 174#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 172#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 173#L533-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; 166#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 167#L537-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; 162#L549-2 [2020-10-26 04:46:10,864 INFO L796 eck$LassoCheckResult]: Loop: 162#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 164#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 161#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 162#L549-2 [2020-10-26 04:46:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2020-10-26 04:46:10,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:10,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009498299] [2020-10-26 04:46:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:10,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:10,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,903 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 69961, now seen corresponding path program 1 times [2020-10-26 04:46:10,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:10,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044079490] [2020-10-26 04:46:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:10,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:10,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:10,932 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2102157079, now seen corresponding path program 1 times [2020-10-26 04:46:10,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:10,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309840459] [2020-10-26 04:46:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:11,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309840459] [2020-10-26 04:46:11,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:11,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:46:11,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93910322] [2020-10-26 04:46:11,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:46:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:46:11,162 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-26 04:46:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:11,316 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-26 04:46:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:46:11,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-10-26 04:46:11,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2020-10-26 04:46:11,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2020-10-26 04:46:11,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-26 04:46:11,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-26 04:46:11,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-10-26 04:46:11,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:11,323 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-26 04:46:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-10-26 04:46:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2020-10-26 04:46:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-26 04:46:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-10-26 04:46:11,327 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-26 04:46:11,328 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-26 04:46:11,328 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:46:11,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-10-26 04:46:11,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-26 04:46:11,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:11,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:11,330 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:11,330 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:11,330 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 235#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 233#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 234#L533-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; 226#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 229#L540 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 232#L525-1 [2020-10-26 04:46:11,330 INFO L796 eck$LassoCheckResult]: Loop: 232#L525-1 assume true; 232#L525-1 [2020-10-26 04:46:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2020-10-26 04:46:11,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422614498] [2020-10-26 04:46:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:11,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422614498] [2020-10-26 04:46:11,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:11,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:46:11,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810295587] [2020-10-26 04:46:11,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-10-26 04:46:11,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910092158] [2020-10-26 04:46:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:11,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:46:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:46:11,375 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-26 04:46:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:11,385 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-10-26 04:46:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:46:11,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-10-26 04:46:11,387 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-26 04:46:11,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2020-10-26 04:46:11,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:46:11,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:46:11,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-10-26 04:46:11,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:11,389 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-26 04:46:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-10-26 04:46:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-26 04:46:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:46:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-26 04:46:11,392 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-26 04:46:11,392 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-26 04:46:11,392 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:46:11,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-10-26 04:46:11,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-26 04:46:11,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:11,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:11,394 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:11,395 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-26 04:46:11,395 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 276#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 274#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 275#L533-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; 269#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 270#L537-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; 266#L549-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 267#L549-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 268#L557-2 [2020-10-26 04:46:11,395 INFO L796 eck$LassoCheckResult]: Loop: 268#L557-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.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; 268#L557-2 [2020-10-26 04:46:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 206358793, now seen corresponding path program 1 times [2020-10-26 04:46:11,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664378245] [2020-10-26 04:46:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:11,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664378245] [2020-10-26 04:46:11,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:11,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:46:11,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502217503] [2020-10-26 04:46:11,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2020-10-26 04:46:11,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579834293] [2020-10-26 04:46:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,446 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:11,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:11,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:46:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:46:11,507 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-26 04:46:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:11,568 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-10-26 04:46:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:46:11,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-10-26 04:46:11,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-26 04:46:11,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2020-10-26 04:46:11,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:46:11,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:46:11,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-26 04:46:11,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:11,571 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-26 04:46:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-26 04:46:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-10-26 04:46:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-26 04:46:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-10-26 04:46:11,574 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-26 04:46:11,574 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-26 04:46:11,574 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:46:11,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-10-26 04:46:11,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-26 04:46:11,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:11,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:11,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:11,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:46:11,577 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 326#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 324#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 325#L533-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; 320#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 321#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 328#L540-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~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; 322#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 323#L537-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; 316#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-26 04:46:11,577 INFO L796 eck$LassoCheckResult]: Loop: 317#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 314#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 315#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-26 04:46:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2020-10-26 04:46:11,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917146540] [2020-10-26 04:46:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 2 times [2020-10-26 04:46:11,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012516171] [2020-10-26 04:46:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:11,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:11,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash -60215300, now seen corresponding path program 1 times [2020-10-26 04:46:11,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:11,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462264426] [2020-10-26 04:46:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:11,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462264426] [2020-10-26 04:46:11,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984402806] [2020-10-26 04:46:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-26 04:46:11,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:11,895 INFO L384 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 [2020-10-26 04:46:11,896 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:11,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:11,902 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:11,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-26 04:46:11,993 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:11,993 INFO L384 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 [2020-10-26 04:46:11,994 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,021 INFO L384 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 [2020-10-26 04:46:12,022 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,039 INFO L545 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. [2020-10-26 04:46:12,039 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-10-26 04:46:12,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:46:12,117 INFO L384 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 [2020-10-26 04:46:12,118 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,136 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:12,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:21 [2020-10-26 04:46:12,270 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-26 04:46:12,270 INFO L384 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 [2020-10-26 04:46:12,272 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,293 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:12,294 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-10-26 04:46:12,349 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-26 04:46:12,352 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,352 INFO L384 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 [2020-10-26 04:46:12,357 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:12,378 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:12,379 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-10-26 04:46:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:12,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:12,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-26 04:46:12,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085397378] [2020-10-26 04:46:12,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-26 04:46:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-26 04:46:12,493 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2020-10-26 04:46:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:12,946 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-26 04:46:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:46:12,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-26 04:46:12,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-26 04:46:12,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2020-10-26 04:46:12,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:46:12,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:46:12,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-26 04:46:12,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:12,950 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-26 04:46:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-26 04:46:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-10-26 04:46:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-26 04:46:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-26 04:46:12,953 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-26 04:46:12,953 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-26 04:46:12,953 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:46:12,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-26 04:46:12,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-26 04:46:12,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:12,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:12,955 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:12,955 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:46:12,955 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 433#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.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~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 431#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 432#L533-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; 426#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 427#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 435#L540-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~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; 428#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 429#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 437#L540-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~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; 436#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 430#L537-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; 422#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-26 04:46:12,955 INFO L796 eck$LassoCheckResult]: Loop: 423#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 420#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 421#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-26 04:46:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2020-10-26 04:46:12,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:12,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199648368] [2020-10-26 04:46:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:12,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:13,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:13,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 3 times [2020-10-26 04:46:13,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:13,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290759116] [2020-10-26 04:46:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:13,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:13,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:13,077 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 500499473, now seen corresponding path program 2 times [2020-10-26 04:46:13,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:13,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015029155] [2020-10-26 04:46:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:13,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015029155] [2020-10-26 04:46:13,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793399167] [2020-10-26 04:46:13,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:13,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:46:13,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:46:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 52 conjunts are in the unsatisfiable core [2020-10-26 04:46:13,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:13,392 INFO L384 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 [2020-10-26 04:46:13,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,399 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-26 04:46:13,480 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,481 INFO L384 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 [2020-10-26 04:46:13,482 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,540 INFO L625 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2020-10-26 04:46:13,547 INFO L384 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 [2020-10-26 04:46:13,547 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,569 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,569 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2020-10-26 04:46:13,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:46:13,627 INFO L384 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 [2020-10-26 04:46:13,627 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:13,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2020-10-26 04:46:13,711 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,712 INFO L384 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 [2020-10-26 04:46:13,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,743 INFO L384 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 [2020-10-26 04:46:13,744 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:13,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2020-10-26 04:46:13,901 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-26 04:46:13,903 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2020-10-26 04:46:13,904 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:13,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:13,934 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:13,934 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:48 [2020-10-26 04:46:14,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2020-10-26 04:46:14,141 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:14,187 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2020-10-26 04:46:14,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:14,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2020-10-26 04:46:14,368 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-26 04:46:14,371 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-26 04:46:14,384 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:14,385 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-10-26 04:46:14,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:46:14,390 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:14,422 INFO L625 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2020-10-26 04:46:14,430 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:14,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2020-10-26 04:46:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:14,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:14,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-26 04:46:14,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781644421] [2020-10-26 04:46:14,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-26 04:46:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-26 04:46:14,519 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2020-10-26 04:46:28,857 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-10-26 04:46:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:28,884 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-10-26 04:46:28,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 04:46:28,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2020-10-26 04:46:28,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:46:28,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-10-26 04:46:28,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:46:28,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:46:28,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:46:28,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:28,887 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:46:28,887 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:46:28,887 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:46:28,887 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:46:28,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:46:28,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:46:28,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:46:28,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:46:28 BoogieIcfgContainer [2020-10-26 04:46:28,893 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:46:28,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:46:28,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:46:28,894 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:46:28,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:06" (3/4) ... [2020-10-26 04:46:28,898 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:46:28,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:46:28,899 INFO L168 Benchmark]: Toolchain (without parser) took 23563.65 ms. Allocated memory was 48.2 MB in the beginning and 125.8 MB in the end (delta: 77.6 MB). Free memory was 24.1 MB in the beginning and 89.1 MB in the end (delta: -65.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:46:28,900 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:46:28,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.57 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 23.3 MB in the end (delta: 98.8 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:46:28,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.33 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 21.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:46:28,901 INFO L168 Benchmark]: Boogie Preprocessor took 71.07 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 20.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:46:28,901 INFO L168 Benchmark]: RCFGBuilder took 509.35 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.0 MB in the beginning and 37.3 MB in the end (delta: -17.2 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:46:28,902 INFO L168 Benchmark]: BuchiAutomizer took 22382.75 ms. Allocated memory was 58.7 MB in the beginning and 125.8 MB in the end (delta: 67.1 MB). Free memory was 37.3 MB in the beginning and 89.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:46:28,902 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 125.8 MB. Free memory is still 89.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:46:28,905 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.7 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 523.57 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 23.3 MB in the end (delta: 98.8 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.33 ms. Allocated memory is still 48.2 MB. Free memory was 23.3 MB in the beginning and 21.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.07 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 20.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 509.35 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.0 MB in the beginning and 37.3 MB in the end (delta: -17.2 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 22382.75 ms. Allocated memory was 58.7 MB in the beginning and 125.8 MB in the end (delta: 67.1 MB). Free memory was 37.3 MB in the beginning and 89.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * Witness Printer took 4.57 ms. Allocated memory is still 125.8 MB. Free memory is still 89.1 MB. There was no memory consumed. Max. memory is 16.1 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 22.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 12.6s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 152 SDslu, 58 SDs, 0 SdLazy, 317 SolverSat, 62 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax107 hnf100 lsp88 ukn51 mio100 lsp29 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf175 smp93 tf100 neg95 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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...