./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-9a8b2e8 [2020-10-20 06:47:10,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:10,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:10,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:10,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:10,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:10,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:10,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:10,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:10,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:10,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:10,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:10,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:10,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:10,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:10,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:10,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:10,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:10,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:10,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:10,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:10,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:10,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:10,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:10,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:10,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:10,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:10,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:10,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:10,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:10,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:10,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:10,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:10,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:10,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:10,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:10,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:10,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:10,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:10,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:10,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:10,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:10,158 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:10,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:10,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:10,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:10,160 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:10,160 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:10,160 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:10,160 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:10,160 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:10,161 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:10,161 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:10,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:10,161 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:10,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:10,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:10,163 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:10,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:10,163 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:10,163 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:10,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:10,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:10,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:10,164 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:10,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:10,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:10,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:10,165 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:10,165 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:10,166 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2020-10-20 06:47:10,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:10,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:10,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:10,406 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:10,407 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:10,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2020-10-20 06:47:10,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83defd30/e4f37975f65e4de7b7794a5e40d44e85/FLAG2bbb44a37 [2020-10-20 06:47:11,000 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:11,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2020-10-20 06:47:11,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83defd30/e4f37975f65e4de7b7794a5e40d44e85/FLAG2bbb44a37 [2020-10-20 06:47:11,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b83defd30/e4f37975f65e4de7b7794a5e40d44e85 [2020-10-20 06:47:11,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:11,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:11,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:11,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:11,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:11,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d8c49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11, skipping insertion in model container [2020-10-20 06:47:11,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:11,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:11,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:11,663 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:11,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:11,747 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:11,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11 WrapperNode [2020-10-20 06:47:11,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:11,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:11,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:11,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:11,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:11,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:11,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:11,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:11,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (1/1) ... [2020-10-20 06:47:11,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:11,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:11,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:11,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:11,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (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-20 06:47:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:12,378 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:12,379 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:12,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12 BoogieIcfgContainer [2020-10-20 06:47:12,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:12,382 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:12,382 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:12,386 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:12,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:11" (1/3) ... [2020-10-20 06:47:12,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dabb758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:12, skipping insertion in model container [2020-10-20 06:47:12,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:11" (2/3) ... [2020-10-20 06:47:12,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dabb758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:12, skipping insertion in model container [2020-10-20 06:47:12,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12" (3/3) ... [2020-10-20 06:47:12,393 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2020-10-20 06:47:12,451 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:12,451 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:12,451 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:12,451 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:12,452 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:12,452 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:12,452 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:12,452 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:12,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-10-20 06:47:12,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-10-20 06:47:12,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,502 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,502 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:12,502 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:12,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-10-20 06:47:12,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-10-20 06:47:12,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,508 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,509 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:12,517 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 18#L197-1true [2020-10-20 06:47:12,518 INFO L796 eck$LassoCheckResult]: Loop: 18#L197-1true assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 26#L52true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 45#L83true assume 0 != main_~p1~0;main_~lk1~0 := 1; 43#L83-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L87-1true assume !(0 != main_~p3~0); 3#L91-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 6#L95-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 30#L99-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 22#L103-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 36#L107-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L111-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 33#L115-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 49#L119-1true assume !(0 != main_~p11~0); 41#L123-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 46#L127-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 13#L131-1true assume !(0 != main_~p1~0); 34#L137-1true assume !(0 != main_~p2~0); 14#L142-1true assume !(0 != main_~p3~0); 24#L147-1true assume !(0 != main_~p4~0); 50#L152-1true assume !(0 != main_~p5~0); 4#L157-1true assume !(0 != main_~p6~0); 37#L162-1true assume !(0 != main_~p7~0); 42#L167-1true assume !(0 != main_~p8~0); 28#L172-1true assume !(0 != main_~p9~0); 31#L177-1true assume !(0 != main_~p10~0); 9#L182-1true assume !(0 != main_~p11~0); 20#L187-1true assume !(0 != main_~p12~0); 47#L192-1true assume !(0 != main_~p13~0); 18#L197-1true [2020-10-20 06:47:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:12,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121798134] [2020-10-20 06:47:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2020-10-20 06:47:12,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407964303] [2020-10-20 06:47:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,802 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-20 06:47:12,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407964303] [2020-10-20 06:47:12,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240290712] [2020-10-20 06:47:12,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,833 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-10-20 06:47:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,891 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2020-10-20 06:47:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2020-10-20 06:47:12,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2020-10-20 06:47:12,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2020-10-20 06:47:12,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2020-10-20 06:47:12,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2020-10-20 06:47:12,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2020-10-20 06:47:12,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,923 INFO L691 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-20 06:47:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2020-10-20 06:47:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-10-20 06:47:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-20 06:47:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-10-20 06:47:12,983 INFO L714 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-20 06:47:12,983 INFO L594 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-20 06:47:12,983 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:12,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2020-10-20 06:47:12,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2020-10-20 06:47:12,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,986 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,987 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:12,987 INFO L794 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 171#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 172#L197-1 [2020-10-20 06:47:12,987 INFO L796 eck$LassoCheckResult]: Loop: 172#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 199#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 200#L83 assume !(0 != main_~p1~0); 193#L83-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 178#L87-1 assume !(0 != main_~p3~0); 151#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 152#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 168#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 230#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 229#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 228#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 227#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 226#L119-1 assume !(0 != main_~p11~0); 225#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 224#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 223#L131-1 assume !(0 != main_~p1~0); 163#L137-1 assume !(0 != main_~p2~0); 164#L142-1 assume !(0 != main_~p3~0); 195#L147-1 assume !(0 != main_~p4~0); 186#L152-1 assume !(0 != main_~p5~0); 158#L157-1 assume !(0 != main_~p6~0); 160#L162-1 assume !(0 != main_~p7~0); 167#L167-1 assume !(0 != main_~p8~0); 184#L172-1 assume !(0 != main_~p9~0); 210#L177-1 assume !(0 != main_~p10~0); 177#L182-1 assume !(0 != main_~p11~0); 157#L187-1 assume !(0 != main_~p12~0); 180#L192-1 assume !(0 != main_~p13~0); 172#L197-1 [2020-10-20 06:47:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:12,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849294521] [2020-10-20 06:47:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,020 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2020-10-20 06:47:13,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682693437] [2020-10-20 06:47:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,091 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-20 06:47:13,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682693437] [2020-10-20 06:47:13,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122102247] [2020-10-20 06:47:13,095 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,096 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand 3 states. [2020-10-20 06:47:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,133 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2020-10-20 06:47:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2020-10-20 06:47:13,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2020-10-20 06:47:13,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2020-10-20 06:47:13,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2020-10-20 06:47:13,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2020-10-20 06:47:13,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2020-10-20 06:47:13,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,143 INFO L691 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-10-20 06:47:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2020-10-20 06:47:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-20 06:47:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-20 06:47:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2020-10-20 06:47:13,160 INFO L714 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-10-20 06:47:13,160 INFO L594 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2020-10-20 06:47:13,161 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:13,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2020-10-20 06:47:13,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2020-10-20 06:47:13,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,170 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,171 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,171 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 421#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 422#L197-1 [2020-10-20 06:47:13,171 INFO L796 eck$LassoCheckResult]: Loop: 422#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 473#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 471#L83 assume !(0 != main_~p1~0); 469#L83-2 assume !(0 != main_~p2~0); 467#L87-1 assume !(0 != main_~p3~0); 466#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 465#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 464#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 463#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 462#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 461#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 460#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 459#L119-1 assume !(0 != main_~p11~0); 458#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 457#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 454#L131-1 assume !(0 != main_~p1~0); 455#L137-1 assume !(0 != main_~p2~0); 500#L142-1 assume !(0 != main_~p3~0); 497#L147-1 assume !(0 != main_~p4~0); 494#L152-1 assume !(0 != main_~p5~0); 491#L157-1 assume !(0 != main_~p6~0); 488#L162-1 assume !(0 != main_~p7~0); 486#L167-1 assume !(0 != main_~p8~0); 483#L172-1 assume !(0 != main_~p9~0); 481#L177-1 assume !(0 != main_~p10~0); 479#L182-1 assume !(0 != main_~p11~0); 476#L187-1 assume !(0 != main_~p12~0); 475#L192-1 assume !(0 != main_~p13~0); 422#L197-1 [2020-10-20 06:47:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:13,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917124143] [2020-10-20 06:47:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2020-10-20 06:47:13,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923817765] [2020-10-20 06:47:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,311 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-20 06:47:13,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923817765] [2020-10-20 06:47:13,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097745948] [2020-10-20 06:47:13,313 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,315 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand 3 states. [2020-10-20 06:47:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,354 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2020-10-20 06:47:13,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2020-10-20 06:47:13,360 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2020-10-20 06:47:13,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2020-10-20 06:47:13,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2020-10-20 06:47:13,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2020-10-20 06:47:13,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2020-10-20 06:47:13,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,374 INFO L691 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-10-20 06:47:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2020-10-20 06:47:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2020-10-20 06:47:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2020-10-20 06:47:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2020-10-20 06:47:13,420 INFO L714 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-10-20 06:47:13,420 INFO L594 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2020-10-20 06:47:13,423 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:13,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2020-10-20 06:47:13,426 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2020-10-20 06:47:13,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,428 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,429 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,429 INFO L794 eck$LassoCheckResult]: Stem: 943#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 908#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 909#L197-1 [2020-10-20 06:47:13,430 INFO L796 eck$LassoCheckResult]: Loop: 909#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 987#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 984#L83 assume !(0 != main_~p1~0); 980#L83-2 assume !(0 != main_~p2~0); 977#L87-1 assume !(0 != main_~p3~0); 975#L91-1 assume !(0 != main_~p4~0); 971#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 972#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 967#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 968#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 963#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 964#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 959#L119-1 assume !(0 != main_~p11~0); 960#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 955#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 956#L131-1 assume !(0 != main_~p1~0); 1032#L137-1 assume !(0 != main_~p2~0); 1029#L142-1 assume !(0 != main_~p3~0); 1026#L147-1 assume !(0 != main_~p4~0); 1024#L152-1 assume !(0 != main_~p5~0); 1020#L157-1 assume !(0 != main_~p6~0); 1016#L162-1 assume !(0 != main_~p7~0); 1012#L167-1 assume !(0 != main_~p8~0); 1007#L172-1 assume !(0 != main_~p9~0); 1004#L177-1 assume !(0 != main_~p10~0); 1000#L182-1 assume !(0 != main_~p11~0); 995#L187-1 assume !(0 != main_~p12~0); 992#L192-1 assume !(0 != main_~p13~0); 909#L197-1 [2020-10-20 06:47:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:13,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797031039] [2020-10-20 06:47:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2020-10-20 06:47:13,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842636795] [2020-10-20 06:47:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,497 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-20 06:47:13,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842636795] [2020-10-20 06:47:13,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015493547] [2020-10-20 06:47:13,499 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,500 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand 3 states. [2020-10-20 06:47:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,532 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2020-10-20 06:47:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2020-10-20 06:47:13,540 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2020-10-20 06:47:13,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2020-10-20 06:47:13,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2020-10-20 06:47:13,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2020-10-20 06:47:13,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2020-10-20 06:47:13,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,550 INFO L691 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-10-20 06:47:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2020-10-20 06:47:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2020-10-20 06:47:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2020-10-20 06:47:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2020-10-20 06:47:13,569 INFO L714 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-10-20 06:47:13,570 INFO L594 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2020-10-20 06:47:13,570 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:13,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2020-10-20 06:47:13,575 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2020-10-20 06:47:13,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,576 INFO L794 eck$LassoCheckResult]: Stem: 1885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1858#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 1859#L197-1 [2020-10-20 06:47:13,577 INFO L796 eck$LassoCheckResult]: Loop: 1859#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1939#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1934#L83 assume !(0 != main_~p1~0); 1926#L83-2 assume !(0 != main_~p2~0); 1919#L87-1 assume !(0 != main_~p3~0); 1914#L91-1 assume !(0 != main_~p4~0); 1915#L95-1 assume !(0 != main_~p5~0); 2055#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2053#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2050#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2048#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2042#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2040#L119-1 assume !(0 != main_~p11~0); 2034#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2030#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2027#L131-1 assume !(0 != main_~p1~0); 2022#L137-1 assume !(0 != main_~p2~0); 2017#L142-1 assume !(0 != main_~p3~0); 2010#L147-1 assume !(0 != main_~p4~0); 2005#L152-1 assume !(0 != main_~p5~0); 2002#L157-1 assume !(0 != main_~p6~0); 1998#L162-1 assume !(0 != main_~p7~0); 1996#L167-1 assume !(0 != main_~p8~0); 1992#L172-1 assume !(0 != main_~p9~0); 1990#L177-1 assume !(0 != main_~p10~0); 1976#L182-1 assume !(0 != main_~p11~0); 1963#L187-1 assume !(0 != main_~p12~0); 1950#L192-1 assume !(0 != main_~p13~0); 1859#L197-1 [2020-10-20 06:47:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:13,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287738307] [2020-10-20 06:47:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,599 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2020-10-20 06:47:13,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526531103] [2020-10-20 06:47:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,623 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-20 06:47:13,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526531103] [2020-10-20 06:47:13,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849576459] [2020-10-20 06:47:13,625 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,625 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand 3 states. [2020-10-20 06:47:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,652 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2020-10-20 06:47:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2020-10-20 06:47:13,690 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2020-10-20 06:47:13,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2020-10-20 06:47:13,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2020-10-20 06:47:13,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2020-10-20 06:47:13,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2020-10-20 06:47:13,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,704 INFO L691 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-10-20 06:47:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2020-10-20 06:47:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2020-10-20 06:47:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2020-10-20 06:47:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2020-10-20 06:47:13,731 INFO L714 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-10-20 06:47:13,731 INFO L594 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2020-10-20 06:47:13,731 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:13,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2020-10-20 06:47:13,739 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2020-10-20 06:47:13,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,741 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,741 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,741 INFO L794 eck$LassoCheckResult]: Stem: 3755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3722#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 3723#L197-1 [2020-10-20 06:47:13,742 INFO L796 eck$LassoCheckResult]: Loop: 3723#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 3848#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3845#L83 assume !(0 != main_~p1~0); 3841#L83-2 assume !(0 != main_~p2~0); 3838#L87-1 assume !(0 != main_~p3~0); 3803#L91-1 assume !(0 != main_~p4~0); 3804#L95-1 assume !(0 != main_~p5~0); 4061#L99-1 assume !(0 != main_~p6~0); 4062#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4038#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4033#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4021#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4019#L119-1 assume !(0 != main_~p11~0); 4012#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4006#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4000#L131-1 assume !(0 != main_~p1~0); 3994#L137-1 assume !(0 != main_~p2~0); 3973#L142-1 assume !(0 != main_~p3~0); 3968#L147-1 assume !(0 != main_~p4~0); 3966#L152-1 assume !(0 != main_~p5~0); 3962#L157-1 assume !(0 != main_~p6~0); 3959#L162-1 assume !(0 != main_~p7~0); 3930#L167-1 assume !(0 != main_~p8~0); 3925#L172-1 assume !(0 != main_~p9~0); 3923#L177-1 assume !(0 != main_~p10~0); 3920#L182-1 assume !(0 != main_~p11~0); 3915#L187-1 assume !(0 != main_~p12~0); 3853#L192-1 assume !(0 != main_~p13~0); 3723#L197-1 [2020-10-20 06:47:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:13,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241604527] [2020-10-20 06:47:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,762 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2020-10-20 06:47:13,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119349786] [2020-10-20 06:47:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,794 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-20 06:47:13,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119349786] [2020-10-20 06:47:13,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662487636] [2020-10-20 06:47:13,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,796 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-10-20 06:47:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,843 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2020-10-20 06:47:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2020-10-20 06:47:13,868 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2020-10-20 06:47:13,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2020-10-20 06:47:13,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2020-10-20 06:47:13,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2020-10-20 06:47:13,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2020-10-20 06:47:13,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,894 INFO L691 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-10-20 06:47:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2020-10-20 06:47:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2020-10-20 06:47:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-10-20 06:47:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2020-10-20 06:47:13,972 INFO L714 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-10-20 06:47:13,973 INFO L594 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2020-10-20 06:47:13,973 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:13,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2020-10-20 06:47:13,989 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2020-10-20 06:47:13,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,991 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,991 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,991 INFO L794 eck$LassoCheckResult]: Stem: 7432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7397#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 7398#L197-1 [2020-10-20 06:47:13,992 INFO L796 eck$LassoCheckResult]: Loop: 7398#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 7880#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7876#L83 assume !(0 != main_~p1~0); 7874#L83-2 assume !(0 != main_~p2~0); 7609#L87-1 assume !(0 != main_~p3~0); 7610#L91-1 assume !(0 != main_~p4~0); 7592#L95-1 assume !(0 != main_~p5~0); 7582#L99-1 assume !(0 != main_~p6~0); 7572#L103-1 assume !(0 != main_~p7~0); 7565#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7559#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7553#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7547#L119-1 assume !(0 != main_~p11~0); 7540#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7541#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 7841#L131-1 assume !(0 != main_~p1~0); 7839#L137-1 assume !(0 != main_~p2~0); 7823#L142-1 assume !(0 != main_~p3~0); 7812#L147-1 assume !(0 != main_~p4~0); 7801#L152-1 assume !(0 != main_~p5~0); 7802#L157-1 assume !(0 != main_~p6~0); 7919#L162-1 assume !(0 != main_~p7~0); 7916#L167-1 assume !(0 != main_~p8~0); 7911#L172-1 assume !(0 != main_~p9~0); 7908#L177-1 assume !(0 != main_~p10~0); 7906#L182-1 assume !(0 != main_~p11~0); 7890#L187-1 assume !(0 != main_~p12~0); 7884#L192-1 assume !(0 != main_~p13~0); 7398#L197-1 [2020-10-20 06:47:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:13,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905310743] [2020-10-20 06:47:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,010 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2020-10-20 06:47:14,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819445859] [2020-10-20 06:47:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,031 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-20 06:47:14,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819445859] [2020-10-20 06:47:14,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858053804] [2020-10-20 06:47:14,032 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,033 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2020-10-20 06:47:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,240 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2020-10-20 06:47:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2020-10-20 06:47:14,282 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2020-10-20 06:47:14,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2020-10-20 06:47:14,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2020-10-20 06:47:14,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2020-10-20 06:47:14,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2020-10-20 06:47:14,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,332 INFO L691 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-10-20 06:47:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2020-10-20 06:47:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2020-10-20 06:47:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4802 states. [2020-10-20 06:47:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2020-10-20 06:47:14,453 INFO L714 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-10-20 06:47:14,453 INFO L594 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2020-10-20 06:47:14,453 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:14,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2020-10-20 06:47:14,494 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2020-10-20 06:47:14,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,495 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,495 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,496 INFO L794 eck$LassoCheckResult]: Stem: 14675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14639#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14640#L197-1 [2020-10-20 06:47:14,496 INFO L796 eck$LassoCheckResult]: Loop: 14640#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 14936#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14932#L83 assume !(0 != main_~p1~0); 14929#L83-2 assume !(0 != main_~p2~0); 14930#L87-1 assume !(0 != main_~p3~0); 14868#L91-1 assume !(0 != main_~p4~0); 14869#L95-1 assume !(0 != main_~p5~0); 14849#L99-1 assume !(0 != main_~p6~0); 14851#L103-1 assume !(0 != main_~p7~0); 14825#L107-1 assume !(0 != main_~p8~0); 14827#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14808#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14809#L119-1 assume !(0 != main_~p11~0); 14792#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14793#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14773#L131-1 assume !(0 != main_~p1~0); 14775#L137-1 assume !(0 != main_~p2~0); 14976#L142-1 assume !(0 != main_~p3~0); 14972#L147-1 assume !(0 != main_~p4~0); 14970#L152-1 assume !(0 != main_~p5~0); 14967#L157-1 assume !(0 != main_~p6~0); 14963#L162-1 assume !(0 != main_~p7~0); 14959#L167-1 assume !(0 != main_~p8~0); 14955#L172-1 assume !(0 != main_~p9~0); 14952#L177-1 assume !(0 != main_~p10~0); 14948#L182-1 assume !(0 != main_~p11~0); 14943#L187-1 assume !(0 != main_~p12~0); 14940#L192-1 assume !(0 != main_~p13~0); 14640#L197-1 [2020-10-20 06:47:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:14,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710384451] [2020-10-20 06:47:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,504 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,513 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2020-10-20 06:47:14,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999400241] [2020-10-20 06:47:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,535 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-20 06:47:14,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999400241] [2020-10-20 06:47:14,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619265230] [2020-10-20 06:47:14,537 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,538 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2020-10-20 06:47:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,592 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2020-10-20 06:47:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2020-10-20 06:47:14,690 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2020-10-20 06:47:14,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2020-10-20 06:47:14,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2020-10-20 06:47:14,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2020-10-20 06:47:14,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2020-10-20 06:47:14,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,789 INFO L691 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-10-20 06:47:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2020-10-20 06:47:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2020-10-20 06:47:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9474 states. [2020-10-20 06:47:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2020-10-20 06:47:15,331 INFO L714 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-10-20 06:47:15,331 INFO L594 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2020-10-20 06:47:15,331 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:15,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2020-10-20 06:47:15,365 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2020-10-20 06:47:15,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,367 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,367 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,367 INFO L794 eck$LassoCheckResult]: Stem: 28951#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 28920#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 28921#L197-1 [2020-10-20 06:47:15,410 INFO L796 eck$LassoCheckResult]: Loop: 28921#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 29080#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29076#L83 assume !(0 != main_~p1~0); 29072#L83-2 assume !(0 != main_~p2~0); 29070#L87-1 assume !(0 != main_~p3~0); 29066#L91-1 assume !(0 != main_~p4~0); 29063#L95-1 assume !(0 != main_~p5~0); 29059#L99-1 assume !(0 != main_~p6~0); 29055#L103-1 assume !(0 != main_~p7~0); 29056#L107-1 assume !(0 != main_~p8~0); 29445#L111-1 assume !(0 != main_~p9~0); 29442#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29439#L119-1 assume !(0 != main_~p11~0); 29435#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29431#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29426#L131-1 assume !(0 != main_~p1~0); 29421#L137-1 assume !(0 != main_~p2~0); 29352#L142-1 assume !(0 != main_~p3~0); 29347#L147-1 assume !(0 != main_~p4~0); 29343#L152-1 assume !(0 != main_~p5~0); 29339#L157-1 assume !(0 != main_~p6~0); 29337#L162-1 assume !(0 != main_~p7~0); 29336#L167-1 assume !(0 != main_~p8~0); 29335#L172-1 assume !(0 != main_~p9~0); 29334#L177-1 assume !(0 != main_~p10~0); 29330#L182-1 assume !(0 != main_~p11~0); 29088#L187-1 assume !(0 != main_~p12~0); 29085#L192-1 assume !(0 != main_~p13~0); 28921#L197-1 [2020-10-20 06:47:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,410 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:15,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009201651] [2020-10-20 06:47:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,440 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2020-10-20 06:47:15,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174192804] [2020-10-20 06:47:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,475 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-20 06:47:15,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174192804] [2020-10-20 06:47:15,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875966251] [2020-10-20 06:47:15,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,477 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2020-10-20 06:47:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,535 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2020-10-20 06:47:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2020-10-20 06:47:15,944 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2020-10-20 06:47:16,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2020-10-20 06:47:16,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2020-10-20 06:47:16,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2020-10-20 06:47:16,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2020-10-20 06:47:16,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,100 INFO L691 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-10-20 06:47:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2020-10-20 06:47:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2020-10-20 06:47:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2020-10-20 06:47:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2020-10-20 06:47:16,832 INFO L714 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-10-20 06:47:16,833 INFO L594 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2020-10-20 06:47:16,833 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:16,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2020-10-20 06:47:16,950 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2020-10-20 06:47:16,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:16,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:16,952 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:16,952 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:16,952 INFO L794 eck$LassoCheckResult]: Stem: 57131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 57089#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 57090#L197-1 [2020-10-20 06:47:16,952 INFO L796 eck$LassoCheckResult]: Loop: 57090#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 57231#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57228#L83 assume !(0 != main_~p1~0); 57224#L83-2 assume !(0 != main_~p2~0); 57221#L87-1 assume !(0 != main_~p3~0); 57218#L91-1 assume !(0 != main_~p4~0); 57214#L95-1 assume !(0 != main_~p5~0); 57210#L99-1 assume !(0 != main_~p6~0); 57206#L103-1 assume !(0 != main_~p7~0); 57207#L107-1 assume !(0 != main_~p8~0); 57294#L111-1 assume !(0 != main_~p9~0); 57290#L115-1 assume !(0 != main_~p10~0); 57288#L119-1 assume !(0 != main_~p11~0); 57286#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57284#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57280#L131-1 assume !(0 != main_~p1~0); 57276#L137-1 assume !(0 != main_~p2~0); 57273#L142-1 assume !(0 != main_~p3~0); 57268#L147-1 assume !(0 != main_~p4~0); 57264#L152-1 assume !(0 != main_~p5~0); 57260#L157-1 assume !(0 != main_~p6~0); 57258#L162-1 assume !(0 != main_~p7~0); 57255#L167-1 assume !(0 != main_~p8~0); 57251#L172-1 assume !(0 != main_~p9~0); 57247#L177-1 assume !(0 != main_~p10~0); 57244#L182-1 assume !(0 != main_~p11~0); 57239#L187-1 assume !(0 != main_~p12~0); 57236#L192-1 assume !(0 != main_~p13~0); 57090#L197-1 [2020-10-20 06:47:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:16,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571554455] [2020-10-20 06:47:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,968 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2020-10-20 06:47:16,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158493414] [2020-10-20 06:47:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:16,992 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-20 06:47:16,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158493414] [2020-10-20 06:47:16,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:16,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:16,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328810233] [2020-10-20 06:47:16,993 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:16,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:16,994 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2020-10-20 06:47:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:17,463 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2020-10-20 06:47:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:17,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2020-10-20 06:47:17,645 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2020-10-20 06:47:18,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2020-10-20 06:47:18,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2020-10-20 06:47:18,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2020-10-20 06:47:18,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2020-10-20 06:47:18,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:18,223 INFO L691 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-10-20 06:47:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2020-10-20 06:47:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2020-10-20 06:47:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36866 states. [2020-10-20 06:47:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2020-10-20 06:47:19,568 INFO L714 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-10-20 06:47:19,568 INFO L594 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2020-10-20 06:47:19,568 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:47:19,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2020-10-20 06:47:19,758 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2020-10-20 06:47:19,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:19,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:19,759 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:19,760 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:19,760 INFO L794 eck$LassoCheckResult]: Stem: 112691#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112652#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 112653#L197-1 [2020-10-20 06:47:19,760 INFO L796 eck$LassoCheckResult]: Loop: 112653#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 113254#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113253#L83 assume !(0 != main_~p1~0); 113251#L83-2 assume !(0 != main_~p2~0); 113250#L87-1 assume !(0 != main_~p3~0); 113248#L91-1 assume !(0 != main_~p4~0); 113246#L95-1 assume !(0 != main_~p5~0); 113244#L99-1 assume !(0 != main_~p6~0); 113242#L103-1 assume !(0 != main_~p7~0); 113241#L107-1 assume !(0 != main_~p8~0); 113238#L111-1 assume !(0 != main_~p9~0); 113225#L115-1 assume !(0 != main_~p10~0); 113226#L119-1 assume !(0 != main_~p11~0); 113319#L123-1 assume !(0 != main_~p12~0); 113318#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113315#L131-1 assume !(0 != main_~p1~0); 113307#L137-1 assume !(0 != main_~p2~0); 113301#L142-1 assume !(0 != main_~p3~0); 113297#L147-1 assume !(0 != main_~p4~0); 113289#L152-1 assume !(0 != main_~p5~0); 113286#L157-1 assume !(0 != main_~p6~0); 113266#L162-1 assume !(0 != main_~p7~0); 113264#L167-1 assume !(0 != main_~p8~0); 113260#L172-1 assume !(0 != main_~p9~0); 113013#L177-1 assume !(0 != main_~p10~0); 113014#L182-1 assume !(0 != main_~p11~0); 113174#L187-1 assume !(0 != main_~p12~0); 113256#L192-1 assume !(0 != main_~p13~0); 112653#L197-1 [2020-10-20 06:47:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:19,760 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-20 06:47:19,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:19,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055526011] [2020-10-20 06:47:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:19,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:19,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:19,778 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2020-10-20 06:47:19,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:19,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027342827] [2020-10-20 06:47:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:19,796 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-20 06:47:19,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027342827] [2020-10-20 06:47:19,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:19,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:19,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673660650] [2020-10-20 06:47:19,797 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:19,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:19,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:19,798 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2020-10-20 06:47:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:20,886 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2020-10-20 06:47:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:20,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2020-10-20 06:47:21,320 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2020-10-20 06:47:22,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2020-10-20 06:47:22,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2020-10-20 06:47:22,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2020-10-20 06:47:22,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2020-10-20 06:47:22,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:22,391 INFO L691 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-10-20 06:47:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2020-10-20 06:47:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2020-10-20 06:47:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72706 states. [2020-10-20 06:47:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2020-10-20 06:47:24,983 INFO L714 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-10-20 06:47:24,984 INFO L594 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2020-10-20 06:47:24,984 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:47:24,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2020-10-20 06:47:26,139 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2020-10-20 06:47:26,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:26,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:26,142 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:26,142 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:26,142 INFO L794 eck$LassoCheckResult]: Stem: 222266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 222229#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 222230#L197-1 [2020-10-20 06:47:26,143 INFO L796 eck$LassoCheckResult]: Loop: 222230#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 222827#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222825#L83 assume !(0 != main_~p1~0); 222823#L83-2 assume !(0 != main_~p2~0); 222702#L87-1 assume !(0 != main_~p3~0); 222695#L91-1 assume !(0 != main_~p4~0); 222686#L95-1 assume !(0 != main_~p5~0); 222688#L99-1 assume !(0 != main_~p6~0); 222801#L103-1 assume !(0 != main_~p7~0); 222797#L107-1 assume !(0 != main_~p8~0); 222793#L111-1 assume !(0 != main_~p9~0); 222789#L115-1 assume !(0 != main_~p10~0); 222787#L119-1 assume !(0 != main_~p11~0); 222783#L123-1 assume !(0 != main_~p12~0); 222779#L127-1 assume !(0 != main_~p13~0); 222777#L131-1 assume !(0 != main_~p1~0); 222775#L137-1 assume !(0 != main_~p2~0); 222774#L142-1 assume !(0 != main_~p3~0); 222771#L147-1 assume !(0 != main_~p4~0); 222769#L152-1 assume !(0 != main_~p5~0); 222767#L157-1 assume !(0 != main_~p6~0); 222765#L162-1 assume !(0 != main_~p7~0); 222763#L167-1 assume !(0 != main_~p8~0); 222761#L172-1 assume !(0 != main_~p9~0); 222759#L177-1 assume !(0 != main_~p10~0); 222758#L182-1 assume !(0 != main_~p11~0); 222740#L187-1 assume !(0 != main_~p12~0); 222741#L192-1 assume !(0 != main_~p13~0); 222230#L197-1 [2020-10-20 06:47:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-10-20 06:47:26,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:26,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356573218] [2020-10-20 06:47:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2020-10-20 06:47:26,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:26,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140929323] [2020-10-20 06:47:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2020-10-20 06:47:26,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:26,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787667268] [2020-10-20 06:47:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:26,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:26,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:26,341 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-20 06:47:26,751 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-10-20 06:47:26,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:26 BoogieIcfgContainer [2020-10-20 06:47:26,893 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:26,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:26,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:26,894 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:26,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:12" (3/4) ... [2020-10-20 06:47:26,899 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:27,000 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:27,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:27,002 INFO L168 Benchmark]: Toolchain (without parser) took 15597.24 ms. Allocated memory was 40.4 MB in the beginning and 263.2 MB in the end (delta: 222.8 MB). Free memory was 17.7 MB in the beginning and 111.8 MB in the end (delta: -94.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,002 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 30.9 MB. Free memory was 16.9 MB in the beginning and 16.9 MB in the end (delta: 31.1 kB). Peak memory consumption was 31.1 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.84 ms. Allocated memory was 40.4 MB in the beginning and 41.4 MB in the end (delta: 1.0 MB). Free memory was 16.9 MB in the beginning and 16.2 MB in the end (delta: 687.3 kB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.90 ms. Allocated memory is still 41.4 MB. Free memory was 16.0 MB in the beginning and 14.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,004 INFO L168 Benchmark]: Boogie Preprocessor took 53.88 ms. Allocated memory is still 41.4 MB. Free memory was 14.1 MB in the beginning and 12.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,004 INFO L168 Benchmark]: RCFGBuilder took 506.13 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 12.4 MB in the beginning and 20.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,005 INFO L168 Benchmark]: BuchiAutomizer took 14511.50 ms. Allocated memory was 43.0 MB in the beginning and 365.4 MB in the end (delta: 322.4 MB). Free memory was 20.1 MB in the beginning and 183.0 MB in the end (delta: -162.9 MB). Peak memory consumption was 159.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,005 INFO L168 Benchmark]: Witness Printer took 106.26 ms. Allocated memory was 365.4 MB in the beginning and 263.2 MB in the end (delta: -102.2 MB). Free memory was 183.0 MB in the beginning and 111.8 MB in the end (delta: 71.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:27,008 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 30.9 MB. Free memory was 16.9 MB in the beginning and 16.9 MB in the end (delta: 31.1 kB). Peak memory consumption was 31.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 339.84 ms. Allocated memory was 40.4 MB in the beginning and 41.4 MB in the end (delta: 1.0 MB). Free memory was 16.9 MB in the beginning and 16.2 MB in the end (delta: 687.3 kB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 66.90 ms. Allocated memory is still 41.4 MB. Free memory was 16.0 MB in the beginning and 14.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 53.88 ms. Allocated memory is still 41.4 MB. Free memory was 14.1 MB in the beginning and 12.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 506.13 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 12.4 MB in the beginning and 20.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 14511.50 ms. Allocated memory was 43.0 MB in the beginning and 365.4 MB in the end (delta: 322.4 MB). Free memory was 20.1 MB in the beginning and 183.0 MB in the end (delta: -162.9 MB). Peak memory consumption was 159.6 MB. Max. memory is 14.3 GB. * Witness Printer took 106.26 ms. Allocated memory was 365.4 MB in the beginning and 263.2 MB in the end (delta: -102.2 MB). Free memory was 183.0 MB in the beginning and 111.8 MB in the end (delta: 71.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.9s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 5.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.8s Buchi closure took 0.1s. Biggest automaton had 72706 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1133 SDtfs, 589 SDslu, 709 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=15047} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=15047, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d721340=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bca5cc1=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75cb51da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35971bdc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17495199=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1786dea7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64095ef2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f9bf0f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@523e1857=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b1b7a85=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=15050, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@642c4245=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37910dbf=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66f3b34f=0, lk13=0, p13=0, p11=0, lk11=0, cond=11, NULL=15049, NULL=0, NULL=15048, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@386c080c=11, lk4=0, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...