./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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_10.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 0f7b0b589689413087c164ce10eb80c902ee4046 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-8bd4bc6 [2020-07-29 01:44:37,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:44:37,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:44:37,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:44:37,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:44:37,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:44:37,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:44:37,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:44:37,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:44:37,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:44:37,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:44:37,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:44:37,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:44:37,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:44:37,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:44:37,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:44:37,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:44:37,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:44:37,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:44:37,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:44:37,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:44:37,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:44:37,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:44:37,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:44:37,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:44:37,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:44:37,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:44:37,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:44:37,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:44:37,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:44:37,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:44:37,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:44:37,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:44:37,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:44:37,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:44:37,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:44:37,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:44:37,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:44:37,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:44:37,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:44:37,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:44:37,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:44:37,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:44:37,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:44:37,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:44:37,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:44:37,718 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:44:37,718 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:44:37,719 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:44:37,719 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:44:37,719 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:44:37,720 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:44:37,720 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:44:37,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:44:37,721 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:44:37,721 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:44:37,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:44:37,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:44:37,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:44:37,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:44:37,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:44:37,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:44:37,723 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:44:37,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:44:37,724 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:44:37,724 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:44:37,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:44:37,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:44:37,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:44:37,725 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:44:37,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:44:37,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:44:37,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:44:37,726 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:44:37,728 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:44:37,728 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2020-07-29 01:44:38,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:44:38,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:44:38,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:44:38,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:44:38,098 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:44:38,100 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2020-07-29 01:44:38,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3315821/a99bc7debae749138b2e3c856bc499b4/FLAGab0972583 [2020-07-29 01:44:38,666 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:44:38,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2020-07-29 01:44:38,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3315821/a99bc7debae749138b2e3c856bc499b4/FLAGab0972583 [2020-07-29 01:44:39,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3315821/a99bc7debae749138b2e3c856bc499b4 [2020-07-29 01:44:39,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:44:39,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:44:39,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:44:39,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:44:39,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:44:39,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430d4a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39, skipping insertion in model container [2020-07-29 01:44:39,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:44:39,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:44:39,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:44:39,282 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:44:39,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:44:39,325 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:44:39,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39 WrapperNode [2020-07-29 01:44:39,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:44:39,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:44:39,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:44:39,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:44:39,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:44:39,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:44:39,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:44:39,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:44:39,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (1/1) ... [2020-07-29 01:44:39,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:44:39,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:44:39,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:44:39,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:44:39,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (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-07-29 01:44:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:44:39,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:44:39,985 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:44:39,985 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:44:39,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:44:39 BoogieIcfgContainer [2020-07-29 01:44:39,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:44:39,990 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:44:39,991 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:44:39,995 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:44:39,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:44:39" (1/3) ... [2020-07-29 01:44:39,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@219326e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:44:39, skipping insertion in model container [2020-07-29 01:44:39,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:39" (2/3) ... [2020-07-29 01:44:39,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@219326e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:44:39, skipping insertion in model container [2020-07-29 01:44:39,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:44:39" (3/3) ... [2020-07-29 01:44:40,001 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2020-07-29 01:44:40,062 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:44:40,063 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:44:40,063 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:44:40,064 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:44:40,064 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:44:40,065 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:44:40,065 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:44:40,065 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:44:40,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2020-07-29 01:44:40,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-07-29 01:44:40,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,121 INFO L850 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] [2020-07-29 01:44:40,121 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:44:40,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2020-07-29 01:44:40,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-07-29 01:44:40,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,130 INFO L850 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] [2020-07-29 01:44:40,138 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 17#L153-1true [2020-07-29 01:44:40,140 INFO L796 eck$LassoCheckResult]: Loop: 17#L153-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 26#L41true 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; 37#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 22#L70-1true assume !(0 != main_~p3~0); 27#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 31#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 39#L90-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 11#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 34#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 9#L118-1true assume !(0 != main_~p4~0); 20#L123-1true assume !(0 != main_~p5~0); 30#L128-1true assume !(0 != main_~p6~0); 19#L133-1true assume !(0 != main_~p7~0); 28#L138-1true assume !(0 != main_~p8~0); 38#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 17#L153-1true [2020-07-29 01:44:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:44:40,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927976468] [2020-07-29 01:44:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times [2020-07-29 01:44:40,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123147119] [2020-07-29 01:44:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:40,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {44#true} is VALID [2020-07-29 01:44:40,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} 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; {44#true} is VALID [2020-07-29 01:44:40,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 != main_~p1~0;main_~lk1~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p2~0;main_~lk2~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p3~0); {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,401 INFO L280 TraceCheckUtils]: 11: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {46#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {46#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p1~0); {45#false} is VALID [2020-07-29 01:44:40,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#false} assume !(0 != main_~p2~0); {45#false} is VALID [2020-07-29 01:44:40,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#false} assume !(0 != main_~p3~0); {45#false} is VALID [2020-07-29 01:44:40,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#false} assume !(0 != main_~p4~0); {45#false} is VALID [2020-07-29 01:44:40,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#false} assume !(0 != main_~p5~0); {45#false} is VALID [2020-07-29 01:44:40,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {45#false} assume !(0 != main_~p6~0); {45#false} is VALID [2020-07-29 01:44:40,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {45#false} assume !(0 != main_~p7~0); {45#false} is VALID [2020-07-29 01:44:40,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#false} assume !(0 != main_~p8~0); {45#false} is VALID [2020-07-29 01:44:40,404 INFO L280 TraceCheckUtils]: 20: Hoare triple {45#false} assume !(0 != main_~p9~0); {45#false} is VALID [2020-07-29 01:44:40,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {45#false} assume !(0 != main_~p10~0); {45#false} is VALID [2020-07-29 01:44:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:40,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123147119] [2020-07-29 01:44:40,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:40,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:40,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928843304] [2020-07-29 01:44:40,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:40,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:40,438 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-29 01:44:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,668 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2020-07-29 01:44:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:40,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:40,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:40,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 129 transitions. [2020-07-29 01:44:40,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-07-29 01:44:40,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 64 states and 102 transitions. [2020-07-29 01:44:40,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2020-07-29 01:44:40,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2020-07-29 01:44:40,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 102 transitions. [2020-07-29 01:44:40,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:40,733 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2020-07-29 01:44:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 102 transitions. [2020-07-29 01:44:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-29 01:44:40,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:40,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states and 102 transitions. Second operand 64 states. [2020-07-29 01:44:40,767 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states and 102 transitions. Second operand 64 states. [2020-07-29 01:44:40,769 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. Second operand 64 states. [2020-07-29 01:44:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,774 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2020-07-29 01:44:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 102 transitions. [2020-07-29 01:44:40,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:40,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:40,777 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states and 102 transitions. [2020-07-29 01:44:40,777 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states and 102 transitions. [2020-07-29 01:44:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,782 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2020-07-29 01:44:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 102 transitions. [2020-07-29 01:44:40,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:40,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:40,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:40,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-29 01:44:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 102 transitions. [2020-07-29 01:44:40,790 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2020-07-29 01:44:40,790 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2020-07-29 01:44:40,790 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:44:40,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 102 transitions. [2020-07-29 01:44:40,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2020-07-29 01:44:40,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,794 INFO L850 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] [2020-07-29 01:44:40,794 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 155#L153-1 [2020-07-29 01:44:40,795 INFO L796 eck$LassoCheckResult]: Loop: 155#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 161#L41 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; 160#L66 assume !(0 != main_~p1~0); 156#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 147#L70-1 assume !(0 != main_~p3~0); 148#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 128#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 129#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 153#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 136#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 137#L102-1 assume !(0 != main_~p1~0); 159#L108-1 assume !(0 != main_~p2~0); 183#L113-1 assume !(0 != main_~p3~0); 181#L118-1 assume !(0 != main_~p4~0); 146#L123-1 assume !(0 != main_~p5~0); 139#L128-1 assume !(0 != main_~p6~0); 143#L133-1 assume !(0 != main_~p7~0); 145#L138-1 assume !(0 != main_~p8~0); 127#L143-1 assume !(0 != main_~p9~0); 163#L148-1 assume !(0 != main_~p10~0); 155#L153-1 [2020-07-29 01:44:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:44:40,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105132537] [2020-07-29 01:44:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times [2020-07-29 01:44:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756332816] [2020-07-29 01:44:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:40,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {318#true} is VALID [2020-07-29 01:44:40,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#true} 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; {318#true} is VALID [2020-07-29 01:44:40,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {318#true} assume !(0 != main_~p1~0); {318#true} is VALID [2020-07-29 01:44:40,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {318#true} assume 0 != main_~p2~0;main_~lk2~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p3~0); {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,876 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,878 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,879 INFO L280 TraceCheckUtils]: 10: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p1~0); {320#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {320#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p2~0); {319#false} is VALID [2020-07-29 01:44:40,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {319#false} assume !(0 != main_~p3~0); {319#false} is VALID [2020-07-29 01:44:40,883 INFO L280 TraceCheckUtils]: 15: Hoare triple {319#false} assume !(0 != main_~p4~0); {319#false} is VALID [2020-07-29 01:44:40,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {319#false} assume !(0 != main_~p5~0); {319#false} is VALID [2020-07-29 01:44:40,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {319#false} assume !(0 != main_~p6~0); {319#false} is VALID [2020-07-29 01:44:40,884 INFO L280 TraceCheckUtils]: 18: Hoare triple {319#false} assume !(0 != main_~p7~0); {319#false} is VALID [2020-07-29 01:44:40,885 INFO L280 TraceCheckUtils]: 19: Hoare triple {319#false} assume !(0 != main_~p8~0); {319#false} is VALID [2020-07-29 01:44:40,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {319#false} assume !(0 != main_~p9~0); {319#false} is VALID [2020-07-29 01:44:40,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {319#false} assume !(0 != main_~p10~0); {319#false} is VALID [2020-07-29 01:44:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:40,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756332816] [2020-07-29 01:44:40,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:40,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268349471] [2020-07-29 01:44:40,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:40,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:40,891 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. cyclomatic complexity: 40 Second operand 3 states. [2020-07-29 01:44:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,027 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2020-07-29 01:44:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-07-29 01:44:41,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 197 transitions. [2020-07-29 01:44:41,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2020-07-29 01:44:41,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2020-07-29 01:44:41,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,079 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2020-07-29 01:44:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-07-29 01:44:41,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states and 197 transitions. Second operand 125 states. [2020-07-29 01:44:41,090 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states and 197 transitions. Second operand 125 states. [2020-07-29 01:44:41,090 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. Second operand 125 states. [2020-07-29 01:44:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,097 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2020-07-29 01:44:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,099 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 125 states and 197 transitions. [2020-07-29 01:44:41,099 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 125 states and 197 transitions. [2020-07-29 01:44:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,106 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2020-07-29 01:44:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-29 01:44:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2020-07-29 01:44:41,115 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2020-07-29 01:44:41,116 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2020-07-29 01:44:41,116 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:44:41,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 197 transitions. [2020-07-29 01:44:41,118 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2020-07-29 01:44:41,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,119 INFO L850 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] [2020-07-29 01:44:41,120 INFO L794 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 482#L153-1 [2020-07-29 01:44:41,120 INFO L796 eck$LassoCheckResult]: Loop: 482#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 488#L41 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; 489#L66 assume !(0 != main_~p1~0); 514#L66-2 assume !(0 != main_~p2~0); 569#L70-1 assume !(0 != main_~p3~0); 567#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 565#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 563#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 561#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 559#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 557#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 556#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 554#L102-1 assume !(0 != main_~p1~0); 555#L108-1 assume !(0 != main_~p2~0); 448#L113-1 assume !(0 != main_~p3~0); 450#L118-1 assume !(0 != main_~p4~0); 456#L123-1 assume !(0 != main_~p5~0); 464#L128-1 assume !(0 != main_~p6~0); 469#L133-1 assume !(0 != main_~p7~0); 471#L138-1 assume !(0 != main_~p8~0); 497#L143-1 assume !(0 != main_~p9~0); 491#L148-1 assume !(0 != main_~p10~0); 482#L153-1 [2020-07-29 01:44:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:44:41,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983540315] [2020-07-29 01:44:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,135 INFO L82 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times [2020-07-29 01:44:41,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479884625] [2020-07-29 01:44:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:41,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {826#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {826#true} is VALID [2020-07-29 01:44:41,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {826#true} 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; {826#true} is VALID [2020-07-29 01:44:41,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {826#true} assume !(0 != main_~p1~0); {826#true} is VALID [2020-07-29 01:44:41,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {826#true} assume !(0 != main_~p2~0); {826#true} is VALID [2020-07-29 01:44:41,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {826#true} assume !(0 != main_~p3~0); {826#true} is VALID [2020-07-29 01:44:41,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {826#true} assume 0 != main_~p4~0;main_~lk4~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,211 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,212 INFO L280 TraceCheckUtils]: 8: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,214 INFO L280 TraceCheckUtils]: 10: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,215 INFO L280 TraceCheckUtils]: 11: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,215 INFO L280 TraceCheckUtils]: 12: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p1~0); {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p2~0); {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,217 INFO L280 TraceCheckUtils]: 14: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p3~0); {828#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,218 INFO L280 TraceCheckUtils]: 15: Hoare triple {828#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p4~0); {827#false} is VALID [2020-07-29 01:44:41,218 INFO L280 TraceCheckUtils]: 16: Hoare triple {827#false} assume !(0 != main_~p5~0); {827#false} is VALID [2020-07-29 01:44:41,219 INFO L280 TraceCheckUtils]: 17: Hoare triple {827#false} assume !(0 != main_~p6~0); {827#false} is VALID [2020-07-29 01:44:41,219 INFO L280 TraceCheckUtils]: 18: Hoare triple {827#false} assume !(0 != main_~p7~0); {827#false} is VALID [2020-07-29 01:44:41,220 INFO L280 TraceCheckUtils]: 19: Hoare triple {827#false} assume !(0 != main_~p8~0); {827#false} is VALID [2020-07-29 01:44:41,220 INFO L280 TraceCheckUtils]: 20: Hoare triple {827#false} assume !(0 != main_~p9~0); {827#false} is VALID [2020-07-29 01:44:41,220 INFO L280 TraceCheckUtils]: 21: Hoare triple {827#false} assume !(0 != main_~p10~0); {827#false} is VALID [2020-07-29 01:44:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:41,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479884625] [2020-07-29 01:44:41,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:41,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:41,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879257388] [2020-07-29 01:44:41,224 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:41,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:41,225 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. cyclomatic complexity: 76 Second operand 3 states. [2020-07-29 01:44:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,355 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2020-07-29 01:44:41,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,404 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-07-29 01:44:41,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 381 transitions. [2020-07-29 01:44:41,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2020-07-29 01:44:41,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2020-07-29 01:44:41,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,423 INFO L688 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2020-07-29 01:44:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2020-07-29 01:44:41,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states and 381 transitions. Second operand 245 states. [2020-07-29 01:44:41,438 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states and 381 transitions. Second operand 245 states. [2020-07-29 01:44:41,439 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. Second operand 245 states. [2020-07-29 01:44:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,453 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2020-07-29 01:44:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,455 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 245 states and 381 transitions. [2020-07-29 01:44:41,455 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 245 states and 381 transitions. [2020-07-29 01:44:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,470 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2020-07-29 01:44:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-07-29 01:44:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2020-07-29 01:44:41,487 INFO L711 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2020-07-29 01:44:41,487 INFO L591 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2020-07-29 01:44:41,487 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:44:41,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 381 transitions. [2020-07-29 01:44:41,490 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2020-07-29 01:44:41,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,491 INFO L850 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] [2020-07-29 01:44:41,492 INFO L794 eck$LassoCheckResult]: Stem: 1110#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 1111#L153-1 [2020-07-29 01:44:41,492 INFO L796 eck$LassoCheckResult]: Loop: 1111#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1150#L41 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; 1146#L66 assume !(0 != main_~p1~0); 1140#L66-2 assume !(0 != main_~p2~0); 1133#L70-1 assume !(0 != main_~p3~0); 1134#L74-1 assume !(0 != main_~p4~0); 1208#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1206#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1204#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1202#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1200#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1198#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1195#L102-1 assume !(0 != main_~p1~0); 1191#L108-1 assume !(0 != main_~p2~0); 1188#L113-1 assume !(0 != main_~p3~0); 1184#L118-1 assume !(0 != main_~p4~0); 1181#L123-1 assume !(0 != main_~p5~0); 1179#L128-1 assume !(0 != main_~p6~0); 1175#L133-1 assume !(0 != main_~p7~0); 1171#L138-1 assume !(0 != main_~p8~0); 1167#L143-1 assume !(0 != main_~p9~0); 1163#L148-1 assume !(0 != main_~p10~0); 1111#L153-1 [2020-07-29 01:44:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-07-29 01:44:41,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198685554] [2020-07-29 01:44:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,505 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times [2020-07-29 01:44:41,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025879448] [2020-07-29 01:44:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:41,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {1814#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {1814#true} is VALID [2020-07-29 01:44:41,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {1814#true} 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; {1814#true} is VALID [2020-07-29 01:44:41,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1814#true} assume !(0 != main_~p1~0); {1814#true} is VALID [2020-07-29 01:44:41,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {1814#true} assume !(0 != main_~p2~0); {1814#true} is VALID [2020-07-29 01:44:41,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {1814#true} assume !(0 != main_~p3~0); {1814#true} is VALID [2020-07-29 01:44:41,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {1814#true} assume !(0 != main_~p4~0); {1814#true} is VALID [2020-07-29 01:44:41,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {1814#true} assume 0 != main_~p5~0;main_~lk5~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p1~0); {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p2~0); {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p3~0); {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p4~0); {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {1816#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p5~0); {1815#false} is VALID [2020-07-29 01:44:41,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {1815#false} assume !(0 != main_~p6~0); {1815#false} is VALID [2020-07-29 01:44:41,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {1815#false} assume !(0 != main_~p7~0); {1815#false} is VALID [2020-07-29 01:44:41,588 INFO L280 TraceCheckUtils]: 19: Hoare triple {1815#false} assume !(0 != main_~p8~0); {1815#false} is VALID [2020-07-29 01:44:41,589 INFO L280 TraceCheckUtils]: 20: Hoare triple {1815#false} assume !(0 != main_~p9~0); {1815#false} is VALID [2020-07-29 01:44:41,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {1815#false} assume !(0 != main_~p10~0); {1815#false} is VALID [2020-07-29 01:44:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:41,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025879448] [2020-07-29 01:44:41,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:41,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:41,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346326734] [2020-07-29 01:44:41,592 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:41,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:41,595 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. cyclomatic complexity: 144 Second operand 3 states. [2020-07-29 01:44:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,745 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2020-07-29 01:44:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,814 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-07-29 01:44:41,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 737 transitions. [2020-07-29 01:44:41,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2020-07-29 01:44:41,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2020-07-29 01:44:41,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,848 INFO L688 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2020-07-29 01:44:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2020-07-29 01:44:41,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states and 737 transitions. Second operand 481 states. [2020-07-29 01:44:41,882 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states and 737 transitions. Second operand 481 states. [2020-07-29 01:44:41,885 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. Second operand 481 states. [2020-07-29 01:44:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,931 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2020-07-29 01:44:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,934 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand 481 states and 737 transitions. [2020-07-29 01:44:41,934 INFO L87 Difference]: Start difference. First operand 481 states. Second operand 481 states and 737 transitions. [2020-07-29 01:44:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,969 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2020-07-29 01:44:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-07-29 01:44:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2020-07-29 01:44:41,989 INFO L711 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2020-07-29 01:44:41,989 INFO L591 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2020-07-29 01:44:41,989 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:44:41,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 737 transitions. [2020-07-29 01:44:41,993 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2020-07-29 01:44:41,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,995 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,995 INFO L850 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] [2020-07-29 01:44:41,995 INFO L794 eck$LassoCheckResult]: Stem: 2336#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 2337#L153-1 [2020-07-29 01:44:41,996 INFO L796 eck$LassoCheckResult]: Loop: 2337#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 2509#L41 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; 2506#L66 assume !(0 != main_~p1~0); 2504#L66-2 assume !(0 != main_~p2~0); 2498#L70-1 assume !(0 != main_~p3~0); 2497#L74-1 assume !(0 != main_~p4~0); 2496#L78-1 assume !(0 != main_~p5~0); 2495#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2494#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2493#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2492#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2491#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2489#L102-1 assume !(0 != main_~p1~0); 2488#L108-1 assume !(0 != main_~p2~0); 2435#L113-1 assume !(0 != main_~p3~0); 2434#L118-1 assume !(0 != main_~p4~0); 2481#L123-1 assume !(0 != main_~p5~0); 2569#L128-1 assume !(0 != main_~p6~0); 2535#L133-1 assume !(0 != main_~p7~0); 2531#L138-1 assume !(0 != main_~p8~0); 2526#L143-1 assume !(0 != main_~p9~0); 2513#L148-1 assume !(0 != main_~p10~0); 2337#L153-1 [2020-07-29 01:44:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-07-29 01:44:41,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456180091] [2020-07-29 01:44:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times [2020-07-29 01:44:42,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:42,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277417199] [2020-07-29 01:44:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:42,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {3746#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {3746#true} is VALID [2020-07-29 01:44:42,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {3746#true} 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; {3746#true} is VALID [2020-07-29 01:44:42,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {3746#true} assume !(0 != main_~p1~0); {3746#true} is VALID [2020-07-29 01:44:42,044 INFO L280 TraceCheckUtils]: 3: Hoare triple {3746#true} assume !(0 != main_~p2~0); {3746#true} is VALID [2020-07-29 01:44:42,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {3746#true} assume !(0 != main_~p3~0); {3746#true} is VALID [2020-07-29 01:44:42,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {3746#true} assume !(0 != main_~p4~0); {3746#true} is VALID [2020-07-29 01:44:42,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {3746#true} assume !(0 != main_~p5~0); {3746#true} is VALID [2020-07-29 01:44:42,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {3746#true} assume 0 != main_~p6~0;main_~lk6~0 := 1; {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,049 INFO L280 TraceCheckUtils]: 10: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,050 INFO L280 TraceCheckUtils]: 11: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p1~0); {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p2~0); {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p3~0); {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p4~0); {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p5~0); {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:42,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {3748#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p6~0); {3747#false} is VALID [2020-07-29 01:44:42,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {3747#false} assume !(0 != main_~p7~0); {3747#false} is VALID [2020-07-29 01:44:42,056 INFO L280 TraceCheckUtils]: 19: Hoare triple {3747#false} assume !(0 != main_~p8~0); {3747#false} is VALID [2020-07-29 01:44:42,057 INFO L280 TraceCheckUtils]: 20: Hoare triple {3747#false} assume !(0 != main_~p9~0); {3747#false} is VALID [2020-07-29 01:44:42,057 INFO L280 TraceCheckUtils]: 21: Hoare triple {3747#false} assume !(0 != main_~p10~0); {3747#false} is VALID [2020-07-29 01:44:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:42,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277417199] [2020-07-29 01:44:42,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:42,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158055902] [2020-07-29 01:44:42,060 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:42,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:42,061 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. cyclomatic complexity: 272 Second operand 3 states. [2020-07-29 01:44:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,229 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2020-07-29 01:44:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:42,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:42,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:42,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,321 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-07-29 01:44:42,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 945 states and 1425 transitions. [2020-07-29 01:44:42,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 945 [2020-07-29 01:44:42,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 945 [2020-07-29 01:44:42,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:42,378 INFO L688 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2020-07-29 01:44:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2020-07-29 01:44:42,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:42,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 945 states and 1425 transitions. Second operand 945 states. [2020-07-29 01:44:42,398 INFO L74 IsIncluded]: Start isIncluded. First operand 945 states and 1425 transitions. Second operand 945 states. [2020-07-29 01:44:42,398 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. Second operand 945 states. [2020-07-29 01:44:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,463 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2020-07-29 01:44:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:42,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:42,466 INFO L74 IsIncluded]: Start isIncluded. First operand 945 states. Second operand 945 states and 1425 transitions. [2020-07-29 01:44:42,466 INFO L87 Difference]: Start difference. First operand 945 states. Second operand 945 states and 1425 transitions. [2020-07-29 01:44:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,515 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2020-07-29 01:44:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:42,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:42,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:42,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2020-07-29 01:44:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2020-07-29 01:44:42,568 INFO L711 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2020-07-29 01:44:42,568 INFO L591 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2020-07-29 01:44:42,568 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:44:42,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1425 transitions. [2020-07-29 01:44:42,575 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2020-07-29 01:44:42,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:42,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:42,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:42,576 INFO L850 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] [2020-07-29 01:44:42,576 INFO L794 eck$LassoCheckResult]: Stem: 4736#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 4737#L153-1 [2020-07-29 01:44:42,577 INFO L796 eck$LassoCheckResult]: Loop: 4737#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 4813#L41 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; 4810#L66 assume !(0 != main_~p1~0); 4808#L66-2 assume !(0 != main_~p2~0); 4805#L70-1 assume !(0 != main_~p3~0); 4801#L74-1 assume !(0 != main_~p4~0); 4797#L78-1 assume !(0 != main_~p5~0); 4794#L82-1 assume !(0 != main_~p6~0); 4792#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4790#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4788#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4785#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4782#L102-1 assume !(0 != main_~p1~0); 4779#L108-1 assume !(0 != main_~p2~0); 4775#L113-1 assume !(0 != main_~p3~0); 4774#L118-1 assume !(0 != main_~p4~0); 4836#L123-1 assume !(0 != main_~p5~0); 4832#L128-1 assume !(0 != main_~p6~0); 4829#L133-1 assume !(0 != main_~p7~0); 4825#L138-1 assume !(0 != main_~p8~0); 4821#L143-1 assume !(0 != main_~p9~0); 4818#L148-1 assume !(0 != main_~p10~0); 4737#L153-1 [2020-07-29 01:44:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2020-07-29 01:44:42,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:42,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880671505] [2020-07-29 01:44:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times [2020-07-29 01:44:42,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:42,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945512911] [2020-07-29 01:44:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:42,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {7534#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {7534#true} is VALID [2020-07-29 01:44:42,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {7534#true} 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; {7534#true} is VALID [2020-07-29 01:44:42,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {7534#true} assume !(0 != main_~p1~0); {7534#true} is VALID [2020-07-29 01:44:42,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {7534#true} assume !(0 != main_~p2~0); {7534#true} is VALID [2020-07-29 01:44:42,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {7534#true} assume !(0 != main_~p3~0); {7534#true} is VALID [2020-07-29 01:44:42,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {7534#true} assume !(0 != main_~p4~0); {7534#true} is VALID [2020-07-29 01:44:42,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {7534#true} assume !(0 != main_~p5~0); {7534#true} is VALID [2020-07-29 01:44:42,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {7534#true} assume !(0 != main_~p6~0); {7534#true} is VALID [2020-07-29 01:44:42,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {7534#true} assume 0 != main_~p7~0;main_~lk7~0 := 1; {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,630 INFO L280 TraceCheckUtils]: 11: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,631 INFO L280 TraceCheckUtils]: 12: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p1~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,631 INFO L280 TraceCheckUtils]: 13: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p2~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,632 INFO L280 TraceCheckUtils]: 14: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p3~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,633 INFO L280 TraceCheckUtils]: 15: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p4~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p5~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p6~0); {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,638 INFO L280 TraceCheckUtils]: 18: Hoare triple {7536#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p7~0); {7535#false} is VALID [2020-07-29 01:44:42,639 INFO L280 TraceCheckUtils]: 19: Hoare triple {7535#false} assume !(0 != main_~p8~0); {7535#false} is VALID [2020-07-29 01:44:42,639 INFO L280 TraceCheckUtils]: 20: Hoare triple {7535#false} assume !(0 != main_~p9~0); {7535#false} is VALID [2020-07-29 01:44:42,639 INFO L280 TraceCheckUtils]: 21: Hoare triple {7535#false} assume !(0 != main_~p10~0); {7535#false} is VALID [2020-07-29 01:44:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:42,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945512911] [2020-07-29 01:44:42,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:42,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:42,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529053479] [2020-07-29 01:44:42,643 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:42,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:42,644 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. cyclomatic complexity: 512 Second operand 3 states. [2020-07-29 01:44:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,955 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2020-07-29 01:44:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:42,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:42,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:42,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:43,244 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-07-29 01:44:43,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1857 states and 2753 transitions. [2020-07-29 01:44:43,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1857 [2020-07-29 01:44:43,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1857 [2020-07-29 01:44:43,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:43,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:43,468 INFO L688 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2020-07-29 01:44:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2020-07-29 01:44:43,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:43,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1857 states and 2753 transitions. Second operand 1857 states. [2020-07-29 01:44:43,535 INFO L74 IsIncluded]: Start isIncluded. First operand 1857 states and 2753 transitions. Second operand 1857 states. [2020-07-29 01:44:43,535 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. Second operand 1857 states. [2020-07-29 01:44:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:43,776 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2020-07-29 01:44:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:43,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:43,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:43,784 INFO L74 IsIncluded]: Start isIncluded. First operand 1857 states. Second operand 1857 states and 2753 transitions. [2020-07-29 01:44:43,785 INFO L87 Difference]: Start difference. First operand 1857 states. Second operand 1857 states and 2753 transitions. [2020-07-29 01:44:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:44,047 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2020-07-29 01:44:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:44,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:44,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:44,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:44,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2020-07-29 01:44:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2753 transitions. [2020-07-29 01:44:44,235 INFO L711 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2020-07-29 01:44:44,235 INFO L591 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2020-07-29 01:44:44,235 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:44:44,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1857 states and 2753 transitions. [2020-07-29 01:44:44,247 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2020-07-29 01:44:44,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:44,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:44,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:44,248 INFO L850 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] [2020-07-29 01:44:44,249 INFO L794 eck$LassoCheckResult]: Stem: 9436#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 9437#L153-1 [2020-07-29 01:44:44,249 INFO L796 eck$LassoCheckResult]: Loop: 9437#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 9516#L41 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; 9513#L66 assume !(0 != main_~p1~0); 9511#L66-2 assume !(0 != main_~p2~0); 9508#L70-1 assume !(0 != main_~p3~0); 9504#L74-1 assume !(0 != main_~p4~0); 9500#L78-1 assume !(0 != main_~p5~0); 9496#L82-1 assume !(0 != main_~p6~0); 9493#L86-1 assume !(0 != main_~p7~0); 9491#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 9489#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 9486#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 9483#L102-1 assume !(0 != main_~p1~0); 9480#L108-1 assume !(0 != main_~p2~0); 9476#L113-1 assume !(0 != main_~p3~0); 9475#L118-1 assume !(0 != main_~p4~0); 9539#L123-1 assume !(0 != main_~p5~0); 9535#L128-1 assume !(0 != main_~p6~0); 9531#L133-1 assume !(0 != main_~p7~0); 9528#L138-1 assume !(0 != main_~p8~0); 9524#L143-1 assume !(0 != main_~p9~0); 9521#L148-1 assume !(0 != main_~p10~0); 9437#L153-1 [2020-07-29 01:44:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2020-07-29 01:44:44,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:44,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302692844] [2020-07-29 01:44:44,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:44,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:44,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:44,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times [2020-07-29 01:44:44,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:44,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24879217] [2020-07-29 01:44:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:44,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {14970#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {14970#true} is VALID [2020-07-29 01:44:44,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {14970#true} 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; {14970#true} is VALID [2020-07-29 01:44:44,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {14970#true} assume !(0 != main_~p1~0); {14970#true} is VALID [2020-07-29 01:44:44,291 INFO L280 TraceCheckUtils]: 3: Hoare triple {14970#true} assume !(0 != main_~p2~0); {14970#true} is VALID [2020-07-29 01:44:44,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {14970#true} assume !(0 != main_~p3~0); {14970#true} is VALID [2020-07-29 01:44:44,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {14970#true} assume !(0 != main_~p4~0); {14970#true} is VALID [2020-07-29 01:44:44,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {14970#true} assume !(0 != main_~p5~0); {14970#true} is VALID [2020-07-29 01:44:44,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {14970#true} assume !(0 != main_~p6~0); {14970#true} is VALID [2020-07-29 01:44:44,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {14970#true} assume !(0 != main_~p7~0); {14970#true} is VALID [2020-07-29 01:44:44,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {14970#true} assume 0 != main_~p8~0;main_~lk8~0 := 1; {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,294 INFO L280 TraceCheckUtils]: 10: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p1~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,296 INFO L280 TraceCheckUtils]: 13: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p2~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p3~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,298 INFO L280 TraceCheckUtils]: 15: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p4~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,299 INFO L280 TraceCheckUtils]: 16: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p5~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p6~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p7~0); {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {14972#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p8~0); {14971#false} is VALID [2020-07-29 01:44:44,301 INFO L280 TraceCheckUtils]: 20: Hoare triple {14971#false} assume !(0 != main_~p9~0); {14971#false} is VALID [2020-07-29 01:44:44,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {14971#false} assume !(0 != main_~p10~0); {14971#false} is VALID [2020-07-29 01:44:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:44,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24879217] [2020-07-29 01:44:44,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:44,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:44,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374791235] [2020-07-29 01:44:44,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:44,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:44,305 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. cyclomatic complexity: 960 Second operand 3 states. [2020-07-29 01:44:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:45,045 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2020-07-29 01:44:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:45,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:45,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:45,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:45,639 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-07-29 01:44:46,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3649 states to 3649 states and 5313 transitions. [2020-07-29 01:44:46,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3649 [2020-07-29 01:44:46,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3649 [2020-07-29 01:44:46,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:46,069 INFO L688 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2020-07-29 01:44:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3649. [2020-07-29 01:44:46,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:46,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3649 states and 5313 transitions. Second operand 3649 states. [2020-07-29 01:44:46,135 INFO L74 IsIncluded]: Start isIncluded. First operand 3649 states and 5313 transitions. Second operand 3649 states. [2020-07-29 01:44:46,135 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. Second operand 3649 states. [2020-07-29 01:44:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:46,524 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2020-07-29 01:44:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:46,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:46,537 INFO L74 IsIncluded]: Start isIncluded. First operand 3649 states. Second operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,538 INFO L87 Difference]: Start difference. First operand 3649 states. Second operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:46,937 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2020-07-29 01:44:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:46,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:46,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:46,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:46,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2020-07-29 01:44:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5313 transitions. [2020-07-29 01:44:47,413 INFO L711 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2020-07-29 01:44:47,413 INFO L591 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2020-07-29 01:44:47,413 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:44:47,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 5313 transitions. [2020-07-29 01:44:47,430 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2020-07-29 01:44:47,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:47,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:47,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:47,432 INFO L850 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] [2020-07-29 01:44:47,432 INFO L794 eck$LassoCheckResult]: Stem: 18667#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 18668#L153-1 [2020-07-29 01:44:47,432 INFO L796 eck$LassoCheckResult]: Loop: 18668#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 18788#L41 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; 18784#L66 assume !(0 != main_~p1~0); 18782#L66-2 assume !(0 != main_~p2~0); 18775#L70-1 assume !(0 != main_~p3~0); 18768#L74-1 assume !(0 != main_~p4~0); 18760#L78-1 assume !(0 != main_~p5~0); 18752#L82-1 assume !(0 != main_~p6~0); 18744#L86-1 assume !(0 != main_~p7~0); 18738#L90-1 assume !(0 != main_~p8~0); 18733#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 18728#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 18724#L102-1 assume !(0 != main_~p1~0); 18725#L108-1 assume !(0 != main_~p2~0); 18839#L113-1 assume !(0 != main_~p3~0); 18836#L118-1 assume !(0 != main_~p4~0); 18831#L123-1 assume !(0 != main_~p5~0); 18825#L128-1 assume !(0 != main_~p6~0); 18819#L133-1 assume !(0 != main_~p7~0); 18815#L138-1 assume !(0 != main_~p8~0); 18804#L143-1 assume !(0 != main_~p9~0); 18796#L148-1 assume !(0 != main_~p10~0); 18668#L153-1 [2020-07-29 01:44:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2020-07-29 01:44:47,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:47,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943696519] [2020-07-29 01:44:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:47,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:47,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:47,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times [2020-07-29 01:44:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:47,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014100874] [2020-07-29 01:44:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:47,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {29574#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {29574#true} is VALID [2020-07-29 01:44:47,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {29574#true} 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; {29574#true} is VALID [2020-07-29 01:44:47,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {29574#true} assume !(0 != main_~p1~0); {29574#true} is VALID [2020-07-29 01:44:47,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {29574#true} assume !(0 != main_~p2~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {29574#true} assume !(0 != main_~p3~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {29574#true} assume !(0 != main_~p4~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {29574#true} assume !(0 != main_~p5~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {29574#true} assume !(0 != main_~p6~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {29574#true} assume !(0 != main_~p7~0); {29574#true} is VALID [2020-07-29 01:44:47,485 INFO L280 TraceCheckUtils]: 9: Hoare triple {29574#true} assume !(0 != main_~p8~0); {29574#true} is VALID [2020-07-29 01:44:47,486 INFO L280 TraceCheckUtils]: 10: Hoare triple {29574#true} assume 0 != main_~p9~0;main_~lk9~0 := 1; {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,487 INFO L280 TraceCheckUtils]: 12: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p1~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p2~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p3~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,488 INFO L280 TraceCheckUtils]: 15: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p4~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,489 INFO L280 TraceCheckUtils]: 16: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p5~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,489 INFO L280 TraceCheckUtils]: 17: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p6~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,490 INFO L280 TraceCheckUtils]: 18: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p7~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,490 INFO L280 TraceCheckUtils]: 19: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p8~0); {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {29576#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p9~0); {29575#false} is VALID [2020-07-29 01:44:47,491 INFO L280 TraceCheckUtils]: 21: Hoare triple {29575#false} assume !(0 != main_~p10~0); {29575#false} is VALID [2020-07-29 01:44:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:47,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014100874] [2020-07-29 01:44:47,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:47,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:47,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88813510] [2020-07-29 01:44:47,493 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:47,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:47,494 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2020-07-29 01:44:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:49,044 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2020-07-29 01:44:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:49,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:49,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:49,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:50,721 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-07-29 01:44:52,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7169 states to 7169 states and 10241 transitions. [2020-07-29 01:44:52,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2020-07-29 01:44:52,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7169 [2020-07-29 01:44:52,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:52,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:52,201 INFO L688 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2020-07-29 01:44:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2020-07-29 01:44:52,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:52,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7169 states and 10241 transitions. Second operand 7169 states. [2020-07-29 01:44:52,327 INFO L74 IsIncluded]: Start isIncluded. First operand 7169 states and 10241 transitions. Second operand 7169 states. [2020-07-29 01:44:52,328 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. Second operand 7169 states. [2020-07-29 01:44:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:53,891 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2020-07-29 01:44:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:53,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:53,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:53,902 INFO L74 IsIncluded]: Start isIncluded. First operand 7169 states. Second operand 7169 states and 10241 transitions. [2020-07-29 01:44:53,902 INFO L87 Difference]: Start difference. First operand 7169 states. Second operand 7169 states and 10241 transitions. [2020-07-29 01:44:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:55,341 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2020-07-29 01:44:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:55,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:55,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:55,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:55,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2020-07-29 01:44:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 10241 transitions. [2020-07-29 01:44:56,944 INFO L711 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2020-07-29 01:44:56,944 INFO L591 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2020-07-29 01:44:56,944 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:44:56,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7169 states and 10241 transitions. [2020-07-29 01:44:56,968 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2020-07-29 01:44:56,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:56,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:56,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:56,969 INFO L850 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] [2020-07-29 01:44:56,970 INFO L794 eck$LassoCheckResult]: Stem: 36788#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 36789#L153-1 [2020-07-29 01:44:56,970 INFO L796 eck$LassoCheckResult]: Loop: 36789#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 37185#L41 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; 37183#L66 assume !(0 != main_~p1~0); 37181#L66-2 assume !(0 != main_~p2~0); 37179#L70-1 assume !(0 != main_~p3~0); 37177#L74-1 assume !(0 != main_~p4~0); 37176#L78-1 assume !(0 != main_~p5~0); 37168#L82-1 assume !(0 != main_~p6~0); 37170#L86-1 assume !(0 != main_~p7~0); 37156#L90-1 assume !(0 != main_~p8~0); 37158#L94-1 assume !(0 != main_~p9~0); 37146#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 37147#L102-1 assume !(0 != main_~p1~0); 37139#L108-1 assume !(0 != main_~p2~0); 37140#L113-1 assume !(0 != main_~p3~0); 37129#L118-1 assume !(0 != main_~p4~0); 37130#L123-1 assume !(0 != main_~p5~0); 37194#L128-1 assume !(0 != main_~p6~0); 37192#L133-1 assume !(0 != main_~p7~0); 37190#L138-1 assume !(0 != main_~p8~0); 37188#L143-1 assume !(0 != main_~p9~0); 37187#L148-1 assume !(0 != main_~p10~0); 36789#L153-1 [2020-07-29 01:44:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2020-07-29 01:44:56,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:56,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915522398] [2020-07-29 01:44:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:56,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:56,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:56,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times [2020-07-29 01:44:56,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:56,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174008790] [2020-07-29 01:44:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:56,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {58258#true} assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; {58258#true} is VALID [2020-07-29 01:44:56,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {58258#true} 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; {58258#true} is VALID [2020-07-29 01:44:56,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {58258#true} assume !(0 != main_~p1~0); {58258#true} is VALID [2020-07-29 01:44:57,000 INFO L280 TraceCheckUtils]: 3: Hoare triple {58258#true} assume !(0 != main_~p2~0); {58258#true} is VALID [2020-07-29 01:44:57,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {58258#true} assume !(0 != main_~p3~0); {58258#true} is VALID [2020-07-29 01:44:57,000 INFO L280 TraceCheckUtils]: 5: Hoare triple {58258#true} assume !(0 != main_~p4~0); {58258#true} is VALID [2020-07-29 01:44:57,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {58258#true} assume !(0 != main_~p5~0); {58258#true} is VALID [2020-07-29 01:44:57,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {58258#true} assume !(0 != main_~p6~0); {58258#true} is VALID [2020-07-29 01:44:57,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {58258#true} assume !(0 != main_~p7~0); {58258#true} is VALID [2020-07-29 01:44:57,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {58258#true} assume !(0 != main_~p8~0); {58258#true} is VALID [2020-07-29 01:44:57,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {58258#true} assume !(0 != main_~p9~0); {58258#true} is VALID [2020-07-29 01:44:57,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {58258#true} assume 0 != main_~p10~0;main_~lk10~0 := 1; {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p1~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,004 INFO L280 TraceCheckUtils]: 13: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p2~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p3~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p4~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,011 INFO L280 TraceCheckUtils]: 16: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p5~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,012 INFO L280 TraceCheckUtils]: 17: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p6~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,012 INFO L280 TraceCheckUtils]: 18: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p7~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,013 INFO L280 TraceCheckUtils]: 19: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p8~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,014 INFO L280 TraceCheckUtils]: 20: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p9~0); {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:57,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {58260#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p10~0); {58259#false} is VALID [2020-07-29 01:44:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:44:57,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174008790] [2020-07-29 01:44:57,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:57,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:44:57,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542131659] [2020-07-29 01:44:57,017 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:57,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:57,018 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2020-07-29 01:45:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:03,057 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2020-07-29 01:45:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:03,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:03,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:03,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:08,645 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-07-29 01:45:14,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14081 states to 14081 states and 19713 transitions. [2020-07-29 01:45:14,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14081 [2020-07-29 01:45:14,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14081 [2020-07-29 01:45:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:14,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:14,375 INFO L688 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2020-07-29 01:45:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 14081. [2020-07-29 01:45:14,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:14,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14081 states and 19713 transitions. Second operand 14081 states. [2020-07-29 01:45:14,565 INFO L74 IsIncluded]: Start isIncluded. First operand 14081 states and 19713 transitions. Second operand 14081 states. [2020-07-29 01:45:14,565 INFO L87 Difference]: Start difference. First operand 14081 states and 19713 transitions. Second operand 14081 states. [2020-07-29 01:45:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:20,497 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2020-07-29 01:45:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:20,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:20,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:20,511 INFO L74 IsIncluded]: Start isIncluded. First operand 14081 states. Second operand 14081 states and 19713 transitions. [2020-07-29 01:45:20,511 INFO L87 Difference]: Start difference. First operand 14081 states. Second operand 14081 states and 19713 transitions. [2020-07-29 01:45:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:27,600 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2020-07-29 01:45:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:27,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:27,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:27,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:27,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14081 states. [2020-07-29 01:45:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 19713 transitions. [2020-07-29 01:45:39,031 INFO L711 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2020-07-29 01:45:39,032 INFO L591 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2020-07-29 01:45:39,032 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:45:39,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14081 states and 19713 transitions. [2020-07-29 01:45:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2020-07-29 01:45:39,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:39,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:39,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:39,077 INFO L850 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] [2020-07-29 01:45:39,077 INFO L794 eck$LassoCheckResult]: Stem: 72387#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 72388#L153-1 [2020-07-29 01:45:39,078 INFO L796 eck$LassoCheckResult]: Loop: 72388#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 72751#L41 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; 72745#L66 assume !(0 != main_~p1~0); 72737#L66-2 assume !(0 != main_~p2~0); 72730#L70-1 assume !(0 != main_~p3~0); 72724#L74-1 assume !(0 != main_~p4~0); 72718#L78-1 assume !(0 != main_~p5~0); 72686#L82-1 assume !(0 != main_~p6~0); 72678#L86-1 assume !(0 != main_~p7~0); 72679#L90-1 assume !(0 != main_~p8~0); 72750#L94-1 assume !(0 != main_~p9~0); 72794#L98-1 assume !(0 != main_~p10~0); 72789#L102-1 assume !(0 != main_~p1~0); 72783#L108-1 assume !(0 != main_~p2~0); 72778#L113-1 assume !(0 != main_~p3~0); 72771#L118-1 assume !(0 != main_~p4~0); 72767#L123-1 assume !(0 != main_~p5~0); 72544#L128-1 assume !(0 != main_~p6~0); 72546#L133-1 assume !(0 != main_~p7~0); 72761#L138-1 assume !(0 != main_~p8~0); 72758#L143-1 assume !(0 != main_~p9~0); 72754#L148-1 assume !(0 != main_~p10~0); 72388#L153-1 [2020-07-29 01:45:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2020-07-29 01:45:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:39,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338410102] [2020-07-29 01:45:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times [2020-07-29 01:45:39,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:39,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707914888] [2020-07-29 01:45:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -962117286, now seen corresponding path program 1 times [2020-07-29 01:45:39,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:39,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439999199] [2020-07-29 01:45:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:39,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:39,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:39,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:45:39 BoogieIcfgContainer [2020-07-29 01:45:39,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:45:39,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:45:39,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:45:39,402 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:45:39,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:44:39" (3/4) ... [2020-07-29 01:45:39,408 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:45:39,520 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:45:39,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:45:39,524 INFO L168 Benchmark]: Toolchain (without parser) took 60481.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 949.5 MB in the beginning and 901.7 MB in the end (delta: 47.8 MB). Peak memory consumption was 351.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,526 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:39,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.85 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 1.0 GB. Free memory was 938.7 MB in the beginning and 933.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,531 INFO L168 Benchmark]: Boogie Preprocessor took 85.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,531 INFO L168 Benchmark]: RCFGBuilder took 528.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,532 INFO L168 Benchmark]: BuchiAutomizer took 59410.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 901.7 MB in the end (delta: 191.6 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:39,533 INFO L168 Benchmark]: Witness Printer took 119.22 ms. Allocated memory is still 1.3 GB. Free memory is still 901.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:39,542 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.85 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 1.0 GB. Free memory was 938.7 MB in the beginning and 933.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 528.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 59410.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 901.7 MB in the end (delta: 191.6 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. * Witness Printer took 119.22 ms. Allocated memory is still 1.3 GB. Free memory is still 901.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14081 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 9.7s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 31.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 16.0s Buchi closure took 0.0s. Biggest automaton had 14081 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 713 SDtfs, 374 SDslu, 436 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 39]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66827d48=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cdc3e0a=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@190d1ca7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6de2bc6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58d85389=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a6c6671=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@abdf13f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e7bbb2c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2322c5a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@420216a3=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@775c71dd=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 39]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...