./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:14:02,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:14:02,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:14:02,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:14:02,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:14:02,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:14:02,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:14:02,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:14:02,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:14:02,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:14:02,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:14:02,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:14:02,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:14:02,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:14:02,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:14:02,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:14:02,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:14:02,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:14:02,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:14:02,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:14:02,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:14:02,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:14:02,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:14:02,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:14:02,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:14:02,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:14:02,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:14:02,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:14:02,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:14:02,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:14:02,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:14:02,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:14:02,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:14:02,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:14:02,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:14:02,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:14:02,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:14:02,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:14:02,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:14:02,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:14:02,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:14:02,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:14:02,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:14:02,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:14:02,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:14:02,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:14:02,597 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:14:02,598 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:14:02,598 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:14:02,598 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:14:02,598 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:14:02,599 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:14:02,600 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:14:02,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:14:02,600 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:14:02,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:14:02,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:14:02,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:14:02,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:14:02,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:14:02,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:14:02,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:14:02,603 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:14:02,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:14:02,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:14:02,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:14:02,604 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:14:02,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:14:02,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:14:02,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:14:02,605 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:14:02,608 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:14:02,609 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2020-10-26 04:14:03,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:14:03,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:14:03,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:14:03,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:14:03,135 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:14:03,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-10-26 04:14:03,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24d9b5d/dcb60abcc0524db09c6d32a47bc31304/FLAG740835ad7 [2020-10-26 04:14:03,815 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:14:03,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-10-26 04:14:03,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24d9b5d/dcb60abcc0524db09c6d32a47bc31304/FLAG740835ad7 [2020-10-26 04:14:04,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24d9b5d/dcb60abcc0524db09c6d32a47bc31304 [2020-10-26 04:14:04,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:14:04,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:14:04,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:14:04,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:14:04,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:14:04,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ea39bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04, skipping insertion in model container [2020-10-26 04:14:04,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:14:04,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:14:04,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:14:04,477 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:14:04,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:14:04,517 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:14:04,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04 WrapperNode [2020-10-26 04:14:04,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:14:04,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:14:04,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:14:04,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:14:04,529 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:14:04" (1/1) ... [2020-10-26 04:14:04,537 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:14:04" (1/1) ... [2020-10-26 04:14:04,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:14:04,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:14:04,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:14:04,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:14:04,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (1/1) ... [2020-10-26 04:14:04,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:14:04,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:14:04,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:14:04,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:14:04,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (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:14:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:14:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:14:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:14:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:14:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:14:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:14:05,080 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:14:05,080 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-26 04:14:05,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:14:05 BoogieIcfgContainer [2020-10-26 04:14:05,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:14:05,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:14:05,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:14:05,088 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:14:05,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:14:05,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:14:04" (1/3) ... [2020-10-26 04:14:05,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7867ee4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:14:05, skipping insertion in model container [2020-10-26 04:14:05,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:14:05,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:14:04" (2/3) ... [2020-10-26 04:14:05,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7867ee4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:14:05, skipping insertion in model container [2020-10-26 04:14:05,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:14:05,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:14:05" (3/3) ... [2020-10-26 04:14:05,093 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2020-10-26 04:14:05,146 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:14:05,146 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:14:05,146 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:14:05,146 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:14:05,147 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:14:05,147 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:14:05,147 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:14:05,147 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:14:05,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:14:05,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-26 04:14:05,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:05,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:05,190 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:14:05,190 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:14:05,190 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:14:05,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:14:05,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-26 04:14:05,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:05,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:05,192 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:14:05,192 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:14:05,204 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-10-26 04:14:05,205 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-10-26 04:14:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:14:05,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:05,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540721846] [2020-10-26 04:14:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-26 04:14:05,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:05,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137350507] [2020-10-26 04:14:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,382 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-26 04:14:05,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:05,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839889751] [2020-10-26 04:14:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:05,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:05,464 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:05,693 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:14:05,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:14:05,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:14:05,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:14:05,694 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:14:05,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:05,695 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:14:05,695 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:14:05,695 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2020-10-26 04:14:05,695 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:14:05,695 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:14:05,719 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:14:05,726 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:14:05,730 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:14:05,733 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:14:05,737 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:14:05,753 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:14:05,757 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:14:05,819 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:14:05,823 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:14:05,826 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:14:05,996 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:14:06,001 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) [2020-10-26 04:14:06,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:06,022 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:14:06,053 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:14:06,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:06,058 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:14:06,085 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:14:06,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:06,098 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) [2020-10-26 04:14:06,140 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:14:06,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,147 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:14:06,183 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:14:06,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:06,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:06,200 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:14:06,229 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:14:06,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:06,238 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:14:06,262 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:14:06,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:06,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:06,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:06,328 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:14:06,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:06,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,378 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:14:06,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:06,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:06,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:06,468 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:14:06,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:06,524 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:14:06,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:06,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:06,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:06,573 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:14:06,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:06,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:06,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:06,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:06,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:06,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:14:06,621 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 04:14:06,621 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:06,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:14:06,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:14:06,640 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:14:06,640 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-10-26 04:14:06,683 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-10-26 04:14:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:14:06,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:06,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:14:06,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:06,777 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:14:06,802 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:14:06,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-10-26 04:14:06,861 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-10-26 04:14:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:14:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:14:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-10-26 04:14:06,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-26 04:14:06,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:06,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 04:14:06,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:06,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 04:14:06,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:06,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-10-26 04:14:06,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:06,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-10-26 04:14:06,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:06,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-26 04:14:06,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-26 04:14:06,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:06,886 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-26 04:14:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-26 04:14:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-26 04:14:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-26 04:14:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-10-26 04:14:06,913 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-26 04:14:06,913 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-26 04:14:06,913 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:14:06,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-10-26 04:14:06,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:06,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:06,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:06,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:14:06,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:06,915 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2020-10-26 04:14:06,915 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 83#L17-4 [2020-10-26 04:14:06,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-10-26 04:14:06,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:06,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443702168] [2020-10-26 04:14:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:06,956 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:14:06,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443702168] [2020-10-26 04:14:06,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:14:06,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:14:06,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037691709] [2020-10-26 04:14:06,960 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-10-26 04:14:06,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:06,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691670308] [2020-10-26 04:14:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:06,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:06,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:07,130 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:07,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:07,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:14:07,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:14:07,176 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-26 04:14:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:07,192 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-10-26 04:14:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:14:07,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-10-26 04:14:07,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-10-26 04:14:07,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:07,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:07,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-10-26 04:14:07,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:07,196 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-26 04:14:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-10-26 04:14:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-26 04:14:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-26 04:14:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-10-26 04:14:07,199 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-26 04:14:07,199 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-26 04:14:07,199 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:14:07,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-10-26 04:14:07,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:07,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:07,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:14:07,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:07,201 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2020-10-26 04:14:07,202 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 108#L17-4 [2020-10-26 04:14:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-10-26 04:14:07,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723556098] [2020-10-26 04:14:07,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723556098] [2020-10-26 04:14:07,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60474422] [2020-10-26 04:14:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 04:14:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:07,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-10-26 04:14:07,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207407813] [2020-10-26 04:14:07,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-10-26 04:14:07,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015466779] [2020-10-26 04:14:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:07,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:14:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:14:07,470 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-26 04:14:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:07,491 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-10-26 04:14:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:14:07,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-10-26 04:14:07,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-10-26 04:14:07,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:07,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:07,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-10-26 04:14:07,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:07,495 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-26 04:14:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-10-26 04:14:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-10-26 04:14:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 04:14:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-10-26 04:14:07,497 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-26 04:14:07,497 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-26 04:14:07,497 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:14:07,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-10-26 04:14:07,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:07,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:07,499 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-10-26 04:14:07,499 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:07,499 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2020-10-26 04:14:07,500 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 147#L17-4 [2020-10-26 04:14:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-10-26 04:14:07,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113238000] [2020-10-26 04:14:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113238000] [2020-10-26 04:14:07,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500818307] [2020-10-26 04:14:07,552 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:07,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:14:07,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:07,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:14:07,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:07,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 04:14:07,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485763022] [2020-10-26 04:14:07,614 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-10-26 04:14:07,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34250589] [2020-10-26 04:14:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,629 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:07,734 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:07,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:14:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:14:07,768 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-10-26 04:14:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:07,791 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-10-26 04:14:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:14:07,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-10-26 04:14:07,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-10-26 04:14:07,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:07,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:07,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-10-26 04:14:07,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:07,794 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-26 04:14:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-10-26 04:14:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-10-26 04:14:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-26 04:14:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-10-26 04:14:07,796 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-26 04:14:07,796 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-26 04:14:07,796 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:14:07,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-10-26 04:14:07,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:07,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:07,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:07,802 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-10-26 04:14:07,802 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:07,802 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2020-10-26 04:14:07,802 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 195#L17-4 [2020-10-26 04:14:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-10-26 04:14:07,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679038367] [2020-10-26 04:14:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679038367] [2020-10-26 04:14:07,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920878865] [2020-10-26 04:14:07,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:07,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-26 04:14:07,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:07,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:14:07,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:07,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:07,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 04:14:07,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125604750] [2020-10-26 04:14:07,944 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-10-26 04:14:07,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:07,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573958317] [2020-10-26 04:14:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:07,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:07,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:08,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:14:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:14:08,115 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-10-26 04:14:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:08,145 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-26 04:14:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:14:08,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-26 04:14:08,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-10-26 04:14:08,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:08,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:08,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-10-26 04:14:08,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:08,148 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-26 04:14:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-10-26 04:14:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-26 04:14:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-26 04:14:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-26 04:14:08,150 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-26 04:14:08,150 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-26 04:14:08,150 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:14:08,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-10-26 04:14:08,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:08,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:08,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-10-26 04:14:08,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:08,152 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2020-10-26 04:14:08,152 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 258#L17-4 [2020-10-26 04:14:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-10-26 04:14:08,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:08,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508705320] [2020-10-26 04:14:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:08,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508705320] [2020-10-26 04:14:08,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525828372] [2020-10-26 04:14:08,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:08,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 04:14:08,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:08,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:14:08,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:08,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:08,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 04:14:08,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118849009] [2020-10-26 04:14:08,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-10-26 04:14:08,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:08,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64296925] [2020-10-26 04:14:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:08,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:08,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:08,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:08,395 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:08,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:08,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:14:08,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:14:08,428 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-10-26 04:14:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:08,459 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-26 04:14:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:14:08,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-10-26 04:14:08,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-10-26 04:14:08,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:08,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:08,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-26 04:14:08,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:08,462 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-26 04:14:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-26 04:14:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-26 04:14:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:14:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-26 04:14:08,464 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-26 04:14:08,464 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-26 04:14:08,464 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:14:08,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-10-26 04:14:08,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:08,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:08,466 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-10-26 04:14:08,466 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:08,466 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2020-10-26 04:14:08,466 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 328#L17-4 [2020-10-26 04:14:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-10-26 04:14:08,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:08,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913185568] [2020-10-26 04:14:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:08,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913185568] [2020-10-26 04:14:08,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559794315] [2020-10-26 04:14:08,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:08,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-26 04:14:08,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:08,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:14:08,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:08,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:08,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-26 04:14:08,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285902732] [2020-10-26 04:14:08,653 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-10-26 04:14:08,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:08,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150066207] [2020-10-26 04:14:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:08,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:08,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:08,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:08,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:14:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:14:08,825 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-10-26 04:14:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:08,876 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-10-26 04:14:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:14:08,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-10-26 04:14:08,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-10-26 04:14:08,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:08,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:08,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-10-26 04:14:08,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:08,879 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-26 04:14:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-10-26 04:14:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-26 04:14:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-26 04:14:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-26 04:14:08,881 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-26 04:14:08,881 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-26 04:14:08,881 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:14:08,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-26 04:14:08,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:08,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:08,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:08,882 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-10-26 04:14:08,882 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:08,883 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2020-10-26 04:14:08,883 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 413#L17-4 [2020-10-26 04:14:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-10-26 04:14:08,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:08,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381186056] [2020-10-26 04:14:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:08,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381186056] [2020-10-26 04:14:08,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536270224] [2020-10-26 04:14:08,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:09,045 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-26 04:14:09,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:09,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:14:09,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:09,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:09,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-26 04:14:09,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091874212] [2020-10-26 04:14:09,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-10-26 04:14:09,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:09,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239443182] [2020-10-26 04:14:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,086 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:09,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 04:14:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-26 04:14:09,218 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-10-26 04:14:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:09,256 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-26 04:14:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:14:09,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-26 04:14:09,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:09,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-10-26 04:14:09,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:09,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:09,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-10-26 04:14:09,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:09,259 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-26 04:14:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-10-26 04:14:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-26 04:14:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 04:14:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-10-26 04:14:09,261 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-26 04:14:09,261 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-26 04:14:09,261 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:14:09,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-10-26 04:14:09,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:09,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:09,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:09,263 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-10-26 04:14:09,263 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:09,263 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2020-10-26 04:14:09,263 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L17-4 [2020-10-26 04:14:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-10-26 04:14:09,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:09,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766213398] [2020-10-26 04:14:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:09,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766213398] [2020-10-26 04:14:09,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497493104] [2020-10-26 04:14:09,347 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:09,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:14:09,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:09,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:09,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-26 04:14:09,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969518082] [2020-10-26 04:14:09,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-10-26 04:14:09,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:09,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998329814] [2020-10-26 04:14:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,430 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:09,542 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:09,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 04:14:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-26 04:14:09,575 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-10-26 04:14:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:09,633 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-26 04:14:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 04:14:09,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-10-26 04:14:09,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:09,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-10-26 04:14:09,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:09,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:09,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-26 04:14:09,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:09,637 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-26 04:14:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-26 04:14:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 04:14:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:14:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-26 04:14:09,641 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-26 04:14:09,641 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-26 04:14:09,641 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:14:09,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-26 04:14:09,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:09,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:09,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:09,643 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-10-26 04:14:09,644 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:09,644 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2020-10-26 04:14:09,644 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 610#L17-4 [2020-10-26 04:14:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-10-26 04:14:09,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:09,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684259468] [2020-10-26 04:14:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:09,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684259468] [2020-10-26 04:14:09,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029969724] [2020-10-26 04:14:09,803 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:09,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:14:09,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:09,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:14:09,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:09,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:09,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-26 04:14:09,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214972858] [2020-10-26 04:14:09,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-10-26 04:14:09,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:09,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620001296] [2020-10-26 04:14:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:09,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:09,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:09,994 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:10,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 04:14:10,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-26 04:14:10,036 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-26 04:14:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:10,089 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-10-26 04:14:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 04:14:10,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-10-26 04:14:10,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:10,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-10-26 04:14:10,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:10,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:10,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-10-26 04:14:10,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:10,094 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-10-26 04:14:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-10-26 04:14:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-26 04:14:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 04:14:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-26 04:14:10,097 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-26 04:14:10,098 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-26 04:14:10,098 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:14:10,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-10-26 04:14:10,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:10,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:10,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:10,099 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-10-26 04:14:10,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:10,100 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2020-10-26 04:14:10,100 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 726#L17-4 [2020-10-26 04:14:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-10-26 04:14:10,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:10,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692704341] [2020-10-26 04:14:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:10,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692704341] [2020-10-26 04:14:10,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375557859] [2020-10-26 04:14:10,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:10,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-26 04:14:10,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:10,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:14:10,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:10,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:10,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-26 04:14:10,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774860920] [2020-10-26 04:14:10,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-10-26 04:14:10,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:10,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676233647] [2020-10-26 04:14:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:10,515 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-26 04:14:10,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 04:14:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-26 04:14:10,547 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-26 04:14:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:10,618 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-26 04:14:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 04:14:10,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-26 04:14:10,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:10,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-10-26 04:14:10,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:14:10,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-26 04:14:10,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-10-26 04:14:10,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:10,623 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-26 04:14:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-10-26 04:14:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-26 04:14:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-26 04:14:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-10-26 04:14:10,628 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-26 04:14:10,628 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-26 04:14:10,629 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 04:14:10,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-10-26 04:14:10,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:14:10,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:10,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:10,632 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-10-26 04:14:10,632 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:14:10,632 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2020-10-26 04:14:10,632 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L17-4 [2020-10-26 04:14:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-10-26 04:14:10,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:10,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641978204] [2020-10-26 04:14:10,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-10-26 04:14:10,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:10,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838758827] [2020-10-26 04:14:10,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,709 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-10-26 04:14:10,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:10,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127940700] [2020-10-26 04:14:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:10,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:10,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:14,925 WARN L193 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-10-26 04:14:15,123 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-26 04:14:15,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:14:15 BoogieIcfgContainer [2020-10-26 04:14:15,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:14:15,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:14:15,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:14:15,189 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:14:15,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:14:05" (3/4) ... [2020-10-26 04:14:15,196 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:14:15,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:14:15,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:14:15,309 INFO L168 Benchmark]: Toolchain (without parser) took 11081.16 ms. Allocated memory was 44.0 MB in the beginning and 119.5 MB in the end (delta: 75.5 MB). Free memory was 27.0 MB in the beginning and 70.3 MB in the end (delta: -43.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,312 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 24.0 MB in the beginning and 23.9 MB in the end (delta: 52.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:14:15,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.89 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 26.3 MB in the beginning and 31.4 MB in the end (delta: -5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 30.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,318 INFO L168 Benchmark]: Boogie Preprocessor took 23.57 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 28.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,319 INFO L168 Benchmark]: RCFGBuilder took 500.04 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 29.9 MB in the end (delta: -1.0 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,320 INFO L168 Benchmark]: BuchiAutomizer took 10102.51 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 29.9 MB in the beginning and 72.4 MB in the end (delta: -42.5 MB). Peak memory consumption was 49.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,320 INFO L168 Benchmark]: Witness Printer took 120.68 ms. Allocated memory is still 119.5 MB. Free memory was 72.4 MB in the beginning and 70.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:15,327 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.25 ms. Allocated memory is still 44.0 MB. Free memory was 24.0 MB in the beginning and 23.9 MB in the end (delta: 52.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 281.89 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 26.3 MB in the beginning and 31.4 MB in the end (delta: -5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 30.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.57 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 28.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 500.04 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 29.9 MB in the end (delta: -1.0 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 10102.51 ms. Allocated memory was 54.5 MB in the beginning and 119.5 MB in the end (delta: 65.0 MB). Free memory was 29.9 MB in the beginning and 72.4 MB in the end (delta: -42.5 MB). Peak memory consumption was 49.2 MB. Max. memory is 16.1 GB. * Witness Printer took 120.68 ms. Allocated memory is still 119.5 MB. Free memory was 72.4 MB in the beginning and 70.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. 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 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 9.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@c72eb9f=0, NULL=0, \result=0, NULL=1, n=10, i=2, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5df40aac=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@112101a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f9a8523=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b973caa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7e190393=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...