./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:44:37,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:44:37,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:44:37,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:44:37,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:44:37,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:44:37,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:44:37,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:44:37,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:44:37,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:44:37,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:44:37,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:44:37,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:44:37,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:44:37,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:44:37,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:44:37,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:44:37,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:44:37,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:44:37,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:44:37,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:44:37,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:44:37,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:44:37,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:44:37,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:44:37,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:44:37,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:44:37,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:44:37,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:44:37,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:44:37,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:44:37,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:44:37,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:44:37,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:44:37,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:44:37,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:44:37,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:44:37,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:44:37,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:44:37,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:44:37,596 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,614 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:44:37,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:44:37,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:44:37,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:44:37,615 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:44:37,616 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:44:37,616 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:44:37,616 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:44:37,616 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:44:37,617 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:44:37,617 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:44:37,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:44:37,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:44:37,618 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:44:37,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:44:37,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:44:37,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:44:37,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:44:37,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:44:37,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:44:37,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:44:37,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:44:37,619 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:44:37,620 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:44:37,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:44:37,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:44:37,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:44:37,621 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:44:37,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:44:37,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:44:37,621 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:44:37,622 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:44:37,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:44:37,623 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2020-07-29 01:44:37,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:44:37,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:44:37,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:44:37,928 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:44:37,928 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:44:37,929 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2020-07-29 01:44:38,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9341f5b67/a1ee581abc65432694d29a0b0355e258/FLAG3896dd4f2 [2020-07-29 01:44:38,466 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:44:38,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2020-07-29 01:44:38,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9341f5b67/a1ee581abc65432694d29a0b0355e258/FLAG3896dd4f2 [2020-07-29 01:44:38,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9341f5b67/a1ee581abc65432694d29a0b0355e258 [2020-07-29 01:44:38,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:44:38,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:44:38,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:44:38,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:44:38,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:44:38,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:44:38" (1/1) ... [2020-07-29 01:44:38,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7c72a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:44:38, skipping insertion in model container [2020-07-29 01:44:38,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:44:38" (1/1) ... [2020-07-29 01:44:38,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:44:38,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:44:39,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:44:39,144 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:44:39,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:44:39,224 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:44:39,225 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,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:44:39,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:44:39,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:44:39,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:44:39,239 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,314 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,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:44:39,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:44:39,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:44:39,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:44:39,372 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,372 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,381 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,381 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,393 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,407 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,408 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,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:44:39,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:44:39,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:44:39,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:44:39,413 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,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:44:39,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:44:39,920 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:44:39,920 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:44:39,924 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,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:44:39,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:44:39,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:44:39,930 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:44:39,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:44:38" (1/3) ... [2020-07-29 01:44:39,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a1d879e 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,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,933 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,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a1d879e 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,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:44:39,934 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:39,936 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2020-07-29 01:44:39,989 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:44:39,989 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:44:39,989 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:44:39,990 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:44:39,990 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:44:39,990 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:44:39,990 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:44:39,990 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:44:40,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2020-07-29 01:44:40,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 01:44:40,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,053 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, 1, 1] [2020-07-29 01:44:40,053 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:44:40,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2020-07-29 01:44:40,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 01:44:40,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,063 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, 1, 1] [2020-07-29 01:44:40,072 INFO L794 eck$LassoCheckResult]: Stem: 36#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 29#L167-1true [2020-07-29 01:44:40,073 INFO L796 eck$LassoCheckResult]: Loop: 29#L167-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 38#L44true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 7#L71true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L71-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 35#L75-1true assume !(0 != main_~p3~0); 43#L79-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L83-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 16#L87-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 3#L91-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L95-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L99-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 30#L103-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 14#L107-1true assume !(0 != main_~p11~0); 23#L111-1true assume !(0 != main_~p1~0); 12#L117-1true assume !(0 != main_~p2~0); 24#L122-1true assume !(0 != main_~p3~0); 33#L127-1true assume !(0 != main_~p4~0); 41#L132-1true assume !(0 != main_~p5~0); 9#L137-1true assume !(0 != main_~p6~0); 21#L142-1true assume !(0 != main_~p7~0); 32#L147-1true assume !(0 != main_~p8~0); 39#L152-1true assume !(0 != main_~p9~0); 6#L157-1true assume !(0 != main_~p10~0); 18#L162-1true assume !(0 != main_~p11~0); 29#L167-1true [2020-07-29 01:44:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:44:40,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835193656] [2020-07-29 01:44:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash -504227868, now seen corresponding path program 1 times [2020-07-29 01:44:40,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186598377] [2020-07-29 01:44:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:40,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {47#true} is VALID [2020-07-29 01:44:40,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#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;main_~lk11~0 := 0; {47#true} is VALID [2020-07-29 01:44:40,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume 0 != main_~p1~0;main_~lk1~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p2~0;main_~lk2~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p3~0); {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,339 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p11~0); {49#(not (= 0 ULTIMATE.start_main_~p1~0))} is VALID [2020-07-29 01:44:40,340 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#(not (= 0 ULTIMATE.start_main_~p1~0))} assume !(0 != main_~p1~0); {48#false} is VALID [2020-07-29 01:44:40,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume !(0 != main_~p2~0); {48#false} is VALID [2020-07-29 01:44:40,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume !(0 != main_~p3~0); {48#false} is VALID [2020-07-29 01:44:40,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume !(0 != main_~p4~0); {48#false} is VALID [2020-07-29 01:44:40,341 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#false} assume !(0 != main_~p5~0); {48#false} is VALID [2020-07-29 01:44:40,342 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} assume !(0 != main_~p6~0); {48#false} is VALID [2020-07-29 01:44:40,342 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !(0 != main_~p7~0); {48#false} is VALID [2020-07-29 01:44:40,342 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !(0 != main_~p8~0); {48#false} is VALID [2020-07-29 01:44:40,342 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !(0 != main_~p9~0); {48#false} is VALID [2020-07-29 01:44:40,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {48#false} assume !(0 != main_~p10~0); {48#false} is VALID [2020-07-29 01:44:40,343 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !(0 != main_~p11~0); {48#false} is VALID [2020-07-29 01:44:40,349 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,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186598377] [2020-07-29 01:44:40,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:40,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668297552] [2020-07-29 01:44:40,357 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:40,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:40,375 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-29 01:44:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,583 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-07-29 01:44:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:40,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:40,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:40,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 141 transitions. [2020-07-29 01:44:40,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-07-29 01:44:40,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 70 states and 112 transitions. [2020-07-29 01:44:40,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-07-29 01:44:40,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-07-29 01:44:40,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 112 transitions. [2020-07-29 01:44:40,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:40,651 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2020-07-29 01:44:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 112 transitions. [2020-07-29 01:44:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-29 01:44:40,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:40,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states and 112 transitions. Second operand 70 states. [2020-07-29 01:44:40,689 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states and 112 transitions. Second operand 70 states. [2020-07-29 01:44:40,691 INFO L87 Difference]: Start difference. First operand 70 states and 112 transitions. Second operand 70 states. [2020-07-29 01:44:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,697 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2020-07-29 01:44:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 112 transitions. [2020-07-29 01:44:40,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:40,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:40,700 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states and 112 transitions. [2020-07-29 01:44:40,700 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states and 112 transitions. [2020-07-29 01:44:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:40,706 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2020-07-29 01:44:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 112 transitions. [2020-07-29 01:44:40,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:40,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:40,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:40,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-29 01:44:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions. [2020-07-29 01:44:40,715 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2020-07-29 01:44:40,715 INFO L591 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2020-07-29 01:44:40,716 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:44:40,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 112 transitions. [2020-07-29 01:44:40,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-07-29 01:44:40,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:40,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:40,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:40,719 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, 1, 1] [2020-07-29 01:44:40,720 INFO L794 eck$LassoCheckResult]: Stem: 171#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 172#L167-1 [2020-07-29 01:44:40,720 INFO L796 eck$LassoCheckResult]: Loop: 172#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 181#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 180#L71 assume !(0 != main_~p1~0); 132#L71-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 133#L75-1 assume !(0 != main_~p3~0); 170#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 167#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 156#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 130#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 131#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 173#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 174#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 153#L107-1 assume !(0 != main_~p11~0); 154#L111-1 assume !(0 != main_~p1~0); 148#L117-1 assume !(0 != main_~p2~0); 149#L122-1 assume !(0 != main_~p3~0); 160#L127-1 assume !(0 != main_~p4~0); 135#L132-1 assume !(0 != main_~p5~0); 141#L137-1 assume !(0 != main_~p6~0); 142#L142-1 assume !(0 != main_~p7~0); 152#L147-1 assume !(0 != main_~p8~0); 163#L152-1 assume !(0 != main_~p9~0); 169#L157-1 assume !(0 != main_~p10~0); 183#L162-1 assume !(0 != main_~p11~0); 172#L167-1 [2020-07-29 01:44:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:44:40,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752295678] [2020-07-29 01:44:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:40,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:40,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -285373150, now seen corresponding path program 1 times [2020-07-29 01:44:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:40,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642074932] [2020-07-29 01:44:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:40,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {345#true} is VALID [2020-07-29 01:44:40,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#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;main_~lk11~0 := 0; {345#true} is VALID [2020-07-29 01:44:40,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {345#true} assume !(0 != main_~p1~0); {345#true} is VALID [2020-07-29 01:44:40,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} assume 0 != main_~p2~0;main_~lk2~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p3~0); {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p4~0;main_~lk4~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,816 INFO L280 TraceCheckUtils]: 10: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,817 INFO L280 TraceCheckUtils]: 11: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p11~0); {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p1~0); {347#(not (= 0 ULTIMATE.start_main_~p2~0))} is VALID [2020-07-29 01:44:40,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {347#(not (= 0 ULTIMATE.start_main_~p2~0))} assume !(0 != main_~p2~0); {346#false} is VALID [2020-07-29 01:44:40,820 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#false} assume !(0 != main_~p3~0); {346#false} is VALID [2020-07-29 01:44:40,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {346#false} assume !(0 != main_~p4~0); {346#false} is VALID [2020-07-29 01:44:40,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {346#false} assume !(0 != main_~p5~0); {346#false} is VALID [2020-07-29 01:44:40,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {346#false} assume !(0 != main_~p6~0); {346#false} is VALID [2020-07-29 01:44:40,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {346#false} assume !(0 != main_~p7~0); {346#false} is VALID [2020-07-29 01:44:40,822 INFO L280 TraceCheckUtils]: 20: Hoare triple {346#false} assume !(0 != main_~p8~0); {346#false} is VALID [2020-07-29 01:44:40,822 INFO L280 TraceCheckUtils]: 21: Hoare triple {346#false} assume !(0 != main_~p9~0); {346#false} is VALID [2020-07-29 01:44:40,822 INFO L280 TraceCheckUtils]: 22: Hoare triple {346#false} assume !(0 != main_~p10~0); {346#false} is VALID [2020-07-29 01:44:40,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {346#false} assume !(0 != main_~p11~0); {346#false} is VALID [2020-07-29 01:44:40,825 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,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642074932] [2020-07-29 01:44:40,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:40,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:40,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114055005] [2020-07-29 01:44:40,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:40,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:40,829 INFO L87 Difference]: Start difference. First operand 70 states and 112 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-07-29 01:44:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,004 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2020-07-29 01:44:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-07-29 01:44:41,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 217 transitions. [2020-07-29 01:44:41,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2020-07-29 01:44:41,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2020-07-29 01:44:41,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,059 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2020-07-29 01:44:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-29 01:44:41,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 217 transitions. Second operand 137 states. [2020-07-29 01:44:41,071 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 217 transitions. Second operand 137 states. [2020-07-29 01:44:41,071 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 137 states. [2020-07-29 01:44:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,078 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2020-07-29 01:44:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,081 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states and 217 transitions. [2020-07-29 01:44:41,081 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states and 217 transitions. [2020-07-29 01:44:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,089 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2020-07-29 01:44:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-29 01:44:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2020-07-29 01:44:41,098 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2020-07-29 01:44:41,098 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2020-07-29 01:44:41,098 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:44:41,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 217 transitions. [2020-07-29 01:44:41,100 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-07-29 01:44:41,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,102 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,102 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, 1, 1] [2020-07-29 01:44:41,102 INFO L794 eck$LassoCheckResult]: Stem: 526#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 527#L167-1 [2020-07-29 01:44:41,102 INFO L796 eck$LassoCheckResult]: Loop: 527#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 536#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 533#L71 assume !(0 != main_~p1~0); 534#L71-2 assume !(0 != main_~p2~0); 592#L75-1 assume !(0 != main_~p3~0); 590#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 588#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 586#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 584#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 582#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 580#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 579#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 578#L107-1 assume !(0 != main_~p11~0); 577#L111-1 assume !(0 != main_~p1~0); 574#L117-1 assume !(0 != main_~p2~0); 570#L122-1 assume !(0 != main_~p3~0); 567#L127-1 assume !(0 != main_~p4~0); 563#L132-1 assume !(0 != main_~p5~0); 559#L137-1 assume !(0 != main_~p6~0); 555#L142-1 assume !(0 != main_~p7~0); 551#L147-1 assume !(0 != main_~p8~0); 547#L152-1 assume !(0 != main_~p9~0); 543#L157-1 assume !(0 != main_~p10~0); 541#L162-1 assume !(0 != main_~p11~0); 527#L167-1 [2020-07-29 01:44:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:44:41,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943864356] [2020-07-29 01:44:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:41,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 137328676, now seen corresponding path program 1 times [2020-07-29 01:44:41,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218082820] [2020-07-29 01:44:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:41,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {901#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {901#true} is VALID [2020-07-29 01:44:41,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {901#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;main_~lk11~0 := 0; {901#true} is VALID [2020-07-29 01:44:41,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {901#true} assume !(0 != main_~p1~0); {901#true} is VALID [2020-07-29 01:44:41,170 INFO L280 TraceCheckUtils]: 3: Hoare triple {901#true} assume !(0 != main_~p2~0); {901#true} is VALID [2020-07-29 01:44:41,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {901#true} assume !(0 != main_~p3~0); {901#true} is VALID [2020-07-29 01:44:41,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {901#true} assume 0 != main_~p4~0;main_~lk4~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p5~0;main_~lk5~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,174 INFO L280 TraceCheckUtils]: 8: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,177 INFO L280 TraceCheckUtils]: 11: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p11~0); {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,179 INFO L280 TraceCheckUtils]: 13: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p1~0); {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p2~0); {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p3~0); {903#(not (= 0 ULTIMATE.start_main_~p4~0))} is VALID [2020-07-29 01:44:41,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {903#(not (= 0 ULTIMATE.start_main_~p4~0))} assume !(0 != main_~p4~0); {902#false} is VALID [2020-07-29 01:44:41,182 INFO L280 TraceCheckUtils]: 17: Hoare triple {902#false} assume !(0 != main_~p5~0); {902#false} is VALID [2020-07-29 01:44:41,182 INFO L280 TraceCheckUtils]: 18: Hoare triple {902#false} assume !(0 != main_~p6~0); {902#false} is VALID [2020-07-29 01:44:41,182 INFO L280 TraceCheckUtils]: 19: Hoare triple {902#false} assume !(0 != main_~p7~0); {902#false} is VALID [2020-07-29 01:44:41,183 INFO L280 TraceCheckUtils]: 20: Hoare triple {902#false} assume !(0 != main_~p8~0); {902#false} is VALID [2020-07-29 01:44:41,183 INFO L280 TraceCheckUtils]: 21: Hoare triple {902#false} assume !(0 != main_~p9~0); {902#false} is VALID [2020-07-29 01:44:41,183 INFO L280 TraceCheckUtils]: 22: Hoare triple {902#false} assume !(0 != main_~p10~0); {902#false} is VALID [2020-07-29 01:44:41,184 INFO L280 TraceCheckUtils]: 23: Hoare triple {902#false} assume !(0 != main_~p11~0); {902#false} is VALID [2020-07-29 01:44:41,186 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,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218082820] [2020-07-29 01:44:41,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:41,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:41,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342529578] [2020-07-29 01:44:41,188 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:41,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:41,189 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-07-29 01:44:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,334 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2020-07-29 01:44:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,387 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-07-29 01:44:41,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 269 states and 421 transitions. [2020-07-29 01:44:41,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2020-07-29 01:44:41,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2020-07-29 01:44:41,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,406 INFO L688 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2020-07-29 01:44:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-07-29 01:44:41,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states and 421 transitions. Second operand 269 states. [2020-07-29 01:44:41,421 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states and 421 transitions. Second operand 269 states. [2020-07-29 01:44:41,421 INFO L87 Difference]: Start difference. First operand 269 states and 421 transitions. Second operand 269 states. [2020-07-29 01:44:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,435 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2020-07-29 01:44:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,437 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 269 states and 421 transitions. [2020-07-29 01:44:41,438 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 269 states and 421 transitions. [2020-07-29 01:44:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,452 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2020-07-29 01:44:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-29 01:44:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 421 transitions. [2020-07-29 01:44:41,467 INFO L711 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2020-07-29 01:44:41,467 INFO L591 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2020-07-29 01:44:41,468 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:44:41,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 421 transitions. [2020-07-29 01:44:41,470 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-07-29 01:44:41,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,471 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, 1, 1] [2020-07-29 01:44:41,472 INFO L794 eck$LassoCheckResult]: Stem: 1215#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 1216#L167-1 [2020-07-29 01:44:41,472 INFO L796 eck$LassoCheckResult]: Loop: 1216#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1230#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1231#L71 assume !(0 != main_~p1~0); 1310#L71-2 assume !(0 != main_~p2~0); 1308#L75-1 assume !(0 != main_~p3~0); 1306#L79-1 assume !(0 != main_~p4~0); 1304#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1302#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1300#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1298#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1296#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1294#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1292#L107-1 assume !(0 != main_~p11~0); 1288#L111-1 assume !(0 != main_~p1~0); 1285#L117-1 assume !(0 != main_~p2~0); 1281#L122-1 assume !(0 != main_~p3~0); 1279#L127-1 assume !(0 != main_~p4~0); 1273#L132-1 assume !(0 != main_~p5~0); 1272#L137-1 assume !(0 != main_~p6~0); 1261#L142-1 assume !(0 != main_~p7~0); 1260#L147-1 assume !(0 != main_~p8~0); 1249#L152-1 assume !(0 != main_~p9~0); 1248#L157-1 assume !(0 != main_~p10~0); 1240#L162-1 assume !(0 != main_~p11~0); 1216#L167-1 [2020-07-29 01:44:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-07-29 01:44:41,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243542262] [2020-07-29 01:44:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1551615066, now seen corresponding path program 1 times [2020-07-29 01:44:41,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769725349] [2020-07-29 01:44:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:41,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {1985#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {1985#true} is VALID [2020-07-29 01:44:41,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {1985#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;main_~lk11~0 := 0; {1985#true} is VALID [2020-07-29 01:44:41,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {1985#true} assume !(0 != main_~p1~0); {1985#true} is VALID [2020-07-29 01:44:41,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {1985#true} assume !(0 != main_~p2~0); {1985#true} is VALID [2020-07-29 01:44:41,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {1985#true} assume !(0 != main_~p3~0); {1985#true} is VALID [2020-07-29 01:44:41,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {1985#true} assume !(0 != main_~p4~0); {1985#true} is VALID [2020-07-29 01:44:41,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {1985#true} assume 0 != main_~p5~0;main_~lk5~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,522 INFO L280 TraceCheckUtils]: 7: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p6~0;main_~lk6~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p11~0); {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p1~0); {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p2~0); {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p3~0); {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p4~0); {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} is VALID [2020-07-29 01:44:41,531 INFO L280 TraceCheckUtils]: 17: Hoare triple {1987#(not (= 0 ULTIMATE.start_main_~p5~0))} assume !(0 != main_~p5~0); {1986#false} is VALID [2020-07-29 01:44:41,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {1986#false} assume !(0 != main_~p6~0); {1986#false} is VALID [2020-07-29 01:44:41,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {1986#false} assume !(0 != main_~p7~0); {1986#false} is VALID [2020-07-29 01:44:41,532 INFO L280 TraceCheckUtils]: 20: Hoare triple {1986#false} assume !(0 != main_~p8~0); {1986#false} is VALID [2020-07-29 01:44:41,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {1986#false} assume !(0 != main_~p9~0); {1986#false} is VALID [2020-07-29 01:44:41,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {1986#false} assume !(0 != main_~p10~0); {1986#false} is VALID [2020-07-29 01:44:41,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {1986#false} assume !(0 != main_~p11~0); {1986#false} is VALID [2020-07-29 01:44:41,534 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,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769725349] [2020-07-29 01:44:41,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:41,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:41,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807689350] [2020-07-29 01:44:41,536 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:41,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:41,538 INFO L87 Difference]: Start difference. First operand 269 states and 421 transitions. cyclomatic complexity: 160 Second operand 3 states. [2020-07-29 01:44:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,689 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2020-07-29 01:44:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:41,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:41,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:41,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,758 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-07-29 01:44:41,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 529 states and 817 transitions. [2020-07-29 01:44:41,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2020-07-29 01:44:41,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2020-07-29 01:44:41,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:41,797 INFO L688 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2020-07-29 01:44:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-07-29 01:44:41,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:41,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states and 817 transitions. Second operand 529 states. [2020-07-29 01:44:41,813 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states and 817 transitions. Second operand 529 states. [2020-07-29 01:44:41,814 INFO L87 Difference]: Start difference. First operand 529 states and 817 transitions. Second operand 529 states. [2020-07-29 01:44:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,840 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2020-07-29 01:44:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,842 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand 529 states and 817 transitions. [2020-07-29 01:44:41,842 INFO L87 Difference]: Start difference. First operand 529 states. Second operand 529 states and 817 transitions. [2020-07-29 01:44:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:41,867 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2020-07-29 01:44:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:41,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:41,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:41,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-07-29 01:44:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 817 transitions. [2020-07-29 01:44:41,889 INFO L711 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2020-07-29 01:44:41,889 INFO L591 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2020-07-29 01:44:41,890 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:44:41,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 817 transitions. [2020-07-29 01:44:41,893 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-07-29 01:44:41,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:41,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:41,894 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:41,895 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, 1, 1] [2020-07-29 01:44:41,895 INFO L794 eck$LassoCheckResult]: Stem: 2557#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 2558#L167-1 [2020-07-29 01:44:41,895 INFO L796 eck$LassoCheckResult]: Loop: 2558#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 2640#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 2636#L71 assume !(0 != main_~p1~0); 2632#L71-2 assume !(0 != main_~p2~0); 2630#L75-1 assume !(0 != main_~p3~0); 2628#L79-1 assume !(0 != main_~p4~0); 2624#L83-1 assume !(0 != main_~p5~0); 2622#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2620#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2618#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2616#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2614#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2612#L107-1 assume !(0 != main_~p11~0); 2608#L111-1 assume !(0 != main_~p1~0); 2604#L117-1 assume !(0 != main_~p2~0); 2600#L122-1 assume !(0 != main_~p3~0); 2597#L127-1 assume !(0 != main_~p4~0); 2598#L132-1 assume !(0 != main_~p5~0); 2664#L137-1 assume !(0 != main_~p6~0); 2660#L142-1 assume !(0 != main_~p7~0); 2656#L147-1 assume !(0 != main_~p8~0); 2652#L152-1 assume !(0 != main_~p9~0); 2648#L157-1 assume !(0 != main_~p10~0); 2644#L162-1 assume !(0 != main_~p11~0); 2558#L167-1 [2020-07-29 01:44:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-07-29 01:44:41,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309518700] [2020-07-29 01:44:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:41,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:41,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash 749207524, now seen corresponding path program 1 times [2020-07-29 01:44:41,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:41,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810352638] [2020-07-29 01:44:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:41,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {4109#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {4109#true} is VALID [2020-07-29 01:44:41,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {4109#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;main_~lk11~0 := 0; {4109#true} is VALID [2020-07-29 01:44:41,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {4109#true} assume !(0 != main_~p1~0); {4109#true} is VALID [2020-07-29 01:44:41,969 INFO L280 TraceCheckUtils]: 3: Hoare triple {4109#true} assume !(0 != main_~p2~0); {4109#true} is VALID [2020-07-29 01:44:41,970 INFO L280 TraceCheckUtils]: 4: Hoare triple {4109#true} assume !(0 != main_~p3~0); {4109#true} is VALID [2020-07-29 01:44:41,970 INFO L280 TraceCheckUtils]: 5: Hoare triple {4109#true} assume !(0 != main_~p4~0); {4109#true} is VALID [2020-07-29 01:44:41,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {4109#true} assume !(0 != main_~p5~0); {4109#true} is VALID [2020-07-29 01:44:41,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {4109#true} assume 0 != main_~p6~0;main_~lk6~0 := 1; {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p7~0;main_~lk7~0 := 1; {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,979 INFO L280 TraceCheckUtils]: 11: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,980 INFO L280 TraceCheckUtils]: 12: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p11~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p1~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p2~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p3~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,983 INFO L280 TraceCheckUtils]: 16: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p4~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p5~0); {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} is VALID [2020-07-29 01:44:41,984 INFO L280 TraceCheckUtils]: 18: Hoare triple {4111#(not (= 0 ULTIMATE.start_main_~p6~0))} assume !(0 != main_~p6~0); {4110#false} is VALID [2020-07-29 01:44:41,984 INFO L280 TraceCheckUtils]: 19: Hoare triple {4110#false} assume !(0 != main_~p7~0); {4110#false} is VALID [2020-07-29 01:44:41,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {4110#false} assume !(0 != main_~p8~0); {4110#false} is VALID [2020-07-29 01:44:41,985 INFO L280 TraceCheckUtils]: 21: Hoare triple {4110#false} assume !(0 != main_~p9~0); {4110#false} is VALID [2020-07-29 01:44:41,985 INFO L280 TraceCheckUtils]: 22: Hoare triple {4110#false} assume !(0 != main_~p10~0); {4110#false} is VALID [2020-07-29 01:44:41,986 INFO L280 TraceCheckUtils]: 23: Hoare triple {4110#false} assume !(0 != main_~p11~0); {4110#false} is VALID [2020-07-29 01:44:41,988 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,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810352638] [2020-07-29 01:44:41,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:41,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:41,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765653159] [2020-07-29 01:44:41,989 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:41,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:41,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:41,990 INFO L87 Difference]: Start difference. First operand 529 states and 817 transitions. cyclomatic complexity: 304 Second operand 3 states. [2020-07-29 01:44:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,161 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2020-07-29 01:44:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:42,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:42,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:42,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,253 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-07-29 01:44:42,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1585 transitions. [2020-07-29 01:44:42,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2020-07-29 01:44:42,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1041 [2020-07-29 01:44:42,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:42,321 INFO L688 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2020-07-29 01:44:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2020-07-29 01:44:42,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:42,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1041 states and 1585 transitions. Second operand 1041 states. [2020-07-29 01:44:42,339 INFO L74 IsIncluded]: Start isIncluded. First operand 1041 states and 1585 transitions. Second operand 1041 states. [2020-07-29 01:44:42,339 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. Second operand 1041 states. [2020-07-29 01:44:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,424 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2020-07-29 01:44:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:42,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:42,426 INFO L74 IsIncluded]: Start isIncluded. First operand 1041 states. Second operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,426 INFO L87 Difference]: Start difference. First operand 1041 states. Second operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:42,517 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2020-07-29 01:44:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:42,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:42,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:42,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2020-07-29 01:44:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1585 transitions. [2020-07-29 01:44:42,589 INFO L711 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2020-07-29 01:44:42,589 INFO L591 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2020-07-29 01:44:42,589 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:44:42,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1041 states and 1585 transitions. [2020-07-29 01:44:42,596 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-07-29 01:44:42,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:42,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:42,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:42,598 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, 1, 1] [2020-07-29 01:44:42,598 INFO L794 eck$LassoCheckResult]: Stem: 5198#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 5199#L167-1 [2020-07-29 01:44:42,598 INFO L796 eck$LassoCheckResult]: Loop: 5199#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 5301#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 5297#L71 assume !(0 != main_~p1~0); 5293#L71-2 assume !(0 != main_~p2~0); 5291#L75-1 assume !(0 != main_~p3~0); 5289#L79-1 assume !(0 != main_~p4~0); 5285#L83-1 assume !(0 != main_~p5~0); 5281#L87-1 assume !(0 != main_~p6~0); 5279#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 5277#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5275#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5273#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5271#L107-1 assume !(0 != main_~p11~0); 5267#L111-1 assume !(0 != main_~p1~0); 5263#L117-1 assume !(0 != main_~p2~0); 5259#L122-1 assume !(0 != main_~p3~0); 5256#L127-1 assume !(0 != main_~p4~0); 5257#L132-1 assume !(0 != main_~p5~0); 5324#L137-1 assume !(0 != main_~p6~0); 5321#L142-1 assume !(0 != main_~p7~0); 5317#L147-1 assume !(0 != main_~p8~0); 5313#L152-1 assume !(0 != main_~p9~0); 5309#L157-1 assume !(0 != main_~p10~0); 5305#L162-1 assume !(0 != main_~p11~0); 5199#L167-1 [2020-07-29 01:44:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2020-07-29 01:44:42,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:42,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558602136] [2020-07-29 01:44:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:42,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:42,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash -839140378, now seen corresponding path program 1 times [2020-07-29 01:44:42,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:42,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177327869] [2020-07-29 01:44:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:42,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {8281#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {8281#true} is VALID [2020-07-29 01:44:42,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {8281#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;main_~lk11~0 := 0; {8281#true} is VALID [2020-07-29 01:44:42,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {8281#true} assume !(0 != main_~p1~0); {8281#true} is VALID [2020-07-29 01:44:42,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {8281#true} assume !(0 != main_~p2~0); {8281#true} is VALID [2020-07-29 01:44:42,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {8281#true} assume !(0 != main_~p3~0); {8281#true} is VALID [2020-07-29 01:44:42,661 INFO L280 TraceCheckUtils]: 5: Hoare triple {8281#true} assume !(0 != main_~p4~0); {8281#true} is VALID [2020-07-29 01:44:42,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {8281#true} assume !(0 != main_~p5~0); {8281#true} is VALID [2020-07-29 01:44:42,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {8281#true} assume !(0 != main_~p6~0); {8281#true} is VALID [2020-07-29 01:44:42,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {8281#true} assume 0 != main_~p7~0;main_~lk7~0 := 1; {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p8~0;main_~lk8~0 := 1; {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,665 INFO L280 TraceCheckUtils]: 10: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,666 INFO L280 TraceCheckUtils]: 12: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p11~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p1~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,668 INFO L280 TraceCheckUtils]: 14: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p2~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p3~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p4~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,672 INFO L280 TraceCheckUtils]: 17: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p5~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,672 INFO L280 TraceCheckUtils]: 18: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p6~0); {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} is VALID [2020-07-29 01:44:42,673 INFO L280 TraceCheckUtils]: 19: Hoare triple {8283#(not (= 0 ULTIMATE.start_main_~p7~0))} assume !(0 != main_~p7~0); {8282#false} is VALID [2020-07-29 01:44:42,673 INFO L280 TraceCheckUtils]: 20: Hoare triple {8282#false} assume !(0 != main_~p8~0); {8282#false} is VALID [2020-07-29 01:44:42,674 INFO L280 TraceCheckUtils]: 21: Hoare triple {8282#false} assume !(0 != main_~p9~0); {8282#false} is VALID [2020-07-29 01:44:42,674 INFO L280 TraceCheckUtils]: 22: Hoare triple {8282#false} assume !(0 != main_~p10~0); {8282#false} is VALID [2020-07-29 01:44:42,674 INFO L280 TraceCheckUtils]: 23: Hoare triple {8282#false} assume !(0 != main_~p11~0); {8282#false} is VALID [2020-07-29 01:44:42,676 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,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177327869] [2020-07-29 01:44:42,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:42,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:42,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752098702] [2020-07-29 01:44:42,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:42,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:42,680 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. cyclomatic complexity: 576 Second operand 3 states. [2020-07-29 01:44:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:43,031 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2020-07-29 01:44:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:43,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:43,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:43,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,244 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-07-29 01:44:43,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2049 states to 2049 states and 3073 transitions. [2020-07-29 01:44:43,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2049 [2020-07-29 01:44:43,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2049 [2020-07-29 01:44:43,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:43,425 INFO L688 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2020-07-29 01:44:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2020-07-29 01:44:43,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:43,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2049 states and 3073 transitions. Second operand 2049 states. [2020-07-29 01:44:43,460 INFO L74 IsIncluded]: Start isIncluded. First operand 2049 states and 3073 transitions. Second operand 2049 states. [2020-07-29 01:44:43,460 INFO L87 Difference]: Start difference. First operand 2049 states and 3073 transitions. Second operand 2049 states. [2020-07-29 01:44:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:43,656 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2020-07-29 01:44:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:43,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:43,660 INFO L74 IsIncluded]: Start isIncluded. First operand 2049 states. Second operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,660 INFO L87 Difference]: Start difference. First operand 2049 states. Second operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:43,820 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2020-07-29 01:44:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:43,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:43,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:43,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:43,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2020-07-29 01:44:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3073 transitions. [2020-07-29 01:44:43,995 INFO L711 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2020-07-29 01:44:43,995 INFO L591 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2020-07-29 01:44:43,995 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:44:43,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2049 states and 3073 transitions. [2020-07-29 01:44:44,005 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-07-29 01:44:44,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:44,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:44,006 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:44,006 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, 1, 1] [2020-07-29 01:44:44,006 INFO L794 eck$LassoCheckResult]: Stem: 10375#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 10376#L167-1 [2020-07-29 01:44:44,007 INFO L796 eck$LassoCheckResult]: Loop: 10376#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 10552#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 10549#L71 assume !(0 != main_~p1~0); 10550#L71-2 assume !(0 != main_~p2~0); 10530#L75-1 assume !(0 != main_~p3~0); 10531#L79-1 assume !(0 != main_~p4~0); 10516#L83-1 assume !(0 != main_~p5~0); 10517#L87-1 assume !(0 != main_~p6~0); 10494#L91-1 assume !(0 != main_~p7~0); 10496#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 10480#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10481#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 10465#L107-1 assume !(0 != main_~p11~0); 10466#L111-1 assume !(0 != main_~p1~0); 10584#L117-1 assume !(0 != main_~p2~0); 10582#L122-1 assume !(0 != main_~p3~0); 10580#L127-1 assume !(0 != main_~p4~0); 10578#L132-1 assume !(0 != main_~p5~0); 10574#L137-1 assume !(0 != main_~p6~0); 10570#L142-1 assume !(0 != main_~p7~0); 10567#L147-1 assume !(0 != main_~p8~0); 10565#L152-1 assume !(0 != main_~p9~0); 10561#L157-1 assume !(0 != main_~p10~0); 10557#L162-1 assume !(0 != main_~p11~0); 10376#L167-1 [2020-07-29 01:44:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2020-07-29 01:44:44,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:44,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805836815] [2020-07-29 01:44:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:44,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:44,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:44,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1860208732, now seen corresponding path program 1 times [2020-07-29 01:44:44,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:44,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744939139] [2020-07-29 01:44:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:44,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {16485#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {16485#true} is VALID [2020-07-29 01:44:44,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {16485#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;main_~lk11~0 := 0; {16485#true} is VALID [2020-07-29 01:44:44,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {16485#true} assume !(0 != main_~p1~0); {16485#true} is VALID [2020-07-29 01:44:44,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {16485#true} assume !(0 != main_~p2~0); {16485#true} is VALID [2020-07-29 01:44:44,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {16485#true} assume !(0 != main_~p3~0); {16485#true} is VALID [2020-07-29 01:44:44,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {16485#true} assume !(0 != main_~p4~0); {16485#true} is VALID [2020-07-29 01:44:44,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {16485#true} assume !(0 != main_~p5~0); {16485#true} is VALID [2020-07-29 01:44:44,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {16485#true} assume !(0 != main_~p6~0); {16485#true} is VALID [2020-07-29 01:44:44,048 INFO L280 TraceCheckUtils]: 8: Hoare triple {16485#true} assume !(0 != main_~p7~0); {16485#true} is VALID [2020-07-29 01:44:44,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {16485#true} assume 0 != main_~p8~0;main_~lk8~0 := 1; {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume 0 != main_~p9~0;main_~lk9~0 := 1; {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p11~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p1~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p2~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p3~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,061 INFO L280 TraceCheckUtils]: 16: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p4~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p5~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p6~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p7~0); {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} is VALID [2020-07-29 01:44:44,063 INFO L280 TraceCheckUtils]: 20: Hoare triple {16487#(not (= 0 ULTIMATE.start_main_~p8~0))} assume !(0 != main_~p8~0); {16486#false} is VALID [2020-07-29 01:44:44,063 INFO L280 TraceCheckUtils]: 21: Hoare triple {16486#false} assume !(0 != main_~p9~0); {16486#false} is VALID [2020-07-29 01:44:44,064 INFO L280 TraceCheckUtils]: 22: Hoare triple {16486#false} assume !(0 != main_~p10~0); {16486#false} is VALID [2020-07-29 01:44:44,064 INFO L280 TraceCheckUtils]: 23: Hoare triple {16486#false} assume !(0 != main_~p11~0); {16486#false} is VALID [2020-07-29 01:44:44,065 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,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744939139] [2020-07-29 01:44:44,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:44,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:44,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385526630] [2020-07-29 01:44:44,067 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:44,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:44,067 INFO L87 Difference]: Start difference. First operand 2049 states and 3073 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2020-07-29 01:44:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:44,669 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2020-07-29 01:44:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:44,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:44,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:44,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:45,171 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-07-29 01:44:45,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4033 states to 4033 states and 5953 transitions. [2020-07-29 01:44:45,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4033 [2020-07-29 01:44:45,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4033 [2020-07-29 01:44:45,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:45,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:45,661 INFO L688 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2020-07-29 01:44:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4033. [2020-07-29 01:44:45,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:45,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4033 states and 5953 transitions. Second operand 4033 states. [2020-07-29 01:44:45,731 INFO L74 IsIncluded]: Start isIncluded. First operand 4033 states and 5953 transitions. Second operand 4033 states. [2020-07-29 01:44:45,731 INFO L87 Difference]: Start difference. First operand 4033 states and 5953 transitions. Second operand 4033 states. [2020-07-29 01:44:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:46,198 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2020-07-29 01:44:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:46,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:46,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:46,205 INFO L74 IsIncluded]: Start isIncluded. First operand 4033 states. Second operand 4033 states and 5953 transitions. [2020-07-29 01:44:46,205 INFO L87 Difference]: Start difference. First operand 4033 states. Second operand 4033 states and 5953 transitions. [2020-07-29 01:44:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:46,690 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2020-07-29 01:44:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:46,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:46,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:46,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:46,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2020-07-29 01:44:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5953 transitions. [2020-07-29 01:44:47,177 INFO L711 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2020-07-29 01:44:47,177 INFO L591 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2020-07-29 01:44:47,177 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:44:47,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4033 states and 5953 transitions. [2020-07-29 01:44:47,198 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-07-29 01:44:47,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:47,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:47,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:47,199 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, 1, 1] [2020-07-29 01:44:47,200 INFO L794 eck$LassoCheckResult]: Stem: 20569#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 20570#L167-1 [2020-07-29 01:44:47,200 INFO L796 eck$LassoCheckResult]: Loop: 20570#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 20754#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 20751#L71 assume !(0 != main_~p1~0); 20752#L71-2 assume !(0 != main_~p2~0); 20731#L75-1 assume !(0 != main_~p3~0); 20732#L79-1 assume !(0 != main_~p4~0); 20715#L83-1 assume !(0 != main_~p5~0); 20717#L87-1 assume !(0 != main_~p6~0); 20691#L91-1 assume !(0 != main_~p7~0); 20693#L95-1 assume !(0 != main_~p8~0); 20671#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 20672#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 20655#L107-1 assume !(0 != main_~p11~0); 20656#L111-1 assume !(0 != main_~p1~0); 20787#L117-1 assume !(0 != main_~p2~0); 20785#L122-1 assume !(0 != main_~p3~0); 20783#L127-1 assume !(0 != main_~p4~0); 20781#L132-1 assume !(0 != main_~p5~0); 20777#L137-1 assume !(0 != main_~p6~0); 20773#L142-1 assume !(0 != main_~p7~0); 20769#L147-1 assume !(0 != main_~p8~0); 20766#L152-1 assume !(0 != main_~p9~0); 20762#L157-1 assume !(0 != main_~p10~0); 20758#L162-1 assume !(0 != main_~p11~0); 20570#L167-1 [2020-07-29 01:44:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2020-07-29 01:44:47,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:47,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951020429] [2020-07-29 01:44:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:47,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:47,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:47,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1154894886, now seen corresponding path program 1 times [2020-07-29 01:44:47,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:47,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082044173] [2020-07-29 01:44:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:47,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {32625#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {32625#true} is VALID [2020-07-29 01:44:47,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {32625#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;main_~lk11~0 := 0; {32625#true} is VALID [2020-07-29 01:44:47,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {32625#true} assume !(0 != main_~p1~0); {32625#true} is VALID [2020-07-29 01:44:47,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {32625#true} assume !(0 != main_~p2~0); {32625#true} is VALID [2020-07-29 01:44:47,239 INFO L280 TraceCheckUtils]: 4: Hoare triple {32625#true} assume !(0 != main_~p3~0); {32625#true} is VALID [2020-07-29 01:44:47,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {32625#true} assume !(0 != main_~p4~0); {32625#true} is VALID [2020-07-29 01:44:47,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {32625#true} assume !(0 != main_~p5~0); {32625#true} is VALID [2020-07-29 01:44:47,240 INFO L280 TraceCheckUtils]: 7: Hoare triple {32625#true} assume !(0 != main_~p6~0); {32625#true} is VALID [2020-07-29 01:44:47,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {32625#true} assume !(0 != main_~p7~0); {32625#true} is VALID [2020-07-29 01:44:47,240 INFO L280 TraceCheckUtils]: 9: Hoare triple {32625#true} assume !(0 != main_~p8~0); {32625#true} is VALID [2020-07-29 01:44:47,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {32625#true} assume 0 != main_~p9~0;main_~lk9~0 := 1; {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,242 INFO L280 TraceCheckUtils]: 11: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume 0 != main_~p10~0;main_~lk10~0 := 1; {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,243 INFO L280 TraceCheckUtils]: 12: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p11~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p1~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p2~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,244 INFO L280 TraceCheckUtils]: 15: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p3~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,245 INFO L280 TraceCheckUtils]: 16: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p4~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,246 INFO L280 TraceCheckUtils]: 17: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p5~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,246 INFO L280 TraceCheckUtils]: 18: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p6~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p7~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,247 INFO L280 TraceCheckUtils]: 20: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p8~0); {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} is VALID [2020-07-29 01:44:47,248 INFO L280 TraceCheckUtils]: 21: Hoare triple {32627#(not (= 0 ULTIMATE.start_main_~p9~0))} assume !(0 != main_~p9~0); {32626#false} is VALID [2020-07-29 01:44:47,248 INFO L280 TraceCheckUtils]: 22: Hoare triple {32626#false} assume !(0 != main_~p10~0); {32626#false} is VALID [2020-07-29 01:44:47,248 INFO L280 TraceCheckUtils]: 23: Hoare triple {32626#false} assume !(0 != main_~p11~0); {32626#false} is VALID [2020-07-29 01:44:47,249 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,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082044173] [2020-07-29 01:44:47,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:47,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:47,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830843338] [2020-07-29 01:44:47,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:47,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:47,254 INFO L87 Difference]: Start difference. First operand 4033 states and 5953 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2020-07-29 01:44:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:49,153 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2020-07-29 01:44:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:44:49,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:44:49,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:44:49,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:50,958 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-07-29 01:44:52,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7937 states to 7937 states and 11521 transitions. [2020-07-29 01:44:52,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7937 [2020-07-29 01:44:52,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7937 [2020-07-29 01:44:52,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:52,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:44:52,761 INFO L688 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2020-07-29 01:44:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 7937. [2020-07-29 01:44:52,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:44:52,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7937 states and 11521 transitions. Second operand 7937 states. [2020-07-29 01:44:52,895 INFO L74 IsIncluded]: Start isIncluded. First operand 7937 states and 11521 transitions. Second operand 7937 states. [2020-07-29 01:44:52,896 INFO L87 Difference]: Start difference. First operand 7937 states and 11521 transitions. Second operand 7937 states. [2020-07-29 01:44:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:54,841 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2020-07-29 01:44:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:54,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:54,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:54,850 INFO L74 IsIncluded]: Start isIncluded. First operand 7937 states. Second operand 7937 states and 11521 transitions. [2020-07-29 01:44:54,850 INFO L87 Difference]: Start difference. First operand 7937 states. Second operand 7937 states and 11521 transitions. [2020-07-29 01:44:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:44:56,626 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2020-07-29 01:44:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:56,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:44:56,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:44:56,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:44:56,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:44:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2020-07-29 01:44:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 11521 transitions. [2020-07-29 01:44:58,540 INFO L711 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2020-07-29 01:44:58,541 INFO L591 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2020-07-29 01:44:58,541 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:44:58,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7937 states and 11521 transitions. [2020-07-29 01:44:58,564 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-07-29 01:44:58,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:44:58,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:44:58,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:44:58,565 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, 1, 1] [2020-07-29 01:44:58,565 INFO L794 eck$LassoCheckResult]: Stem: 40614#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 40615#L167-1 [2020-07-29 01:44:58,566 INFO L796 eck$LassoCheckResult]: Loop: 40615#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 40728#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 40724#L71 assume !(0 != main_~p1~0); 40720#L71-2 assume !(0 != main_~p2~0); 40718#L75-1 assume !(0 != main_~p3~0); 40716#L79-1 assume !(0 != main_~p4~0); 40712#L83-1 assume !(0 != main_~p5~0); 40708#L87-1 assume !(0 != main_~p6~0); 40704#L91-1 assume !(0 != main_~p7~0); 40700#L95-1 assume !(0 != main_~p8~0); 40696#L99-1 assume !(0 != main_~p9~0); 40694#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 40692#L107-1 assume !(0 != main_~p11~0); 40688#L111-1 assume !(0 != main_~p1~0); 40684#L117-1 assume !(0 != main_~p2~0); 40680#L122-1 assume !(0 != main_~p3~0); 40677#L127-1 assume !(0 != main_~p4~0); 40678#L132-1 assume !(0 != main_~p5~0); 40751#L137-1 assume !(0 != main_~p6~0); 40747#L142-1 assume !(0 != main_~p7~0); 40743#L147-1 assume !(0 != main_~p8~0); 40739#L152-1 assume !(0 != main_~p9~0); 40736#L157-1 assume !(0 != main_~p10~0); 40732#L162-1 assume !(0 != main_~p11~0); 40615#L167-1 [2020-07-29 01:44:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2020-07-29 01:44:58,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:58,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787970218] [2020-07-29 01:44:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:58,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:44:58,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:44:58,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:44:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:44:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 143777636, now seen corresponding path program 1 times [2020-07-29 01:44:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:44:58,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701956694] [2020-07-29 01:44:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:44:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:44:58,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {64381#true} assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {64381#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;main_~lk11~0 := 0; {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {64381#true} assume !(0 != main_~p1~0); {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 3: Hoare triple {64381#true} assume !(0 != main_~p2~0); {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {64381#true} assume !(0 != main_~p3~0); {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {64381#true} assume !(0 != main_~p4~0); {64381#true} is VALID [2020-07-29 01:44:58,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {64381#true} assume !(0 != main_~p5~0); {64381#true} is VALID [2020-07-29 01:44:58,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {64381#true} assume !(0 != main_~p6~0); {64381#true} is VALID [2020-07-29 01:44:58,600 INFO L280 TraceCheckUtils]: 8: Hoare triple {64381#true} assume !(0 != main_~p7~0); {64381#true} is VALID [2020-07-29 01:44:58,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {64381#true} assume !(0 != main_~p8~0); {64381#true} is VALID [2020-07-29 01:44:58,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {64381#true} assume !(0 != main_~p9~0); {64381#true} is VALID [2020-07-29 01:44:58,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {64381#true} assume 0 != main_~p10~0;main_~lk10~0 := 1; {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p11~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p1~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,607 INFO L280 TraceCheckUtils]: 14: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p2~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,607 INFO L280 TraceCheckUtils]: 15: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p3~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p4~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p5~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p6~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p7~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p8~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,610 INFO L280 TraceCheckUtils]: 21: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p9~0); {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} is VALID [2020-07-29 01:44:58,611 INFO L280 TraceCheckUtils]: 22: Hoare triple {64383#(not (= 0 ULTIMATE.start_main_~p10~0))} assume !(0 != main_~p10~0); {64382#false} is VALID [2020-07-29 01:44:58,611 INFO L280 TraceCheckUtils]: 23: Hoare triple {64382#false} assume !(0 != main_~p11~0); {64382#false} is VALID [2020-07-29 01:44:58,612 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:58,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701956694] [2020-07-29 01:44:58,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:44:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:44:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121572585] [2020-07-29 01:44:58,613 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:44:58,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:44:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:44:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:44:58,613 INFO L87 Difference]: Start difference. First operand 7937 states and 11521 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2020-07-29 01:45:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:08,113 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2020-07-29 01:45:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:45:08,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:45:08,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:45:08,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:16,954 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-07-29 01:45:24,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15617 states to 15617 states and 22273 transitions. [2020-07-29 01:45:24,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15617 [2020-07-29 01:45:24,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15617 [2020-07-29 01:45:24,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:24,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:45:24,869 INFO L688 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2020-07-29 01:45:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 15617. [2020-07-29 01:45:25,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:45:25,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15617 states and 22273 transitions. Second operand 15617 states. [2020-07-29 01:45:25,082 INFO L74 IsIncluded]: Start isIncluded. First operand 15617 states and 22273 transitions. Second operand 15617 states. [2020-07-29 01:45:25,083 INFO L87 Difference]: Start difference. First operand 15617 states and 22273 transitions. Second operand 15617 states. [2020-07-29 01:45:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:32,411 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2020-07-29 01:45:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:32,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:32,426 INFO L74 IsIncluded]: Start isIncluded. First operand 15617 states. Second operand 15617 states and 22273 transitions. [2020-07-29 01:45:32,426 INFO L87 Difference]: Start difference. First operand 15617 states. Second operand 15617 states and 22273 transitions. [2020-07-29 01:45:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:45:39,791 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2020-07-29 01:45:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:39,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:45:39,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:45:39,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:45:39,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:45:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2020-07-29 01:45:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 22273 transitions. [2020-07-29 01:45:48,554 INFO L711 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2020-07-29 01:45:48,554 INFO L591 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2020-07-29 01:45:48,554 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:45:48,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15617 states and 22273 transitions. [2020-07-29 01:45:48,605 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-07-29 01:45:48,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:45:48,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:45:48,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:45:48,607 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, 1, 1] [2020-07-29 01:45:48,607 INFO L794 eck$LassoCheckResult]: Stem: 80045#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_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~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;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 80046#L167-1 [2020-07-29 01:45:48,607 INFO L796 eck$LassoCheckResult]: Loop: 80046#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 80317#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 80315#L71 assume !(0 != main_~p1~0); 80313#L71-2 assume !(0 != main_~p2~0); 80310#L75-1 assume !(0 != main_~p3~0); 80307#L79-1 assume !(0 != main_~p4~0); 80303#L83-1 assume !(0 != main_~p5~0); 80299#L87-1 assume !(0 != main_~p6~0); 80295#L91-1 assume !(0 != main_~p7~0); 80291#L95-1 assume !(0 != main_~p8~0); 80287#L99-1 assume !(0 != main_~p9~0); 80283#L103-1 assume !(0 != main_~p10~0); 80284#L107-1 assume !(0 != main_~p11~0); 80274#L111-1 assume !(0 != main_~p1~0); 80276#L117-1 assume !(0 != main_~p2~0); 80348#L122-1 assume !(0 != main_~p3~0); 80344#L127-1 assume !(0 != main_~p4~0); 80340#L132-1 assume !(0 != main_~p5~0); 80336#L137-1 assume !(0 != main_~p6~0); 80333#L142-1 assume !(0 != main_~p7~0); 80329#L147-1 assume !(0 != main_~p8~0); 80325#L152-1 assume !(0 != main_~p9~0); 80322#L157-1 assume !(0 != main_~p10~0); 80321#L162-1 assume !(0 != main_~p11~0); 80046#L167-1 [2020-07-29 01:45:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2020-07-29 01:45:48,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:48,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81593196] [2020-07-29 01:45:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash -443028378, now seen corresponding path program 1 times [2020-07-29 01:45:48,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:48,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955697856] [2020-07-29 01:45:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:45:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -412008571, now seen corresponding path program 1 times [2020-07-29 01:45:48,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:45:48,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15783663] [2020-07-29 01:45:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:45:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:45:48,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:45:48,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:45:48,787 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-29 01:45:49,046 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-29 01:45:49,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:45:49 BoogieIcfgContainer [2020-07-29 01:45:49,112 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:45:49,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:45:49,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:45:49,112 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:45:49,113 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:49,116 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:45:49,194 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:45:49,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:45:49,196 INFO L168 Benchmark]: Toolchain (without parser) took 70358.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -326.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:49,196 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:49,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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:49,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:49,198 INFO L168 Benchmark]: Boogie Preprocessor took 50.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:49,198 INFO L168 Benchmark]: RCFGBuilder took 513.33 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:49,199 INFO L168 Benchmark]: BuchiAutomizer took 69186.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.8 MB). Peak memory consumption was 451.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:45:49,199 INFO L168 Benchmark]: Witness Printer took 81.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:45:49,202 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 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.31 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 132.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 513.33 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 69186.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.8 MB). Peak memory consumption was 451.7 MB. Max. memory is 11.5 GB. * Witness Printer took 81.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. 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 15617 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 32.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 21.8s Buchi closure took 0.0s. Biggest automaton had 15617 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 787 SDtfs, 411 SDslu, 482 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: 42]: 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@20ad4862=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bbc31bb=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@678c57e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c1cd721=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69804f5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c0ba00b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1806835e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@162f0db0=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a0227dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@743e34e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68833e93=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66fa8993=0, lk11=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: 42]: 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; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...