./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.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 4892275a211cad54ffe3d940980c258aec58e47d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-0ed9222-m [2019-01-14 02:54:51,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:54:51,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:54:51,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:54:51,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:54:51,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:54:51,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:54:51,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:54:51,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:54:51,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:54:51,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:54:51,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:54:51,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:54:51,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:54:51,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:54:51,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:54:51,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:54:51,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:54:51,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:54:51,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:54:51,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:54:51,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:54:51,112 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:54:51,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:54:51,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:54:51,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:54:51,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:54:51,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:54:51,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:54:51,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:54:51,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:54:51,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:54:51,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:54:51,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:54:51,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:54:51,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:54:51,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:54:51,137 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:54:51,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:54:51,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:54:51,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:54:51,139 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:54:51,139 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:54:51,139 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:54:51,139 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:54:51,139 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:54:51,140 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:54:51,140 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:54:51,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:54:51,140 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:54:51,140 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:54:51,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:54:51,142 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:54:51,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:54:51,142 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:54:51,142 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:54:51,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:54:51,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:54:51,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:54:51,143 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:54:51,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:54:51,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:54:51,143 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:54:51,144 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:54:51,145 INFO L133 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 -> 4892275a211cad54ffe3d940980c258aec58e47d [2019-01-14 02:54:51,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:54:51,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:54:51,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:54:51,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:54:51,199 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:54:51,200 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:51,258 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a0bbfa2/fbf540f7d7774df8b8cbb85e300f3c10/FLAGd5cff99b7 [2019-01-14 02:54:51,726 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:54:51,727 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:51,737 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a0bbfa2/fbf540f7d7774df8b8cbb85e300f3c10/FLAGd5cff99b7 [2019-01-14 02:54:52,086 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a0bbfa2/fbf540f7d7774df8b8cbb85e300f3c10 [2019-01-14 02:54:52,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:54:52,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:54:52,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:52,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:54:52,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:54:52,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fc82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52, skipping insertion in model container [2019-01-14 02:54:52,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:54:52,146 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:54:52,455 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:52,461 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:54:52,496 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:52,512 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:54:52,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52 WrapperNode [2019-01-14 02:54:52,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:52,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:52,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:54:52,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:54:52,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:52,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:54:52,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:54:52,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:54:52,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (1/1) ... [2019-01-14 02:54:52,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:54:52,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:54:52,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:54:52,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:54:52,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (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 [2019-01-14 02:54:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:54:52,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:54:53,338 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:54:53,339 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:54:53,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:53 BoogieIcfgContainer [2019-01-14 02:54:53,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:54:53,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:54:53,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:54:53,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:54:53,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:53,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:54:52" (1/3) ... [2019-01-14 02:54:53,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@738a23db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:53, skipping insertion in model container [2019-01-14 02:54:53,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:53,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:52" (2/3) ... [2019-01-14 02:54:53,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@738a23db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:53, skipping insertion in model container [2019-01-14 02:54:53,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:53,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:53" (3/3) ... [2019-01-14 02:54:53,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:53,423 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:54:53,425 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:54:53,425 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:54:53,425 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:54:53,426 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:54:53,426 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:54:53,426 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:54:53,426 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:54:53,426 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:54:53,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-01-14 02:54:53,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-14 02:54:53,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:53,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:53,474 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:53,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:53,474 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:54:53,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-01-14 02:54:53,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-01-14 02:54:53,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:53,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:53,481 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:53,481 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:53,487 INFO L794 eck$LassoCheckResult]: Stem: 28#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2019-01-14 02:54:53,489 INFO L796 eck$LassoCheckResult]: Loop: 9#L223-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 41#L56true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L91-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L95-1true assume !(0 != main_~p3~0); 30#L99-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 21#L103-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 38#L107-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 43#L111-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 35#L115-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 52#L119-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 44#L123-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 49#L127-1true assume !(0 != main_~p11~0); 14#L131-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 6#L135-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 27#L139-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 32#L143-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 23#L147-1true assume !(0 != main_~p1~0); 15#L153-1true assume 0 != main_~p2~0; 50#L159true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 24#L158true assume !(0 != main_~p3~0); 54#L163-1true assume !(0 != main_~p4~0); 7#L168-1true assume !(0 != main_~p5~0); 40#L173-1true assume !(0 != main_~p6~0); 47#L178-1true assume !(0 != main_~p7~0); 29#L183-1true assume !(0 != main_~p8~0); 33#L188-1true assume !(0 != main_~p9~0); 11#L193-1true assume !(0 != main_~p10~0); 20#L198-1true assume !(0 != main_~p11~0); 51#L203-1true assume !(0 != main_~p12~0); 3#L208-1true assume !(0 != main_~p13~0); 26#L213-1true assume 0 != main_~p14~0; 5#L219true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 45#L218true assume !(0 != main_~p15~0); 9#L223-1true [2019-01-14 02:54:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:54:53,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:53,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 878446630, now seen corresponding path program 1 times [2019-01-14 02:54:53,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:53,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:53,754 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:53,772 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-01-14 02:54:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:53,900 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2019-01-14 02:54:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:53,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 189 transitions. [2019-01-14 02:54:53,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-01-14 02:54:53,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 94 states and 148 transitions. [2019-01-14 02:54:53,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-01-14 02:54:53,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-01-14 02:54:53,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 148 transitions. [2019-01-14 02:54:53,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:53,921 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-01-14 02:54:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 148 transitions. [2019-01-14 02:54:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-14 02:54:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 02:54:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2019-01-14 02:54:53,964 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-01-14 02:54:53,965 INFO L609 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-01-14 02:54:53,965 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:54:53,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 148 transitions. [2019-01-14 02:54:53,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-01-14 02:54:53,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:53,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:53,969 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:53,969 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:53,970 INFO L794 eck$LassoCheckResult]: Stem: 219#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 220#L223-1 [2019-01-14 02:54:53,971 INFO L796 eck$LassoCheckResult]: Loop: 220#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 200#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 201#L91 assume !(0 != main_~p1~0); 204#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 189#L95-1 assume !(0 != main_~p3~0); 190#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 240#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 237#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 234#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 232#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 230#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 229#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 228#L127-1 assume !(0 != main_~p11~0); 226#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 176#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 177#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 218#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 223#L147-1 assume !(0 != main_~p1~0); 224#L153-1 assume 0 != main_~p2~0; 259#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 258#L158 assume !(0 != main_~p3~0); 256#L163-1 assume !(0 != main_~p4~0); 254#L168-1 assume !(0 != main_~p5~0); 252#L173-1 assume !(0 != main_~p6~0); 250#L178-1 assume !(0 != main_~p7~0); 247#L183-1 assume !(0 != main_~p8~0); 246#L188-1 assume !(0 != main_~p9~0); 244#L193-1 assume !(0 != main_~p10~0); 211#L198-1 assume !(0 != main_~p11~0); 195#L203-1 assume !(0 != main_~p12~0); 166#L208-1 assume !(0 != main_~p13~0); 168#L213-1 assume 0 != main_~p14~0; 172#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 173#L218 assume !(0 != main_~p15~0); 220#L223-1 [2019-01-14 02:54:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:54:53,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:53,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:53,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1153206244, now seen corresponding path program 1 times [2019-01-14 02:54:53,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:53,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:54,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:54,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:54,088 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:54,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:54,089 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-01-14 02:54:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:54,164 INFO L93 Difference]: Finished difference Result 185 states and 289 transitions. [2019-01-14 02:54:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:54,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 289 transitions. [2019-01-14 02:54:54,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-01-14 02:54:54,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 185 states and 289 transitions. [2019-01-14 02:54:54,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2019-01-14 02:54:54,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2019-01-14 02:54:54,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 289 transitions. [2019-01-14 02:54:54,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:54,189 INFO L706 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-01-14 02:54:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 289 transitions. [2019-01-14 02:54:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-14 02:54:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-14 02:54:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-01-14 02:54:54,214 INFO L729 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-01-14 02:54:54,214 INFO L609 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-01-14 02:54:54,214 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:54:54,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 289 transitions. [2019-01-14 02:54:54,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-01-14 02:54:54,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:54,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:54,219 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:54,219 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:54,219 INFO L794 eck$LassoCheckResult]: Stem: 503#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 504#L223-1 [2019-01-14 02:54:54,220 INFO L796 eck$LassoCheckResult]: Loop: 504#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 584#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 583#L91 assume !(0 != main_~p1~0); 487#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 474#L95-1 assume !(0 != main_~p3~0); 475#L99-1 assume !(0 != main_~p4~0); 581#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 621#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 620#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 619#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 618#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 617#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 616#L127-1 assume !(0 != main_~p11~0); 615#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 614#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 613#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 612#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 610#L147-1 assume !(0 != main_~p1~0); 609#L153-1 assume 0 != main_~p2~0; 608#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 607#L158 assume !(0 != main_~p3~0); 605#L163-1 assume !(0 != main_~p4~0); 604#L168-1 assume !(0 != main_~p5~0); 602#L173-1 assume !(0 != main_~p6~0); 600#L178-1 assume !(0 != main_~p7~0); 505#L183-1 assume !(0 != main_~p8~0); 456#L188-1 assume !(0 != main_~p9~0); 458#L193-1 assume !(0 != main_~p10~0); 593#L198-1 assume !(0 != main_~p11~0); 592#L203-1 assume !(0 != main_~p12~0); 590#L208-1 assume !(0 != main_~p13~0); 588#L213-1 assume 0 != main_~p14~0; 587#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 586#L218 assume !(0 != main_~p15~0); 504#L223-1 [2019-01-14 02:54:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:54:54,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1755557658, now seen corresponding path program 1 times [2019-01-14 02:54:54,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:54,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:54,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:54,294 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:54,296 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-01-14 02:54:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:54,403 INFO L93 Difference]: Finished difference Result 365 states and 565 transitions. [2019-01-14 02:54:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:54,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 565 transitions. [2019-01-14 02:54:54,407 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-01-14 02:54:54,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 565 transitions. [2019-01-14 02:54:54,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-01-14 02:54:54,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2019-01-14 02:54:54,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 565 transitions. [2019-01-14 02:54:54,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:54,417 INFO L706 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-01-14 02:54:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 565 transitions. [2019-01-14 02:54:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-01-14 02:54:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-14 02:54:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2019-01-14 02:54:54,445 INFO L729 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-01-14 02:54:54,445 INFO L609 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-01-14 02:54:54,445 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:54:54,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 565 transitions. [2019-01-14 02:54:54,449 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-01-14 02:54:54,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:54,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:54,450 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:54,450 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:54,450 INFO L794 eck$LassoCheckResult]: Stem: 1062#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1063#L223-1 [2019-01-14 02:54:54,451 INFO L796 eck$LassoCheckResult]: Loop: 1063#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1217#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1215#L91 assume !(0 != main_~p1~0); 1213#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1211#L95-1 assume !(0 != main_~p3~0); 1209#L99-1 assume !(0 != main_~p4~0); 1202#L103-1 assume !(0 != main_~p5~0); 1204#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1194#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1195#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1189#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1190#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1184#L127-1 assume !(0 != main_~p11~0); 1185#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1178#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1179#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1172#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1173#L147-1 assume !(0 != main_~p1~0); 1167#L153-1 assume 0 != main_~p2~0; 1168#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1144#L158 assume !(0 != main_~p3~0); 1143#L163-1 assume !(0 != main_~p4~0); 1252#L168-1 assume !(0 != main_~p5~0); 1250#L173-1 assume !(0 != main_~p6~0); 1246#L178-1 assume !(0 != main_~p7~0); 1243#L183-1 assume !(0 != main_~p8~0); 1242#L188-1 assume !(0 != main_~p9~0); 1240#L193-1 assume !(0 != main_~p10~0); 1236#L198-1 assume !(0 != main_~p11~0); 1234#L203-1 assume !(0 != main_~p12~0); 1231#L208-1 assume !(0 != main_~p13~0); 1228#L213-1 assume 0 != main_~p14~0; 1227#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1222#L218 assume !(0 != main_~p15~0); 1063#L223-1 [2019-01-14 02:54:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:54:54,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:54,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2029936548, now seen corresponding path program 1 times [2019-01-14 02:54:54,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:54,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:54,545 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-01-14 02:54:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:54,603 INFO L93 Difference]: Finished difference Result 721 states and 1105 transitions. [2019-01-14 02:54:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:54,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1105 transitions. [2019-01-14 02:54:54,611 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-01-14 02:54:54,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1105 transitions. [2019-01-14 02:54:54,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2019-01-14 02:54:54,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2019-01-14 02:54:54,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1105 transitions. [2019-01-14 02:54:54,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:54,621 INFO L706 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-01-14 02:54:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1105 transitions. [2019-01-14 02:54:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-01-14 02:54:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-01-14 02:54:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1105 transitions. [2019-01-14 02:54:54,650 INFO L729 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-01-14 02:54:54,650 INFO L609 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-01-14 02:54:54,650 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:54:54,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 1105 transitions. [2019-01-14 02:54:54,656 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-01-14 02:54:54,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:54,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:54,658 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:54,658 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:54,658 INFO L794 eck$LassoCheckResult]: Stem: 2156#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2157#L223-1 [2019-01-14 02:54:54,658 INFO L796 eck$LassoCheckResult]: Loop: 2157#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2233#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2231#L91 assume !(0 != main_~p1~0); 2229#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2227#L95-1 assume !(0 != main_~p3~0); 2223#L99-1 assume !(0 != main_~p4~0); 2219#L103-1 assume !(0 != main_~p5~0); 2215#L107-1 assume !(0 != main_~p6~0); 2213#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2211#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2209#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2207#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2205#L127-1 assume !(0 != main_~p11~0); 2203#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2201#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2199#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2197#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2195#L147-1 assume !(0 != main_~p1~0); 2189#L153-1 assume 0 != main_~p2~0; 2190#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2181#L158 assume !(0 != main_~p3~0); 2180#L163-1 assume !(0 != main_~p4~0); 2276#L168-1 assume !(0 != main_~p5~0); 2272#L173-1 assume !(0 != main_~p6~0); 2269#L178-1 assume !(0 != main_~p7~0); 2264#L183-1 assume !(0 != main_~p8~0); 2261#L188-1 assume !(0 != main_~p9~0); 2257#L193-1 assume !(0 != main_~p10~0); 2252#L198-1 assume !(0 != main_~p11~0); 2249#L203-1 assume !(0 != main_~p12~0); 2245#L208-1 assume !(0 != main_~p13~0); 2242#L213-1 assume 0 != main_~p14~0; 2240#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2237#L218 assume !(0 != main_~p15~0); 2157#L223-1 [2019-01-14 02:54:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:54:54,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:54,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash -341802714, now seen corresponding path program 1 times [2019-01-14 02:54:54,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:54,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:54,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:54,753 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:54,755 INFO L87 Difference]: Start difference. First operand 721 states and 1105 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-01-14 02:54:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:54,802 INFO L93 Difference]: Finished difference Result 1425 states and 2161 transitions. [2019-01-14 02:54:54,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:54,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1425 states and 2161 transitions. [2019-01-14 02:54:54,824 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-01-14 02:54:54,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-01-14 02:54:54,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1425 [2019-01-14 02:54:54,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1425 [2019-01-14 02:54:54,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 2161 transitions. [2019-01-14 02:54:54,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:54,843 INFO L706 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-01-14 02:54:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 2161 transitions. [2019-01-14 02:54:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2019-01-14 02:54:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-01-14 02:54:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-01-14 02:54:54,885 INFO L729 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-01-14 02:54:54,885 INFO L609 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-01-14 02:54:54,885 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:54:54,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 2161 transitions. [2019-01-14 02:54:54,899 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-01-14 02:54:54,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:54,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:54,901 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:54,901 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:54,901 INFO L794 eck$LassoCheckResult]: Stem: 4308#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4309#L223-1 [2019-01-14 02:54:54,901 INFO L796 eck$LassoCheckResult]: Loop: 4309#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4386#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4384#L91 assume !(0 != main_~p1~0); 4382#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4380#L95-1 assume !(0 != main_~p3~0); 4376#L99-1 assume !(0 != main_~p4~0); 4372#L103-1 assume !(0 != main_~p5~0); 4368#L107-1 assume !(0 != main_~p6~0); 4364#L111-1 assume !(0 != main_~p7~0); 4362#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4360#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4358#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4356#L127-1 assume !(0 != main_~p11~0); 4354#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4352#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4350#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4348#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4346#L147-1 assume !(0 != main_~p1~0); 4340#L153-1 assume 0 != main_~p2~0; 4341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4334#L158 assume !(0 != main_~p3~0); 4333#L163-1 assume !(0 != main_~p4~0); 4429#L168-1 assume !(0 != main_~p5~0); 4425#L173-1 assume !(0 != main_~p6~0); 4421#L178-1 assume !(0 != main_~p7~0); 4417#L183-1 assume !(0 != main_~p8~0); 4414#L188-1 assume !(0 != main_~p9~0); 4410#L193-1 assume !(0 != main_~p10~0); 4405#L198-1 assume !(0 != main_~p11~0); 4402#L203-1 assume !(0 != main_~p12~0); 4398#L208-1 assume !(0 != main_~p13~0); 4395#L213-1 assume 0 != main_~p14~0; 4393#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4390#L218 assume !(0 != main_~p15~0); 4309#L223-1 [2019-01-14 02:54:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:54:54,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -279763100, now seen corresponding path program 1 times [2019-01-14 02:54:54,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:54,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:54,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:54,995 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:54,996 INFO L87 Difference]: Start difference. First operand 1425 states and 2161 transitions. cyclomatic complexity: 768 Second operand 3 states. [2019-01-14 02:54:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:55,091 INFO L93 Difference]: Finished difference Result 2817 states and 4225 transitions. [2019-01-14 02:54:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:55,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2817 states and 4225 transitions. [2019-01-14 02:54:55,121 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-01-14 02:54:55,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-01-14 02:54:55,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2817 [2019-01-14 02:54:55,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2817 [2019-01-14 02:54:55,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2817 states and 4225 transitions. [2019-01-14 02:54:55,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:55,153 INFO L706 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-01-14 02:54:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states and 4225 transitions. [2019-01-14 02:54:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-01-14 02:54:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-01-14 02:54:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-01-14 02:54:55,221 INFO L729 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-01-14 02:54:55,221 INFO L609 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-01-14 02:54:55,221 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:54:55,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2817 states and 4225 transitions. [2019-01-14 02:54:55,240 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-01-14 02:54:55,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,242 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,243 INFO L794 eck$LassoCheckResult]: Stem: 8559#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8560#L223-1 [2019-01-14 02:54:55,243 INFO L796 eck$LassoCheckResult]: Loop: 8560#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8673#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8669#L91 assume !(0 != main_~p1~0); 8665#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8661#L95-1 assume !(0 != main_~p3~0); 8654#L99-1 assume !(0 != main_~p4~0); 8646#L103-1 assume !(0 != main_~p5~0); 8638#L107-1 assume !(0 != main_~p6~0); 8630#L111-1 assume !(0 != main_~p7~0); 8624#L115-1 assume !(0 != main_~p8~0); 8619#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8620#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8613#L127-1 assume !(0 != main_~p11~0); 8614#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8607#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8608#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8601#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8602#L147-1 assume !(0 != main_~p1~0); 8593#L153-1 assume 0 != main_~p2~0; 8594#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8759#L158 assume !(0 != main_~p3~0); 8752#L163-1 assume !(0 != main_~p4~0); 8746#L168-1 assume !(0 != main_~p5~0); 8722#L173-1 assume !(0 != main_~p6~0); 8719#L178-1 assume !(0 != main_~p7~0); 8716#L183-1 assume !(0 != main_~p8~0); 8715#L188-1 assume !(0 != main_~p9~0); 8713#L193-1 assume !(0 != main_~p10~0); 8710#L198-1 assume !(0 != main_~p11~0); 8709#L203-1 assume !(0 != main_~p12~0); 8707#L208-1 assume !(0 != main_~p13~0); 8704#L213-1 assume 0 != main_~p14~0; 8701#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8682#L218 assume !(0 != main_~p15~0); 8560#L223-1 [2019-01-14 02:54:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,244 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:54:55,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,259 INFO L82 PathProgramCache]: Analyzing trace with hash -139214490, now seen corresponding path program 1 times [2019-01-14 02:54:55,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:55,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:55,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:55,338 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:55,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:55,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:55,338 INFO L87 Difference]: Start difference. First operand 2817 states and 4225 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2019-01-14 02:54:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:55,457 INFO L93 Difference]: Finished difference Result 5569 states and 8257 transitions. [2019-01-14 02:54:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:55,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5569 states and 8257 transitions. [2019-01-14 02:54:55,501 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-01-14 02:54:55,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-01-14 02:54:55,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5569 [2019-01-14 02:54:55,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5569 [2019-01-14 02:54:55,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5569 states and 8257 transitions. [2019-01-14 02:54:55,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:55,575 INFO L706 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-01-14 02:54:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states and 8257 transitions. [2019-01-14 02:54:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5569. [2019-01-14 02:54:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-01-14 02:54:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-01-14 02:54:55,709 INFO L729 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-01-14 02:54:55,709 INFO L609 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-01-14 02:54:55,709 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:54:55,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5569 states and 8257 transitions. [2019-01-14 02:54:55,736 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-01-14 02:54:55,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,737 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,738 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,739 INFO L794 eck$LassoCheckResult]: Stem: 16945#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 16946#L223-1 [2019-01-14 02:54:55,739 INFO L796 eck$LassoCheckResult]: Loop: 16946#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17472#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17468#L91 assume !(0 != main_~p1~0); 17465#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17461#L95-1 assume !(0 != main_~p3~0); 17457#L99-1 assume !(0 != main_~p4~0); 17449#L103-1 assume !(0 != main_~p5~0); 17441#L107-1 assume !(0 != main_~p6~0); 17433#L111-1 assume !(0 != main_~p7~0); 17425#L115-1 assume !(0 != main_~p8~0); 17421#L119-1 assume !(0 != main_~p9~0); 17417#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17413#L127-1 assume !(0 != main_~p11~0); 17409#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17405#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17401#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17397#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17390#L147-1 assume !(0 != main_~p1~0); 17386#L153-1 assume 0 != main_~p2~0; 17383#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17377#L158 assume !(0 != main_~p3~0); 17369#L163-1 assume !(0 != main_~p4~0); 17370#L168-1 assume !(0 != main_~p5~0); 17503#L173-1 assume !(0 != main_~p6~0); 17501#L178-1 assume !(0 != main_~p7~0); 17496#L183-1 assume !(0 != main_~p8~0); 17492#L188-1 assume !(0 != main_~p9~0); 17490#L193-1 assume !(0 != main_~p10~0); 17487#L198-1 assume !(0 != main_~p11~0); 17486#L203-1 assume !(0 != main_~p12~0); 17483#L208-1 assume !(0 != main_~p13~0); 17481#L213-1 assume 0 != main_~p14~0; 17480#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17476#L218 assume !(0 != main_~p15~0); 16946#L223-1 [2019-01-14 02:54:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-14 02:54:55,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -273227996, now seen corresponding path program 1 times [2019-01-14 02:54:55,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:55,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:55,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:55,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:55,837 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:55,838 INFO L87 Difference]: Start difference. First operand 5569 states and 8257 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2019-01-14 02:54:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:55,903 INFO L93 Difference]: Finished difference Result 11009 states and 16129 transitions. [2019-01-14 02:54:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:55,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11009 states and 16129 transitions. [2019-01-14 02:54:55,962 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-01-14 02:54:56,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-01-14 02:54:56,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11009 [2019-01-14 02:54:56,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11009 [2019-01-14 02:54:56,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11009 states and 16129 transitions. [2019-01-14 02:54:56,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:56,064 INFO L706 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-01-14 02:54:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states and 16129 transitions. [2019-01-14 02:54:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11009. [2019-01-14 02:54:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11009 states. [2019-01-14 02:54:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-01-14 02:54:56,403 INFO L729 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-01-14 02:54:56,403 INFO L609 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-01-14 02:54:56,403 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:54:56,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11009 states and 16129 transitions. [2019-01-14 02:54:56,448 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-01-14 02:54:56,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:56,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:56,450 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:56,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:56,451 INFO L794 eck$LassoCheckResult]: Stem: 33534#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 33535#L223-1 [2019-01-14 02:54:56,452 INFO L796 eck$LassoCheckResult]: Loop: 33535#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 33828#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33824#L91 assume !(0 != main_~p1~0); 33822#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33820#L95-1 assume !(0 != main_~p3~0); 33816#L99-1 assume !(0 != main_~p4~0); 33813#L103-1 assume !(0 != main_~p5~0); 33814#L107-1 assume !(0 != main_~p6~0); 33748#L111-1 assume !(0 != main_~p7~0); 33750#L115-1 assume !(0 != main_~p8~0); 33884#L119-1 assume !(0 != main_~p9~0); 33722#L123-1 assume !(0 != main_~p10~0); 33724#L127-1 assume !(0 != main_~p11~0); 33707#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33708#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33697#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33698#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33685#L147-1 assume !(0 != main_~p1~0); 33686#L153-1 assume 0 != main_~p2~0; 33674#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33675#L158 assume !(0 != main_~p3~0); 33649#L163-1 assume !(0 != main_~p4~0); 33650#L168-1 assume !(0 != main_~p5~0); 33863#L173-1 assume !(0 != main_~p6~0); 33859#L178-1 assume !(0 != main_~p7~0); 33856#L183-1 assume !(0 != main_~p8~0); 33854#L188-1 assume !(0 != main_~p9~0); 33851#L193-1 assume !(0 != main_~p10~0); 33847#L198-1 assume !(0 != main_~p11~0); 33844#L203-1 assume !(0 != main_~p12~0); 33840#L208-1 assume !(0 != main_~p13~0); 33837#L213-1 assume 0 != main_~p14~0; 33835#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33832#L218 assume !(0 != main_~p15~0); 33535#L223-1 [2019-01-14 02:54:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-14 02:54:56,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2078666330, now seen corresponding path program 1 times [2019-01-14 02:54:56,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:56,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:56,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:56,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:56,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:56,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:56,547 INFO L87 Difference]: Start difference. First operand 11009 states and 16129 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2019-01-14 02:54:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:56,699 INFO L93 Difference]: Finished difference Result 21761 states and 31489 transitions. [2019-01-14 02:54:56,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:56,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21761 states and 31489 transitions. [2019-01-14 02:54:56,807 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-01-14 02:54:56,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-01-14 02:54:56,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21761 [2019-01-14 02:54:56,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21761 [2019-01-14 02:54:56,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21761 states and 31489 transitions. [2019-01-14 02:54:56,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:56,968 INFO L706 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-01-14 02:54:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21761 states and 31489 transitions. [2019-01-14 02:54:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21761 to 21761. [2019-01-14 02:54:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2019-01-14 02:54:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-01-14 02:54:57,321 INFO L729 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-01-14 02:54:57,321 INFO L609 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-01-14 02:54:57,321 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:54:57,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21761 states and 31489 transitions. [2019-01-14 02:54:57,386 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-01-14 02:54:57,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:57,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:57,388 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:57,390 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:57,390 INFO L794 eck$LassoCheckResult]: Stem: 66306#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 66307#L223-1 [2019-01-14 02:54:57,390 INFO L796 eck$LassoCheckResult]: Loop: 66307#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 66558#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66555#L91 assume !(0 != main_~p1~0); 66552#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66550#L95-1 assume !(0 != main_~p3~0); 66547#L99-1 assume !(0 != main_~p4~0); 66544#L103-1 assume !(0 != main_~p5~0); 66534#L107-1 assume !(0 != main_~p6~0); 66536#L111-1 assume !(0 != main_~p7~0); 66518#L115-1 assume !(0 != main_~p8~0); 66520#L119-1 assume !(0 != main_~p9~0); 66504#L123-1 assume !(0 != main_~p10~0); 66506#L127-1 assume !(0 != main_~p11~0); 66484#L131-1 assume !(0 != main_~p12~0); 66486#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66469#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66470#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66460#L147-1 assume !(0 != main_~p1~0); 66461#L153-1 assume 0 != main_~p2~0; 66451#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66452#L158 assume !(0 != main_~p3~0); 66423#L163-1 assume !(0 != main_~p4~0); 66424#L168-1 assume !(0 != main_~p5~0); 66590#L173-1 assume !(0 != main_~p6~0); 66588#L178-1 assume !(0 != main_~p7~0); 66586#L183-1 assume !(0 != main_~p8~0); 66584#L188-1 assume !(0 != main_~p9~0); 66582#L193-1 assume !(0 != main_~p10~0); 66578#L198-1 assume !(0 != main_~p11~0); 66574#L203-1 assume !(0 != main_~p12~0); 66571#L208-1 assume !(0 != main_~p13~0); 66567#L213-1 assume 0 != main_~p14~0; 66565#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66563#L218 assume !(0 != main_~p15~0); 66307#L223-1 [2019-01-14 02:54:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-14 02:54:57,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:57,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:57,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1655964504, now seen corresponding path program 1 times [2019-01-14 02:54:57,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:57,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:57,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:57,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:57,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:57,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:57,482 INFO L87 Difference]: Start difference. First operand 21761 states and 31489 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2019-01-14 02:54:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:57,687 INFO L93 Difference]: Finished difference Result 43009 states and 61441 transitions. [2019-01-14 02:54:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:57,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43009 states and 61441 transitions. [2019-01-14 02:54:57,930 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-01-14 02:54:58,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-01-14 02:54:58,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43009 [2019-01-14 02:54:58,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43009 [2019-01-14 02:54:58,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43009 states and 61441 transitions. [2019-01-14 02:54:58,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:58,448 INFO L706 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-01-14 02:54:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43009 states and 61441 transitions. [2019-01-14 02:54:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43009 to 43009. [2019-01-14 02:54:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-01-14 02:54:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-01-14 02:54:59,132 INFO L729 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-01-14 02:54:59,132 INFO L609 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-01-14 02:54:59,132 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:54:59,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43009 states and 61441 transitions. [2019-01-14 02:54:59,291 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-01-14 02:54:59,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:59,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:59,292 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:59,292 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:59,292 INFO L794 eck$LassoCheckResult]: Stem: 131090#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 131091#L223-1 [2019-01-14 02:54:59,292 INFO L796 eck$LassoCheckResult]: Loop: 131091#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 131712#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131710#L91 assume !(0 != main_~p1~0); 131709#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131708#L95-1 assume !(0 != main_~p3~0); 131706#L99-1 assume !(0 != main_~p4~0); 131704#L103-1 assume !(0 != main_~p5~0); 131702#L107-1 assume !(0 != main_~p6~0); 131700#L111-1 assume !(0 != main_~p7~0); 131697#L115-1 assume !(0 != main_~p8~0); 131693#L119-1 assume !(0 != main_~p9~0); 131690#L123-1 assume !(0 != main_~p10~0); 131675#L127-1 assume !(0 != main_~p11~0); 131676#L131-1 assume !(0 != main_~p12~0); 131660#L135-1 assume !(0 != main_~p13~0); 131662#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131647#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131648#L147-1 assume !(0 != main_~p1~0); 131635#L153-1 assume 0 != main_~p2~0; 131636#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131622#L158 assume !(0 != main_~p3~0); 131621#L163-1 assume !(0 != main_~p4~0); 131604#L168-1 assume !(0 != main_~p5~0); 131606#L173-1 assume !(0 != main_~p6~0); 131593#L178-1 assume !(0 != main_~p7~0); 131594#L183-1 assume !(0 != main_~p8~0); 131576#L188-1 assume !(0 != main_~p9~0); 131578#L193-1 assume !(0 != main_~p10~0); 131721#L198-1 assume !(0 != main_~p11~0); 131719#L203-1 assume !(0 != main_~p12~0); 131717#L208-1 assume !(0 != main_~p13~0); 131716#L213-1 assume 0 != main_~p14~0; 131715#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131714#L218 assume !(0 != main_~p15~0); 131091#L223-1 [2019-01-14 02:54:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-01-14 02:54:59,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:59,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:59,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1821354342, now seen corresponding path program 1 times [2019-01-14 02:54:59,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:59,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:54:59,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:59,378 INFO L87 Difference]: Start difference. First operand 43009 states and 61441 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2019-01-14 02:54:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:59,668 INFO L93 Difference]: Finished difference Result 84993 states and 119809 transitions. [2019-01-14 02:54:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:59,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84993 states and 119809 transitions. [2019-01-14 02:55:00,451 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-01-14 02:55:00,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-01-14 02:55:00,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84993 [2019-01-14 02:55:00,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84993 [2019-01-14 02:55:00,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84993 states and 119809 transitions. [2019-01-14 02:55:00,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:00,815 INFO L706 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-01-14 02:55:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84993 states and 119809 transitions. [2019-01-14 02:55:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84993 to 84993. [2019-01-14 02:55:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84993 states. [2019-01-14 02:55:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-01-14 02:55:02,147 INFO L729 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-01-14 02:55:02,147 INFO L609 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-01-14 02:55:02,147 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:55:02,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84993 states and 119809 transitions. [2019-01-14 02:55:02,352 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-01-14 02:55:02,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,354 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,354 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,354 INFO L794 eck$LassoCheckResult]: Stem: 259091#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_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 259092#L223-1 [2019-01-14 02:55:02,355 INFO L796 eck$LassoCheckResult]: Loop: 259092#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 259262#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 259258#L91 assume !(0 != main_~p1~0); 259254#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259250#L95-1 assume !(0 != main_~p3~0); 259243#L99-1 assume !(0 != main_~p4~0); 259235#L103-1 assume !(0 != main_~p5~0); 259227#L107-1 assume !(0 != main_~p6~0); 259219#L111-1 assume !(0 != main_~p7~0); 259211#L115-1 assume !(0 != main_~p8~0); 259203#L119-1 assume !(0 != main_~p9~0); 259195#L123-1 assume !(0 != main_~p10~0); 259190#L127-1 assume !(0 != main_~p11~0); 259183#L131-1 assume !(0 != main_~p12~0); 259175#L135-1 assume !(0 != main_~p13~0); 259170#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259165#L143-1 assume !(0 != main_~p15~0); 259159#L147-1 assume !(0 != main_~p1~0); 259160#L153-1 assume 0 != main_~p2~0; 259341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259339#L158 assume !(0 != main_~p3~0); 259334#L163-1 assume !(0 != main_~p4~0); 259330#L168-1 assume !(0 != main_~p5~0); 259326#L173-1 assume !(0 != main_~p6~0); 259322#L178-1 assume !(0 != main_~p7~0); 259318#L183-1 assume !(0 != main_~p8~0); 259314#L188-1 assume !(0 != main_~p9~0); 259306#L193-1 assume !(0 != main_~p10~0); 259296#L198-1 assume !(0 != main_~p11~0); 259288#L203-1 assume !(0 != main_~p12~0); 259281#L208-1 assume !(0 != main_~p13~0); 259277#L213-1 assume 0 != main_~p14~0; 259273#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259269#L218 assume !(0 != main_~p15~0); 259092#L223-1 [2019-01-14 02:55:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-01-14 02:55:02,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -172790364, now seen corresponding path program 1 times [2019-01-14 02:55:02,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1777509891, now seen corresponding path program 1 times [2019-01-14 02:55:02,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,836 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:55:03,172 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 02:55:03,453 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 02:55:03,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:55:03 BoogieIcfgContainer [2019-01-14 02:55:03,502 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:55:03,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:55:03,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:55:03,503 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:55:03,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:53" (3/4) ... [2019-01-14 02:55:03,507 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:55:03,577 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:55:03,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:55:03,578 INFO L168 Benchmark]: Toolchain (without parser) took 11487.32 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 797.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 611.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,580 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:03,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,582 INFO L168 Benchmark]: Boogie Preprocessor took 97.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,584 INFO L168 Benchmark]: RCFGBuilder took 672.14 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,584 INFO L168 Benchmark]: BuchiAutomizer took 10160.72 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 655.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.2 MB). Peak memory consumption was 626.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,589 INFO L168 Benchmark]: Witness Printer took 74.22 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:03,595 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.95 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 672.14 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10160.72 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 655.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.2 MB). Peak memory consumption was 626.7 MB. Max. memory is 11.5 GB. * Witness Printer took 74.22 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84993 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.2s Buchi closure took 0.1s. Biggest automaton had 84993 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1260 SDtfs, 648 SDslu, 790 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 54]: 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=3, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@779cb9d=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b986a05=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73fc8d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bfdc0f6=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33ff45b=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27934fe0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3229ce45=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6eff5dac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12164359=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf499d3=0, p14=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@544cad74=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ffdec5d=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@560fca34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f8fc940=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@125e6f1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65842c4=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: 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; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND TRUE p2 != 0 [L96] lk2 = 1 [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND TRUE p14 != 0 [L144] lk14 = 1 [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND TRUE p2 != 0 [L159] COND FALSE !(lk2 != 1) [L160] lk2 = 0 [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND TRUE p14 != 0 [L219] COND FALSE !(lk14 != 1) [L220] lk14 = 0 [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...