./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.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_14-1.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 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:10,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:10,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:10,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:10,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:10,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:10,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:10,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:10,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:10,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:10,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:10,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:10,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:10,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:10,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:10,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:10,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:10,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:10,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:10,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:10,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:10,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:10,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:10,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:10,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:10,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:10,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:10,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:10,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:10,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:10,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:10,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:10,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:10,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:10,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:10,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:10,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:10,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:10,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:10,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:10,479 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,531 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:10,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:10,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:10,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:10,535 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:10,536 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:10,536 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:10,536 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:10,537 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:10,537 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:10,537 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:10,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:10,539 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:10,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:10,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:10,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:10,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:10,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:10,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:10,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:10,541 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:10,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:10,542 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:10,542 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:10,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:10,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:10,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:10,544 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:10,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:10,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:10,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:10,545 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:10,547 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:10,548 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 -> 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 [2020-10-20 06:47:10,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:10,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:10,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:10,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:10,836 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:10,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2020-10-20 06:47:10,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ef77a11/86453909b2ea41ff99e27739a63a8fc9/FLAGaf22907b6 [2020-10-20 06:47:11,483 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:11,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2020-10-20 06:47:11,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ef77a11/86453909b2ea41ff99e27739a63a8fc9/FLAGaf22907b6 [2020-10-20 06:47:11,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ef77a11/86453909b2ea41ff99e27739a63a8fc9 [2020-10-20 06:47:11,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:11,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:11,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:11,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:11,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:11,785 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,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c721ec 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,790 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,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:11,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:12,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,121 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:12,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,169 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:12,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12 WrapperNode [2020-10-20 06:47:12,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:12,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:12,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:12,180 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:12" (1/1) ... [2020-10-20 06:47:12,191 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:12" (1/1) ... [2020-10-20 06:47:12,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:12,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:12,231 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:12" (1/1) ... [2020-10-20 06:47:12,231 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:12" (1/1) ... [2020-10-20 06:47:12,233 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:12" (1/1) ... [2020-10-20 06:47:12,234 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:12" (1/1) ... [2020-10-20 06:47:12,239 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:12" (1/1) ... [2020-10-20 06:47:12,245 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:12" (1/1) ... [2020-10-20 06:47:12,247 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:12" (1/1) ... [2020-10-20 06:47:12,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:12,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:12,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:12,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (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:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:12,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:12,691 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:12,692 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:12,693 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,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:12,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:12,695 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:12,699 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:12,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,701 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,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@643ab0cc 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,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (2/3) ... [2020-10-20 06:47:12,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@643ab0cc 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,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:12,703 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,705 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2020-10-20 06:47:12,770 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:12,770 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:12,770 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:12,770 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:12,771 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:12,771 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:12,771 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:12,771 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:12,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-20 06:47:12,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-20 06:47:12,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,838 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,838 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, 1, 1] [2020-10-20 06:47:12,839 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:12,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-20 06:47:12,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-20 06:47:12,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,846 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,847 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, 1, 1] [2020-10-20 06:47:12,856 INFO L794 eck$LassoCheckResult]: Stem: 26#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 49#L211-1true [2020-10-20 06:47:12,857 INFO L796 eck$LassoCheckResult]: Loop: 49#L211-1true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 30#L55true 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;main_~lk14~0 := 0; 31#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 28#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L92-1true assume !(0 != main_~p3~0); 37#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 43#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 35#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 52#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 45#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 50#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 14#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 4#L124-1true assume !(0 != main_~p11~0); 25#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 32#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 22#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 39#L140-1true assume !(0 != main_~p1~0); 5#L146-1true assume !(0 != main_~p2~0); 40#L151-1true assume !(0 != main_~p3~0); 47#L156-1true assume !(0 != main_~p4~0); 27#L161-1true assume !(0 != main_~p5~0); 33#L166-1true assume !(0 != main_~p6~0); 11#L171-1true assume !(0 != main_~p7~0); 18#L176-1true assume !(0 != main_~p8~0); 36#L181-1true assume !(0 != main_~p9~0); 17#L186-1true assume !(0 != main_~p10~0); 24#L191-1true assume !(0 != main_~p11~0); 54#L196-1true assume !(0 != main_~p12~0); 7#L201-1true assume !(0 != main_~p13~0); 42#L206-1true assume !(0 != main_~p14~0); 49#L211-1true [2020-10-20 06:47:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:12,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029373243] [2020-10-20 06:47:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2020-10-20 06:47:13,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245787323] [2020-10-20 06:47:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,145 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,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245787323] [2020-10-20 06:47:13,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842851238] [2020-10-20 06:47:13,154 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,171 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-10-20 06:47:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,232 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2020-10-20 06:47:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2020-10-20 06:47:13,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-20 06:47:13,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2020-10-20 06:47:13,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-20 06:47:13,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-20 06:47:13,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2020-10-20 06:47:13,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,254 INFO L691 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-20 06:47:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2020-10-20 06:47:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-20 06:47:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 06:47:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2020-10-20 06:47:13,294 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-20 06:47:13,295 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-20 06:47:13,295 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:13,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2020-10-20 06:47:13,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-20 06:47:13,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,300 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,300 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, 1, 1] [2020-10-20 06:47:13,300 INFO L794 eck$LassoCheckResult]: Stem: 206#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 184#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 185#L211-1 [2020-10-20 06:47:13,301 INFO L796 eck$LassoCheckResult]: Loop: 185#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 208#L55 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;main_~lk14~0 := 0; 209#L88 assume !(0 != main_~p1~0); 211#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 248#L92-1 assume !(0 != main_~p3~0); 247#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 246#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 245#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 244#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 243#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 242#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 241#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 240#L124-1 assume !(0 != main_~p11~0); 239#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 238#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 237#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 236#L140-1 assume !(0 != main_~p1~0); 235#L146-1 assume !(0 != main_~p2~0); 233#L151-1 assume !(0 != main_~p3~0); 231#L156-1 assume !(0 != main_~p4~0); 229#L161-1 assume !(0 != main_~p5~0); 227#L166-1 assume !(0 != main_~p6~0); 224#L171-1 assume !(0 != main_~p7~0); 200#L176-1 assume !(0 != main_~p8~0); 179#L181-1 assume !(0 != main_~p9~0); 180#L186-1 assume !(0 != main_~p10~0); 219#L191-1 assume !(0 != main_~p11~0); 217#L196-1 assume !(0 != main_~p12~0); 215#L201-1 assume !(0 != main_~p13~0); 213#L206-1 assume !(0 != main_~p14~0); 185#L211-1 [2020-10-20 06:47:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:13,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243794261] [2020-10-20 06:47:13,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,335 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2020-10-20 06:47:13,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717587201] [2020-10-20 06:47:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,376 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,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717587201] [2020-10-20 06:47:13,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278303534] [2020-10-20 06:47:13,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,379 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-10-20 06:47:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,414 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2020-10-20 06:47:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2020-10-20 06:47:13,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-20 06:47:13,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2020-10-20 06:47:13,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2020-10-20 06:47:13,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2020-10-20 06:47:13,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2020-10-20 06:47:13,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,425 INFO L691 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-20 06:47:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2020-10-20 06:47:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-20 06:47:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-20 06:47:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2020-10-20 06:47:13,440 INFO L714 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-20 06:47:13,440 INFO L594 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-20 06:47:13,440 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:13,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2020-10-20 06:47:13,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-20 06:47:13,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,444 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,445 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, 1, 1] [2020-10-20 06:47:13,445 INFO L794 eck$LassoCheckResult]: Stem: 477#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 452#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 453#L211-1 [2020-10-20 06:47:13,445 INFO L796 eck$LassoCheckResult]: Loop: 453#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 480#L55 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;main_~lk14~0 := 0; 481#L88 assume !(0 != main_~p1~0); 553#L88-2 assume !(0 != main_~p2~0); 551#L92-1 assume !(0 != main_~p3~0); 549#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 547#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 440#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 441#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 469#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 470#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 462#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 434#L124-1 assume !(0 != main_~p11~0); 435#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 476#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 486#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 520#L140-1 assume !(0 != main_~p1~0); 519#L146-1 assume !(0 != main_~p2~0); 459#L151-1 assume !(0 != main_~p3~0); 443#L156-1 assume !(0 != main_~p4~0); 464#L161-1 assume !(0 != main_~p5~0); 429#L166-1 assume !(0 != main_~p6~0); 430#L171-1 assume !(0 != main_~p7~0); 439#L176-1 assume !(0 != main_~p8~0); 461#L181-1 assume !(0 != main_~p9~0); 500#L186-1 assume !(0 != main_~p10~0); 495#L191-1 assume !(0 != main_~p11~0); 493#L196-1 assume !(0 != main_~p12~0); 491#L201-1 assume !(0 != main_~p13~0); 489#L206-1 assume !(0 != main_~p14~0); 453#L211-1 [2020-10-20 06:47:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,446 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:13,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299917933] [2020-10-20 06:47:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,460 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 L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2020-10-20 06:47:13,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543220459] [2020-10-20 06:47:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,563 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,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543220459] [2020-10-20 06:47:13,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462862429] [2020-10-20 06:47:13,564 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,565 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand 3 states. [2020-10-20 06:47:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,586 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2020-10-20 06:47:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2020-10-20 06:47:13,591 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-20 06:47:13,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2020-10-20 06:47:13,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2020-10-20 06:47:13,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2020-10-20 06:47:13,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2020-10-20 06:47:13,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,600 INFO L691 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-20 06:47:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2020-10-20 06:47:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2020-10-20 06:47:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-20 06:47:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2020-10-20 06:47:13,622 INFO L714 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-20 06:47:13,622 INFO L594 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-20 06:47:13,622 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:13,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2020-10-20 06:47:13,625 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-20 06:47:13,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,626 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,626 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, 1, 1] [2020-10-20 06:47:13,627 INFO L794 eck$LassoCheckResult]: Stem: 1001#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 974#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 975#L211-1 [2020-10-20 06:47:13,627 INFO L796 eck$LassoCheckResult]: Loop: 975#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1065#L55 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;main_~lk14~0 := 0; 1062#L88 assume !(0 != main_~p1~0); 1058#L88-2 assume !(0 != main_~p2~0); 1055#L92-1 assume !(0 != main_~p3~0); 1052#L96-1 assume !(0 != main_~p4~0); 1053#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1047#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1048#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1043#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1044#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1039#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1040#L124-1 assume !(0 != main_~p11~0); 1035#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1036#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1031#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1032#L140-1 assume !(0 != main_~p1~0); 1114#L146-1 assume !(0 != main_~p2~0); 1111#L151-1 assume !(0 != main_~p3~0); 1108#L156-1 assume !(0 != main_~p4~0); 1106#L161-1 assume !(0 != main_~p5~0); 1102#L166-1 assume !(0 != main_~p6~0); 1097#L171-1 assume !(0 != main_~p7~0); 1094#L176-1 assume !(0 != main_~p8~0); 1090#L181-1 assume !(0 != main_~p9~0); 1085#L186-1 assume !(0 != main_~p10~0); 1082#L191-1 assume !(0 != main_~p11~0); 1078#L196-1 assume !(0 != main_~p12~0); 1074#L201-1 assume !(0 != main_~p13~0); 1070#L206-1 assume !(0 != main_~p14~0); 975#L211-1 [2020-10-20 06:47:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:13,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087177406] [2020-10-20 06:47:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2020-10-20 06:47:13,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831568739] [2020-10-20 06:47:13,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,692 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,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831568739] [2020-10-20 06:47:13,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606765016] [2020-10-20 06:47:13,695 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,696 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-10-20 06:47:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,728 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2020-10-20 06:47:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2020-10-20 06:47:13,736 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-20 06:47:13,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2020-10-20 06:47:13,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2020-10-20 06:47:13,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2020-10-20 06:47:13,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2020-10-20 06:47:13,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,747 INFO L691 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-20 06:47:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2020-10-20 06:47:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-20 06:47:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-20 06:47:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2020-10-20 06:47:13,774 INFO L714 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-20 06:47:13,775 INFO L594 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-20 06:47:13,775 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:13,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2020-10-20 06:47:13,780 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-20 06:47:13,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,781 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, 1, 1] [2020-10-20 06:47:13,781 INFO L794 eck$LassoCheckResult]: Stem: 2023#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1996#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1997#L211-1 [2020-10-20 06:47:13,781 INFO L796 eck$LassoCheckResult]: Loop: 1997#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2114#L55 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;main_~lk14~0 := 0; 2110#L88 assume !(0 != main_~p1~0); 2108#L88-2 assume !(0 != main_~p2~0); 2106#L92-1 assume !(0 != main_~p3~0); 2102#L96-1 assume !(0 != main_~p4~0); 2098#L100-1 assume !(0 != main_~p5~0); 2096#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2094#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2092#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2090#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2088#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2086#L124-1 assume !(0 != main_~p11~0); 2084#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2082#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2080#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2076#L140-1 assume !(0 != main_~p1~0); 2074#L146-1 assume !(0 != main_~p2~0); 2068#L151-1 assume !(0 != main_~p3~0); 2067#L156-1 assume !(0 != main_~p4~0); 2153#L161-1 assume !(0 != main_~p5~0); 2150#L166-1 assume !(0 != main_~p6~0); 2145#L171-1 assume !(0 != main_~p7~0); 2142#L176-1 assume !(0 != main_~p8~0); 2138#L181-1 assume !(0 != main_~p9~0); 2133#L186-1 assume !(0 != main_~p10~0); 2130#L191-1 assume !(0 != main_~p11~0); 2126#L196-1 assume !(0 != main_~p12~0); 2122#L201-1 assume !(0 != main_~p13~0); 2118#L206-1 assume !(0 != main_~p14~0); 1997#L211-1 [2020-10-20 06:47:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:13,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807065871] [2020-10-20 06:47:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,829 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2020-10-20 06:47:13,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551533394] [2020-10-20 06:47:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,881 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,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551533394] [2020-10-20 06:47:13,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004285768] [2020-10-20 06:47:13,884 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,885 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand 3 states. [2020-10-20 06:47:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,914 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2020-10-20 06:47:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2020-10-20 06:47:13,929 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-20 06:47:13,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2020-10-20 06:47:13,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2020-10-20 06:47:13,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2020-10-20 06:47:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2020-10-20 06:47:13,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,967 INFO L691 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-20 06:47:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2020-10-20 06:47:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-10-20 06:47:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-20 06:47:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2020-10-20 06:47:13,998 INFO L714 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-20 06:47:13,999 INFO L594 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-20 06:47:13,999 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:13,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2020-10-20 06:47:14,008 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-20 06:47:14,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,011 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,012 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, 1, 1] [2020-10-20 06:47:14,012 INFO L794 eck$LassoCheckResult]: Stem: 4035#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4005#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 4006#L211-1 [2020-10-20 06:47:14,012 INFO L796 eck$LassoCheckResult]: Loop: 4006#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4189#L55 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;main_~lk14~0 := 0; 4190#L88 assume !(0 != main_~p1~0); 4306#L88-2 assume !(0 != main_~p2~0); 4352#L92-1 assume !(0 != main_~p3~0); 4297#L96-1 assume !(0 != main_~p4~0); 4299#L100-1 assume !(0 != main_~p5~0); 4364#L104-1 assume !(0 != main_~p6~0); 4363#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4362#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4361#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4360#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4359#L124-1 assume !(0 != main_~p11~0); 4358#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4357#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4356#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4354#L140-1 assume !(0 != main_~p1~0); 4327#L146-1 assume !(0 != main_~p2~0); 4325#L151-1 assume !(0 != main_~p3~0); 4253#L156-1 assume !(0 != main_~p4~0); 4255#L161-1 assume !(0 != main_~p5~0); 4320#L166-1 assume !(0 != main_~p6~0); 4238#L171-1 assume !(0 != main_~p7~0); 4234#L176-1 assume !(0 != main_~p8~0); 4233#L181-1 assume !(0 != main_~p9~0); 4220#L186-1 assume !(0 != main_~p10~0); 4221#L191-1 assume !(0 != main_~p11~0); 4211#L196-1 assume !(0 != main_~p12~0); 4210#L201-1 assume !(0 != main_~p13~0); 4199#L206-1 assume !(0 != main_~p14~0); 4006#L211-1 [2020-10-20 06:47:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:14,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280930054] [2020-10-20 06:47:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,061 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2020-10-20 06:47:14,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464795626] [2020-10-20 06:47:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,106 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,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464795626] [2020-10-20 06:47:14,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743204538] [2020-10-20 06:47:14,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,110 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand 3 states. [2020-10-20 06:47:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,135 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2020-10-20 06:47:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2020-10-20 06:47:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-20 06:47:14,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2020-10-20 06:47:14,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2020-10-20 06:47:14,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2020-10-20 06:47:14,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2020-10-20 06:47:14,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,199 INFO L691 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-20 06:47:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2020-10-20 06:47:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2020-10-20 06:47:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-10-20 06:47:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2020-10-20 06:47:14,253 INFO L714 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-20 06:47:14,253 INFO L594 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-20 06:47:14,253 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:14,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2020-10-20 06:47:14,284 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-20 06:47:14,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,285 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,285 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, 1, 1] [2020-10-20 06:47:14,286 INFO L794 eck$LassoCheckResult]: Stem: 7997#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7967#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7968#L211-1 [2020-10-20 06:47:14,286 INFO L796 eck$LassoCheckResult]: Loop: 7968#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8160#L55 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;main_~lk14~0 := 0; 8158#L88 assume !(0 != main_~p1~0); 8156#L88-2 assume !(0 != main_~p2~0); 8153#L92-1 assume !(0 != main_~p3~0); 8150#L96-1 assume !(0 != main_~p4~0); 8147#L100-1 assume !(0 != main_~p5~0); 8139#L104-1 assume !(0 != main_~p6~0); 8141#L108-1 assume !(0 != main_~p7~0); 8131#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8132#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8123#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8124#L124-1 assume !(0 != main_~p11~0); 8115#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8116#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8107#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8108#L140-1 assume !(0 != main_~p1~0); 8095#L146-1 assume !(0 != main_~p2~0); 8097#L151-1 assume !(0 != main_~p3~0); 8083#L156-1 assume !(0 != main_~p4~0); 8085#L161-1 assume !(0 != main_~p5~0); 8186#L166-1 assume !(0 != main_~p6~0); 8184#L171-1 assume !(0 != main_~p7~0); 8183#L176-1 assume !(0 != main_~p8~0); 8181#L181-1 assume !(0 != main_~p9~0); 8178#L186-1 assume !(0 != main_~p10~0); 8174#L191-1 assume !(0 != main_~p11~0); 8171#L196-1 assume !(0 != main_~p12~0); 8168#L201-1 assume !(0 != main_~p13~0); 8165#L206-1 assume !(0 != main_~p14~0); 7968#L211-1 [2020-10-20 06:47:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:14,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079922454] [2020-10-20 06:47:14,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,305 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2020-10-20 06:47:14,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660363940] [2020-10-20 06:47:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,326 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,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660363940] [2020-10-20 06:47:14,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185583040] [2020-10-20 06:47:14,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,328 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2020-10-20 06:47:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,367 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2020-10-20 06:47:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2020-10-20 06:47:14,442 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-20 06:47:14,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2020-10-20 06:47:14,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2020-10-20 06:47:14,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2020-10-20 06:47:14,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2020-10-20 06:47:14,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,507 INFO L691 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-20 06:47:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2020-10-20 06:47:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2020-10-20 06:47:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2020-10-20 06:47:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2020-10-20 06:47:14,878 INFO L714 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-20 06:47:14,878 INFO L594 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-20 06:47:14,878 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:14,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2020-10-20 06:47:14,914 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-20 06:47:14,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,916 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,916 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, 1, 1] [2020-10-20 06:47:14,916 INFO L794 eck$LassoCheckResult]: Stem: 15815#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15785#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15786#L211-1 [2020-10-20 06:47:14,916 INFO L796 eck$LassoCheckResult]: Loop: 15786#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 15907#L55 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;main_~lk14~0 := 0; 15904#L88 assume !(0 != main_~p1~0); 15900#L88-2 assume !(0 != main_~p2~0); 15897#L92-1 assume !(0 != main_~p3~0); 15894#L96-1 assume !(0 != main_~p4~0); 15890#L100-1 assume !(0 != main_~p5~0); 15891#L104-1 assume !(0 != main_~p6~0); 15980#L108-1 assume !(0 != main_~p7~0); 15976#L112-1 assume !(0 != main_~p8~0); 15974#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 15972#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15970#L124-1 assume !(0 != main_~p11~0); 15968#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15966#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15964#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 15960#L140-1 assume !(0 != main_~p1~0); 15956#L146-1 assume !(0 != main_~p2~0); 15953#L151-1 assume !(0 != main_~p3~0); 15948#L156-1 assume !(0 != main_~p4~0); 15946#L161-1 assume !(0 != main_~p5~0); 15943#L166-1 assume !(0 != main_~p6~0); 15939#L171-1 assume !(0 != main_~p7~0); 15935#L176-1 assume !(0 != main_~p8~0); 15932#L181-1 assume !(0 != main_~p9~0); 15927#L186-1 assume !(0 != main_~p10~0); 15924#L191-1 assume !(0 != main_~p11~0); 15920#L196-1 assume !(0 != main_~p12~0); 15916#L201-1 assume !(0 != main_~p13~0); 15912#L206-1 assume !(0 != main_~p14~0); 15786#L211-1 [2020-10-20 06:47:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:14,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153374411] [2020-10-20 06:47:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2020-10-20 06:47:14,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762918635] [2020-10-20 06:47:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,955 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,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762918635] [2020-10-20 06:47:14,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161691897] [2020-10-20 06:47:14,957 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,958 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2020-10-20 06:47:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,084 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2020-10-20 06:47:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2020-10-20 06:47:15,402 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-20 06:47:15,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2020-10-20 06:47:15,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2020-10-20 06:47:15,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2020-10-20 06:47:15,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2020-10-20 06:47:15,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,509 INFO L691 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-20 06:47:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2020-10-20 06:47:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2020-10-20 06:47:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10242 states. [2020-10-20 06:47:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2020-10-20 06:47:15,770 INFO L714 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-20 06:47:15,770 INFO L594 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-20 06:47:15,770 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:15,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2020-10-20 06:47:15,817 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-20 06:47:15,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,818 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,818 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, 1, 1] [2020-10-20 06:47:15,818 INFO L794 eck$LassoCheckResult]: Stem: 31249#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31218#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31219#L211-1 [2020-10-20 06:47:15,818 INFO L796 eck$LassoCheckResult]: Loop: 31219#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31390#L55 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;main_~lk14~0 := 0; 31387#L88 assume !(0 != main_~p1~0); 31383#L88-2 assume !(0 != main_~p2~0); 31380#L92-1 assume !(0 != main_~p3~0); 31377#L96-1 assume !(0 != main_~p4~0); 31370#L100-1 assume !(0 != main_~p5~0); 31309#L104-1 assume !(0 != main_~p6~0); 31310#L108-1 assume !(0 != main_~p7~0); 31491#L112-1 assume !(0 != main_~p8~0); 31489#L116-1 assume !(0 != main_~p9~0); 31478#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 31473#L124-1 assume !(0 != main_~p11~0); 31469#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31465#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31460#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31451#L140-1 assume !(0 != main_~p1~0); 31448#L146-1 assume !(0 != main_~p2~0); 31437#L151-1 assume !(0 != main_~p3~0); 31428#L156-1 assume !(0 != main_~p4~0); 31371#L161-1 assume !(0 != main_~p5~0); 31373#L166-1 assume !(0 != main_~p6~0); 31422#L171-1 assume !(0 != main_~p7~0); 31418#L176-1 assume !(0 != main_~p8~0); 31414#L181-1 assume !(0 != main_~p9~0); 31410#L186-1 assume !(0 != main_~p10~0); 31407#L191-1 assume !(0 != main_~p11~0); 31403#L196-1 assume !(0 != main_~p12~0); 31399#L201-1 assume !(0 != main_~p13~0); 31395#L206-1 assume !(0 != main_~p14~0); 31219#L211-1 [2020-10-20 06:47:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:15,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126071573] [2020-10-20 06:47:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2020-10-20 06:47:15,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113140666] [2020-10-20 06:47:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,937 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,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113140666] [2020-10-20 06:47:15,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063139272] [2020-10-20 06:47:15,939 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,941 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2020-10-20 06:47:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:16,021 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2020-10-20 06:47:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:16,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2020-10-20 06:47:16,555 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-20 06:47:16,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2020-10-20 06:47:16,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2020-10-20 06:47:16,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2020-10-20 06:47:16,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2020-10-20 06:47:16,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,715 INFO L691 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-20 06:47:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2020-10-20 06:47:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2020-10-20 06:47:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20226 states. [2020-10-20 06:47:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2020-10-20 06:47:17,765 INFO L714 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-20 06:47:17,765 INFO L594 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-20 06:47:17,766 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:17,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2020-10-20 06:47:17,822 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-20 06:47:17,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:17,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:17,824 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:17,824 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, 1, 1] [2020-10-20 06:47:17,826 INFO L794 eck$LassoCheckResult]: Stem: 61724#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61692#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61693#L211-1 [2020-10-20 06:47:17,826 INFO L796 eck$LassoCheckResult]: Loop: 61693#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 62130#L55 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;main_~lk14~0 := 0; 62127#L88 assume !(0 != main_~p1~0); 62123#L88-2 assume !(0 != main_~p2~0); 62120#L92-1 assume !(0 != main_~p3~0); 62117#L96-1 assume !(0 != main_~p4~0); 62110#L100-1 assume !(0 != main_~p5~0); 62111#L104-1 assume !(0 != main_~p6~0); 62065#L108-1 assume !(0 != main_~p7~0); 62067#L112-1 assume !(0 != main_~p8~0); 62196#L116-1 assume !(0 != main_~p9~0); 62193#L120-1 assume !(0 != main_~p10~0); 62191#L124-1 assume !(0 != main_~p11~0); 62189#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 62187#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 62183#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 62178#L140-1 assume !(0 != main_~p1~0); 62176#L146-1 assume !(0 != main_~p2~0); 62172#L151-1 assume !(0 != main_~p3~0); 62166#L156-1 assume !(0 != main_~p4~0); 62164#L161-1 assume !(0 != main_~p5~0); 62160#L166-1 assume !(0 != main_~p6~0); 62112#L171-1 assume !(0 != main_~p7~0); 62113#L176-1 assume !(0 != main_~p8~0); 62154#L181-1 assume !(0 != main_~p9~0); 62150#L186-1 assume !(0 != main_~p10~0); 62147#L191-1 assume !(0 != main_~p11~0); 62143#L196-1 assume !(0 != main_~p12~0); 62139#L201-1 assume !(0 != main_~p13~0); 62135#L206-1 assume !(0 != main_~p14~0); 61693#L211-1 [2020-10-20 06:47:17,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:17,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:17,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042847929] [2020-10-20 06:47:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:17,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:17,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:17,859 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2020-10-20 06:47:17,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:17,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967441793] [2020-10-20 06:47:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:17,890 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:17,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967441793] [2020-10-20 06:47:17,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:17,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:17,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898979929] [2020-10-20 06:47:17,892 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:17,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:17,893 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2020-10-20 06:47:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:18,275 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2020-10-20 06:47:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:18,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2020-10-20 06:47:18,561 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-20 06:47:18,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2020-10-20 06:47:18,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2020-10-20 06:47:18,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2020-10-20 06:47:18,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2020-10-20 06:47:19,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:19,386 INFO L691 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-20 06:47:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2020-10-20 06:47:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2020-10-20 06:47:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39938 states. [2020-10-20 06:47:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2020-10-20 06:47:20,981 INFO L714 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-20 06:47:20,981 INFO L594 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-20 06:47:20,981 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:47:20,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2020-10-20 06:47:21,508 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-20 06:47:21,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:21,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:21,510 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:21,510 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, 1, 1] [2020-10-20 06:47:21,510 INFO L794 eck$LassoCheckResult]: Stem: 121900#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121862#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121863#L211-1 [2020-10-20 06:47:21,511 INFO L796 eck$LassoCheckResult]: Loop: 121863#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122059#L55 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;main_~lk14~0 := 0; 122055#L88 assume !(0 != main_~p1~0); 122048#L88-2 assume !(0 != main_~p2~0); 122043#L92-1 assume !(0 != main_~p3~0); 122036#L96-1 assume !(0 != main_~p4~0); 122028#L100-1 assume !(0 != main_~p5~0); 122020#L104-1 assume !(0 != main_~p6~0); 122012#L108-1 assume !(0 != main_~p7~0); 122004#L112-1 assume !(0 != main_~p8~0); 121996#L116-1 assume !(0 != main_~p9~0); 121988#L120-1 assume !(0 != main_~p10~0); 121983#L124-1 assume !(0 != main_~p11~0); 121978#L128-1 assume !(0 != main_~p12~0); 121972#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 121973#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 121964#L140-1 assume !(0 != main_~p1~0); 121966#L146-1 assume !(0 != main_~p2~0); 122148#L151-1 assume !(0 != main_~p3~0); 122143#L156-1 assume !(0 != main_~p4~0); 122109#L161-1 assume !(0 != main_~p5~0); 122101#L166-1 assume !(0 != main_~p6~0); 122094#L171-1 assume !(0 != main_~p7~0); 122090#L176-1 assume !(0 != main_~p8~0); 122088#L181-1 assume !(0 != main_~p9~0); 122084#L186-1 assume !(0 != main_~p10~0); 122083#L191-1 assume !(0 != main_~p11~0); 122081#L196-1 assume !(0 != main_~p12~0); 122080#L201-1 assume !(0 != main_~p13~0); 122068#L206-1 assume !(0 != main_~p14~0); 121863#L211-1 [2020-10-20 06:47:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-20 06:47:21,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135829462] [2020-10-20 06:47:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:21,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:21,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2020-10-20 06:47:21,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:21,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518787912] [2020-10-20 06:47:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:21,544 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:21,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518787912] [2020-10-20 06:47:21,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:21,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:21,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890536315] [2020-10-20 06:47:21,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:21,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:21,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:21,547 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2020-10-20 06:47:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:21,820 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2020-10-20 06:47:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:21,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2020-10-20 06:47:22,376 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2020-10-20 06:47:22,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2020-10-20 06:47:22,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2020-10-20 06:47:22,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2020-10-20 06:47:22,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2020-10-20 06:47:23,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:23,007 INFO L691 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-20 06:47:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2020-10-20 06:47:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2020-10-20 06:47:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78850 states. [2020-10-20 06:47:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2020-10-20 06:47:27,918 INFO L714 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-20 06:47:27,919 INFO L594 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-20 06:47:27,919 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:47:27,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2020-10-20 06:47:28,367 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2020-10-20 06:47:28,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:28,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:28,374 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:28,374 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, 1, 1] [2020-10-20 06:47:28,374 INFO L794 eck$LassoCheckResult]: Stem: 240693#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 240655#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 240656#L211-1 [2020-10-20 06:47:28,376 INFO L796 eck$LassoCheckResult]: Loop: 240656#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 240912#L55 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;main_~lk14~0 := 0; 240907#L88 assume !(0 != main_~p1~0); 240901#L88-2 assume !(0 != main_~p2~0); 240897#L92-1 assume !(0 != main_~p3~0); 240892#L96-1 assume !(0 != main_~p4~0); 240885#L100-1 assume !(0 != main_~p5~0); 240883#L104-1 assume !(0 != main_~p6~0); 240881#L108-1 assume !(0 != main_~p7~0); 240879#L112-1 assume !(0 != main_~p8~0); 240876#L116-1 assume !(0 != main_~p9~0); 240873#L120-1 assume !(0 != main_~p10~0); 240777#L124-1 assume !(0 != main_~p11~0); 240773#L128-1 assume !(0 != main_~p12~0); 240762#L132-1 assume !(0 != main_~p13~0); 240763#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 240752#L140-1 assume !(0 != main_~p1~0); 240754#L146-1 assume !(0 != main_~p2~0); 241013#L151-1 assume !(0 != main_~p3~0); 241010#L156-1 assume !(0 != main_~p4~0); 241008#L161-1 assume !(0 != main_~p5~0); 241005#L166-1 assume !(0 != main_~p6~0); 241001#L171-1 assume !(0 != main_~p7~0); 240997#L176-1 assume !(0 != main_~p8~0); 240938#L181-1 assume !(0 != main_~p9~0); 240934#L186-1 assume !(0 != main_~p10~0); 240925#L191-1 assume !(0 != main_~p11~0); 240922#L196-1 assume !(0 != main_~p12~0); 240920#L201-1 assume !(0 != main_~p13~0); 240918#L206-1 assume !(0 != main_~p14~0); 240656#L211-1 [2020-10-20 06:47:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-10-20 06:47:28,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:28,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261620516] [2020-10-20 06:47:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,399 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:28,400 INFO L82 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2020-10-20 06:47:28,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:28,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247721064] [2020-10-20 06:47:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:28,435 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:28,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247721064] [2020-10-20 06:47:28,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:28,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:28,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739395119] [2020-10-20 06:47:28,436 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:28,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:28,437 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2020-10-20 06:47:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:30,129 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2020-10-20 06:47:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:30,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2020-10-20 06:47:33,172 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2020-10-20 06:47:33,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2020-10-20 06:47:33,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2020-10-20 06:47:33,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2020-10-20 06:47:33,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2020-10-20 06:47:33,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:33,772 INFO L691 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-20 06:47:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2020-10-20 06:47:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2020-10-20 06:47:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155650 states. [2020-10-20 06:47:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2020-10-20 06:47:40,431 INFO L714 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-20 06:47:40,431 INFO L594 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-20 06:47:40,431 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:47:40,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2020-10-20 06:47:42,529 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2020-10-20 06:47:42,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:42,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:42,531 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:42,531 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, 1, 1] [2020-10-20 06:47:42,532 INFO L794 eck$LassoCheckResult]: Stem: 475196#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 475161#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_#t~nondet21, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 475162#L211-1 [2020-10-20 06:47:42,532 INFO L796 eck$LassoCheckResult]: Loop: 475162#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 476638#L55 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;main_~lk14~0 := 0; 476628#L88 assume !(0 != main_~p1~0); 476630#L88-2 assume !(0 != main_~p2~0); 476771#L92-1 assume !(0 != main_~p3~0); 476770#L96-1 assume !(0 != main_~p4~0); 476764#L100-1 assume !(0 != main_~p5~0); 476756#L104-1 assume !(0 != main_~p6~0); 476750#L108-1 assume !(0 != main_~p7~0); 476746#L112-1 assume !(0 != main_~p8~0); 476742#L116-1 assume !(0 != main_~p9~0); 476735#L120-1 assume !(0 != main_~p10~0); 476737#L124-1 assume !(0 != main_~p11~0); 476726#L128-1 assume !(0 != main_~p12~0); 476728#L132-1 assume !(0 != main_~p13~0); 476717#L136-1 assume !(0 != main_~p14~0); 476719#L140-1 assume !(0 != main_~p1~0); 476705#L146-1 assume !(0 != main_~p2~0); 476707#L151-1 assume !(0 != main_~p3~0); 476695#L156-1 assume !(0 != main_~p4~0); 476696#L161-1 assume !(0 != main_~p5~0); 476685#L166-1 assume !(0 != main_~p6~0); 476686#L171-1 assume !(0 != main_~p7~0); 476674#L176-1 assume !(0 != main_~p8~0); 476676#L181-1 assume !(0 != main_~p9~0); 476797#L186-1 assume !(0 != main_~p10~0); 476795#L191-1 assume !(0 != main_~p11~0); 476792#L196-1 assume !(0 != main_~p12~0); 476790#L201-1 assume !(0 != main_~p13~0); 476789#L206-1 assume !(0 != main_~p14~0); 475162#L211-1 [2020-10-20 06:47:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2020-10-20 06:47:42,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:42,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835224126] [2020-10-20 06:47:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,580 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2020-10-20 06:47:42,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:42,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987857028] [2020-10-20 06:47:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,597 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2020-10-20 06:47:42,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:42,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254486081] [2020-10-20 06:47:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:42,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:42,622 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:42,739 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-20 06:47:43,120 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2020-10-20 06:47:43,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:43 BoogieIcfgContainer [2020-10-20 06:47:43,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:43,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:43,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:43,268 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:43,276 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:43,280 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:43,389 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:43,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:43,391 INFO L168 Benchmark]: Toolchain (without parser) took 31622.95 ms. Allocated memory was 42.5 MB in the beginning and 434.6 MB in the end (delta: 392.2 MB). Free memory was 22.8 MB in the beginning and 102.3 MB in the end (delta: -79.5 MB). Peak memory consumption was 312.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,392 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 32.0 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.88 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 21.8 MB in the beginning and 22.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 43.0 MB. Free memory was 22.9 MB in the beginning and 21.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,393 INFO L168 Benchmark]: Boogie Preprocessor took 31.40 ms. Allocated memory is still 43.0 MB. Free memory was 21.0 MB in the beginning and 19.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,394 INFO L168 Benchmark]: RCFGBuilder took 442.22 ms. Allocated memory was 43.0 MB in the beginning and 46.1 MB in the end (delta: 3.1 MB). Free memory was 19.2 MB in the beginning and 14.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,395 INFO L168 Benchmark]: BuchiAutomizer took 30570.79 ms. Allocated memory was 46.1 MB in the beginning and 434.6 MB in the end (delta: 388.5 MB). Free memory was 14.3 MB in the beginning and 105.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 313.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,395 INFO L168 Benchmark]: Witness Printer took 121.43 ms. Allocated memory is still 434.6 MB. Free memory was 105.9 MB in the beginning and 102.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:43,398 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 32.0 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 392.88 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 21.8 MB in the beginning and 22.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 43.0 MB. Free memory was 22.9 MB in the beginning and 21.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.40 ms. Allocated memory is still 43.0 MB. Free memory was 21.0 MB in the beginning and 19.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 442.22 ms. Allocated memory was 43.0 MB in the beginning and 46.1 MB in the end (delta: 3.1 MB). Free memory was 19.2 MB in the beginning and 14.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 30570.79 ms. Allocated memory was 46.1 MB in the beginning and 434.6 MB in the end (delta: 388.5 MB). Free memory was 14.3 MB in the beginning and 105.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 313.4 MB. Max. memory is 14.3 GB. * Witness Printer took 121.43 ms. Allocated memory is still 434.6 MB. Free memory was 105.9 MB in the beginning and 102.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.4s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.4s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 15.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 5.9s Buchi closure took 0.2s. Biggest automaton had 155650 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1324 SDtfs, 690 SDslu, 833 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1184} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=1184, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1776ccff=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@201efcaa=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e82c3a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d75071f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e3b4767=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38721202=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1285bb9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f8998e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26c8bcba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71e4ef65=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=1185, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19b5cd46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bbf22d9=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5428280c=0, lk13=0, p13=0, p11=0, lk11=0, cond=11, NULL=1187, NULL=0, NULL=1186, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60351927=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45dda7c1=11, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...