./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 14:50:45,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:50:45,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:50:45,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:50:45,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:50:45,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:50:45,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:50:45,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:50:45,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:50:45,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:50:45,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:50:45,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:50:45,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:50:45,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:50:45,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:50:45,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:50:45,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:50:45,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:50:45,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:50:45,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:50:45,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:50:45,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:50:45,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:50:45,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:50:45,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:50:45,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:50:45,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:50:45,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:50:45,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:50:45,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:50:45,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:50:45,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:50:45,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:50:45,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:50:45,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:50:45,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:50:45,277 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 14:50:45,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:50:45,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:50:45,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:50:45,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:50:45,285 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:50:45,285 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 14:50:45,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:50:45,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 14:50:45,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 14:50:45,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:50:45,287 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 14:50:45,288 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 14:50:45,288 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-12-01 14:50:45,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:50:45,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:50:45,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:50:45,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:50:45,319 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:50:45,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:50:45,366 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/data/ee4d93caf/53581c3d23d54ffcad40e22dcb69368e/FLAGb07c432b4 [2018-12-01 14:50:45,673 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:50:45,673 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:50:45,677 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/data/ee4d93caf/53581c3d23d54ffcad40e22dcb69368e/FLAGb07c432b4 [2018-12-01 14:50:45,686 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/data/ee4d93caf/53581c3d23d54ffcad40e22dcb69368e [2018-12-01 14:50:45,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:50:45,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:50:45,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:50:45,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:50:45,691 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:50:45,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45, skipping insertion in model container [2018-12-01 14:50:45,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:50:45,709 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:50:45,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:50:45,802 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:50:45,817 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:50:45,825 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:50:45,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45 WrapperNode [2018-12-01 14:50:45,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:50:45,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:50:45,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:50:45,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:50:45,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:50:45,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:50:45,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:50:45,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:50:45,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... [2018-12-01 14:50:45,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:50:45,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:50:45,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:50:45,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:50:45,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/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 [2018-12-01 14:50:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:50:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:50:46,064 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:50:46,064 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 14:50:46,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:50:46 BoogieIcfgContainer [2018-12-01 14:50:46,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:50:46,065 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 14:50:46,065 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 14:50:46,067 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 14:50:46,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:50:46,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 02:50:45" (1/3) ... [2018-12-01 14:50:46,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6aff4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:50:46, skipping insertion in model container [2018-12-01 14:50:46,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:50:46,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:50:45" (2/3) ... [2018-12-01 14:50:46,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6aff4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:50:46, skipping insertion in model container [2018-12-01 14:50:46,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:50:46,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:50:46" (3/3) ... [2018-12-01 14:50:46,070 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:50:46,100 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:50:46,101 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 14:50:46,101 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 14:50:46,101 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 14:50:46,101 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:50:46,101 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:50:46,101 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 14:50:46,101 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:50:46,101 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 14:50:46,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2018-12-01 14:50:46,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-01 14:50:46,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,127 INFO L867 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] [2018-12-01 14:50:46,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 14:50:46,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2018-12-01 14:50:46,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-01 14:50:46,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,130 INFO L867 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] [2018-12-01 14:50:46,134 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 29#L167-1true [2018-12-01 14:50:46,135 INFO L796 eck$LassoCheckResult]: Loop: 29#L167-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 38#L44true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 7#L71true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L71-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 35#L75-1true assume !(0 != main_~p3~0); 43#L79-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L83-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 16#L87-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 3#L91-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L95-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L99-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 30#L103-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 14#L107-1true assume !(0 != main_~p11~0); 23#L111-1true assume !(0 != main_~p1~0); 12#L117-1true assume !(0 != main_~p2~0); 24#L122-1true assume !(0 != main_~p3~0); 33#L127-1true assume !(0 != main_~p4~0); 41#L132-1true assume !(0 != main_~p5~0); 9#L137-1true assume !(0 != main_~p6~0); 21#L142-1true assume !(0 != main_~p7~0); 32#L147-1true assume !(0 != main_~p8~0); 39#L152-1true assume !(0 != main_~p9~0); 6#L157-1true assume !(0 != main_~p10~0); 18#L162-1true assume !(0 != main_~p11~0); 29#L167-1true [2018-12-01 14:50:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-01 14:50:46,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash -504227868, now seen corresponding path program 1 times [2018-12-01 14:50:46,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,244 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,255 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-12-01 14:50:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,275 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2018-12-01 14:50:46,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 141 transitions. [2018-12-01 14:50:46,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-12-01 14:50:46,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 70 states and 112 transitions. [2018-12-01 14:50:46,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-12-01 14:50:46,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-12-01 14:50:46,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 112 transitions. [2018-12-01 14:50:46,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,284 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2018-12-01 14:50:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 112 transitions. [2018-12-01 14:50:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-01 14:50:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-01 14:50:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions. [2018-12-01 14:50:46,303 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2018-12-01 14:50:46,303 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2018-12-01 14:50:46,304 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 14:50:46,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 112 transitions. [2018-12-01 14:50:46,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-12-01 14:50:46,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,305 INFO L867 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] [2018-12-01 14:50:46,306 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 172#L167-1 [2018-12-01 14:50:46,306 INFO L796 eck$LassoCheckResult]: Loop: 172#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 181#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 180#L71 assume !(0 != main_~p1~0); 132#L71-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 133#L75-1 assume !(0 != main_~p3~0); 170#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 167#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 156#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 130#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 131#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 173#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 174#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 153#L107-1 assume !(0 != main_~p11~0); 154#L111-1 assume !(0 != main_~p1~0); 148#L117-1 assume !(0 != main_~p2~0); 149#L122-1 assume !(0 != main_~p3~0); 160#L127-1 assume !(0 != main_~p4~0); 135#L132-1 assume !(0 != main_~p5~0); 141#L137-1 assume !(0 != main_~p6~0); 142#L142-1 assume !(0 != main_~p7~0); 152#L147-1 assume !(0 != main_~p8~0); 163#L152-1 assume !(0 != main_~p9~0); 169#L157-1 assume !(0 != main_~p10~0); 183#L162-1 assume !(0 != main_~p11~0); 172#L167-1 [2018-12-01 14:50:46,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-01 14:50:46,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash -285373150, now seen corresponding path program 1 times [2018-12-01 14:50:46,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,331 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,331 INFO L87 Difference]: Start difference. First operand 70 states and 112 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-12-01 14:50:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,348 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2018-12-01 14:50:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 217 transitions. [2018-12-01 14:50:46,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2018-12-01 14:50:46,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 217 transitions. [2018-12-01 14:50:46,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-12-01 14:50:46,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-12-01 14:50:46,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 217 transitions. [2018-12-01 14:50:46,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,352 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-12-01 14:50:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 217 transitions. [2018-12-01 14:50:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-01 14:50:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-01 14:50:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-12-01 14:50:46,357 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-12-01 14:50:46,357 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-12-01 14:50:46,357 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 14:50:46,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 217 transitions. [2018-12-01 14:50:46,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2018-12-01 14:50:46,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,359 INFO L867 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] [2018-12-01 14:50:46,359 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 384#L167-1 [2018-12-01 14:50:46,359 INFO L796 eck$LassoCheckResult]: Loop: 384#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 392#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 389#L71 assume !(0 != main_~p1~0); 390#L71-2 assume !(0 != main_~p2~0); 449#L75-1 assume !(0 != main_~p3~0); 447#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 445#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 443#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 441#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 439#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 437#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 435#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 434#L107-1 assume !(0 != main_~p11~0); 433#L111-1 assume !(0 != main_~p1~0); 430#L117-1 assume !(0 != main_~p2~0); 426#L122-1 assume !(0 != main_~p3~0); 423#L127-1 assume !(0 != main_~p4~0); 419#L132-1 assume !(0 != main_~p5~0); 415#L137-1 assume !(0 != main_~p6~0); 411#L142-1 assume !(0 != main_~p7~0); 407#L147-1 assume !(0 != main_~p8~0); 403#L152-1 assume !(0 != main_~p9~0); 399#L157-1 assume !(0 != main_~p10~0); 397#L162-1 assume !(0 != main_~p11~0); 384#L167-1 [2018-12-01 14:50:46,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-12-01 14:50:46,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash 137328676, now seen corresponding path program 1 times [2018-12-01 14:50:46,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,388 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,388 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-12-01 14:50:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,409 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2018-12-01 14:50:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 421 transitions. [2018-12-01 14:50:46,412 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2018-12-01 14:50:46,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 269 states and 421 transitions. [2018-12-01 14:50:46,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2018-12-01 14:50:46,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2018-12-01 14:50:46,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 421 transitions. [2018-12-01 14:50:46,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,416 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2018-12-01 14:50:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 421 transitions. [2018-12-01 14:50:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-12-01 14:50:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-01 14:50:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 421 transitions. [2018-12-01 14:50:46,426 INFO L728 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2018-12-01 14:50:46,427 INFO L608 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2018-12-01 14:50:46,427 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 14:50:46,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 421 transitions. [2018-12-01 14:50:46,428 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2018-12-01 14:50:46,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,429 INFO L867 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] [2018-12-01 14:50:46,429 INFO L794 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 803#L167-1 [2018-12-01 14:50:46,429 INFO L796 eck$LassoCheckResult]: Loop: 803#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 817#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 818#L71 assume !(0 != main_~p1~0); 898#L71-2 assume !(0 != main_~p2~0); 896#L75-1 assume !(0 != main_~p3~0); 894#L79-1 assume !(0 != main_~p4~0); 892#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 890#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 888#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 886#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 884#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 882#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 880#L107-1 assume !(0 != main_~p11~0); 876#L111-1 assume !(0 != main_~p1~0); 872#L117-1 assume !(0 != main_~p2~0); 868#L122-1 assume !(0 != main_~p3~0); 866#L127-1 assume !(0 != main_~p4~0); 860#L132-1 assume !(0 != main_~p5~0); 859#L137-1 assume !(0 != main_~p6~0); 848#L142-1 assume !(0 != main_~p7~0); 847#L147-1 assume !(0 != main_~p8~0); 836#L152-1 assume !(0 != main_~p9~0); 835#L157-1 assume !(0 != main_~p10~0); 827#L162-1 assume !(0 != main_~p11~0); 803#L167-1 [2018-12-01 14:50:46,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-12-01 14:50:46,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1551615066, now seen corresponding path program 1 times [2018-12-01 14:50:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,447 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,447 INFO L87 Difference]: Start difference. First operand 269 states and 421 transitions. cyclomatic complexity: 160 Second operand 3 states. [2018-12-01 14:50:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,457 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2018-12-01 14:50:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 817 transitions. [2018-12-01 14:50:46,460 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2018-12-01 14:50:46,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 529 states and 817 transitions. [2018-12-01 14:50:46,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2018-12-01 14:50:46,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2018-12-01 14:50:46,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 817 transitions. [2018-12-01 14:50:46,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,463 INFO L705 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2018-12-01 14:50:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 817 transitions. [2018-12-01 14:50:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-01 14:50:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-01 14:50:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 817 transitions. [2018-12-01 14:50:46,473 INFO L728 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2018-12-01 14:50:46,474 INFO L608 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2018-12-01 14:50:46,474 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 14:50:46,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 817 transitions. [2018-12-01 14:50:46,475 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2018-12-01 14:50:46,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,475 INFO L867 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] [2018-12-01 14:50:46,476 INFO L794 eck$LassoCheckResult]: Stem: 1603#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 1604#L167-1 [2018-12-01 14:50:46,476 INFO L796 eck$LassoCheckResult]: Loop: 1604#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1704#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1700#L71 assume !(0 != main_~p1~0); 1696#L71-2 assume !(0 != main_~p2~0); 1694#L75-1 assume !(0 != main_~p3~0); 1692#L79-1 assume !(0 != main_~p4~0); 1688#L83-1 assume !(0 != main_~p5~0); 1686#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1684#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1682#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1680#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1678#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1676#L107-1 assume !(0 != main_~p11~0); 1672#L111-1 assume !(0 != main_~p1~0); 1668#L117-1 assume !(0 != main_~p2~0); 1664#L122-1 assume !(0 != main_~p3~0); 1661#L127-1 assume !(0 != main_~p4~0); 1662#L132-1 assume !(0 != main_~p5~0); 1728#L137-1 assume !(0 != main_~p6~0); 1724#L142-1 assume !(0 != main_~p7~0); 1720#L147-1 assume !(0 != main_~p8~0); 1716#L152-1 assume !(0 != main_~p9~0); 1712#L157-1 assume !(0 != main_~p10~0); 1708#L162-1 assume !(0 != main_~p11~0); 1604#L167-1 [2018-12-01 14:50:46,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-12-01 14:50:46,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 749207524, now seen corresponding path program 1 times [2018-12-01 14:50:46,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,494 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,495 INFO L87 Difference]: Start difference. First operand 529 states and 817 transitions. cyclomatic complexity: 304 Second operand 3 states. [2018-12-01 14:50:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,513 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2018-12-01 14:50:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1585 transitions. [2018-12-01 14:50:46,518 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2018-12-01 14:50:46,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1585 transitions. [2018-12-01 14:50:46,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2018-12-01 14:50:46,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1041 [2018-12-01 14:50:46,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1585 transitions. [2018-12-01 14:50:46,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,522 INFO L705 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2018-12-01 14:50:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1585 transitions. [2018-12-01 14:50:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2018-12-01 14:50:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-12-01 14:50:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1585 transitions. [2018-12-01 14:50:46,534 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2018-12-01 14:50:46,534 INFO L608 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2018-12-01 14:50:46,534 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 14:50:46,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1041 states and 1585 transitions. [2018-12-01 14:50:46,537 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2018-12-01 14:50:46,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,537 INFO L867 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] [2018-12-01 14:50:46,537 INFO L794 eck$LassoCheckResult]: Stem: 3181#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 3182#L167-1 [2018-12-01 14:50:46,538 INFO L796 eck$LassoCheckResult]: Loop: 3182#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 3284#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 3280#L71 assume !(0 != main_~p1~0); 3276#L71-2 assume !(0 != main_~p2~0); 3274#L75-1 assume !(0 != main_~p3~0); 3272#L79-1 assume !(0 != main_~p4~0); 3268#L83-1 assume !(0 != main_~p5~0); 3264#L87-1 assume !(0 != main_~p6~0); 3262#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3260#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3258#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3256#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3254#L107-1 assume !(0 != main_~p11~0); 3250#L111-1 assume !(0 != main_~p1~0); 3246#L117-1 assume !(0 != main_~p2~0); 3242#L122-1 assume !(0 != main_~p3~0); 3239#L127-1 assume !(0 != main_~p4~0); 3240#L132-1 assume !(0 != main_~p5~0); 3307#L137-1 assume !(0 != main_~p6~0); 3304#L142-1 assume !(0 != main_~p7~0); 3300#L147-1 assume !(0 != main_~p8~0); 3296#L152-1 assume !(0 != main_~p9~0); 3292#L157-1 assume !(0 != main_~p10~0); 3288#L162-1 assume !(0 != main_~p11~0); 3182#L167-1 [2018-12-01 14:50:46,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-12-01 14:50:46,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash -839140378, now seen corresponding path program 1 times [2018-12-01 14:50:46,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,555 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,555 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. cyclomatic complexity: 576 Second operand 3 states. [2018-12-01 14:50:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,573 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2018-12-01 14:50:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2049 states and 3073 transitions. [2018-12-01 14:50:46,587 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2018-12-01 14:50:46,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2049 states to 2049 states and 3073 transitions. [2018-12-01 14:50:46,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2049 [2018-12-01 14:50:46,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2049 [2018-12-01 14:50:46,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2049 states and 3073 transitions. [2018-12-01 14:50:46,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,600 INFO L705 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2018-12-01 14:50:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states and 3073 transitions. [2018-12-01 14:50:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2018-12-01 14:50:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-12-01 14:50:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3073 transitions. [2018-12-01 14:50:46,624 INFO L728 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2018-12-01 14:50:46,624 INFO L608 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2018-12-01 14:50:46,624 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 14:50:46,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2049 states and 3073 transitions. [2018-12-01 14:50:46,630 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2018-12-01 14:50:46,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,631 INFO L867 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] [2018-12-01 14:50:46,631 INFO L794 eck$LassoCheckResult]: Stem: 6279#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 6280#L167-1 [2018-12-01 14:50:46,631 INFO L796 eck$LassoCheckResult]: Loop: 6280#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 6452#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 6449#L71 assume !(0 != main_~p1~0); 6450#L71-2 assume !(0 != main_~p2~0); 6431#L75-1 assume !(0 != main_~p3~0); 6432#L79-1 assume !(0 != main_~p4~0); 6417#L83-1 assume !(0 != main_~p5~0); 6418#L87-1 assume !(0 != main_~p6~0); 6395#L91-1 assume !(0 != main_~p7~0); 6397#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6381#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6382#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6366#L107-1 assume !(0 != main_~p11~0); 6367#L111-1 assume !(0 != main_~p1~0); 6485#L117-1 assume !(0 != main_~p2~0); 6483#L122-1 assume !(0 != main_~p3~0); 6481#L127-1 assume !(0 != main_~p4~0); 6479#L132-1 assume !(0 != main_~p5~0); 6477#L137-1 assume !(0 != main_~p6~0); 6473#L142-1 assume !(0 != main_~p7~0); 6470#L147-1 assume !(0 != main_~p8~0); 6464#L152-1 assume !(0 != main_~p9~0); 6460#L157-1 assume !(0 != main_~p10~0); 6456#L162-1 assume !(0 != main_~p11~0); 6280#L167-1 [2018-12-01 14:50:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-12-01 14:50:46,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1860208732, now seen corresponding path program 1 times [2018-12-01 14:50:46,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,648 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,649 INFO L87 Difference]: Start difference. First operand 2049 states and 3073 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2018-12-01 14:50:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,672 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2018-12-01 14:50:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4033 states and 5953 transitions. [2018-12-01 14:50:46,694 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2018-12-01 14:50:46,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4033 states to 4033 states and 5953 transitions. [2018-12-01 14:50:46,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4033 [2018-12-01 14:50:46,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4033 [2018-12-01 14:50:46,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4033 states and 5953 transitions. [2018-12-01 14:50:46,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,718 INFO L705 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2018-12-01 14:50:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states and 5953 transitions. [2018-12-01 14:50:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4033. [2018-12-01 14:50:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2018-12-01 14:50:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5953 transitions. [2018-12-01 14:50:46,760 INFO L728 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2018-12-01 14:50:46,761 INFO L608 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2018-12-01 14:50:46,761 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 14:50:46,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4033 states and 5953 transitions. [2018-12-01 14:50:46,772 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2018-12-01 14:50:46,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,773 INFO L867 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] [2018-12-01 14:50:46,773 INFO L794 eck$LassoCheckResult]: Stem: 12362#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 12363#L167-1 [2018-12-01 14:50:46,773 INFO L796 eck$LassoCheckResult]: Loop: 12363#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 12540#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12537#L71 assume !(0 != main_~p1~0); 12538#L71-2 assume !(0 != main_~p2~0); 12517#L75-1 assume !(0 != main_~p3~0); 12518#L79-1 assume !(0 != main_~p4~0); 12501#L83-1 assume !(0 != main_~p5~0); 12503#L87-1 assume !(0 != main_~p6~0); 12477#L91-1 assume !(0 != main_~p7~0); 12479#L95-1 assume !(0 != main_~p8~0); 12457#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12458#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12441#L107-1 assume !(0 != main_~p11~0); 12442#L111-1 assume !(0 != main_~p1~0); 12573#L117-1 assume !(0 != main_~p2~0); 12571#L122-1 assume !(0 != main_~p3~0); 12569#L127-1 assume !(0 != main_~p4~0); 12567#L132-1 assume !(0 != main_~p5~0); 12563#L137-1 assume !(0 != main_~p6~0); 12559#L142-1 assume !(0 != main_~p7~0); 12555#L147-1 assume !(0 != main_~p8~0); 12552#L152-1 assume !(0 != main_~p9~0); 12548#L157-1 assume !(0 != main_~p10~0); 12544#L162-1 assume !(0 != main_~p11~0); 12363#L167-1 [2018-12-01 14:50:46,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-12-01 14:50:46,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1154894886, now seen corresponding path program 1 times [2018-12-01 14:50:46,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,789 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,790 INFO L87 Difference]: Start difference. First operand 4033 states and 5953 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2018-12-01 14:50:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:46,822 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2018-12-01 14:50:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:46,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7937 states and 11521 transitions. [2018-12-01 14:50:46,850 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2018-12-01 14:50:46,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7937 states to 7937 states and 11521 transitions. [2018-12-01 14:50:46,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7937 [2018-12-01 14:50:46,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7937 [2018-12-01 14:50:46,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7937 states and 11521 transitions. [2018-12-01 14:50:46,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:46,881 INFO L705 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2018-12-01 14:50:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states and 11521 transitions. [2018-12-01 14:50:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 7937. [2018-12-01 14:50:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2018-12-01 14:50:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 11521 transitions. [2018-12-01 14:50:46,962 INFO L728 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2018-12-01 14:50:46,962 INFO L608 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2018-12-01 14:50:46,962 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 14:50:46,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7937 states and 11521 transitions. [2018-12-01 14:50:46,979 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2018-12-01 14:50:46,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:46,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:46,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:46,979 INFO L867 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] [2018-12-01 14:50:46,980 INFO L794 eck$LassoCheckResult]: Stem: 24344#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 24345#L167-1 [2018-12-01 14:50:46,980 INFO L796 eck$LassoCheckResult]: Loop: 24345#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 24451#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 24447#L71 assume !(0 != main_~p1~0); 24443#L71-2 assume !(0 != main_~p2~0); 24441#L75-1 assume !(0 != main_~p3~0); 24439#L79-1 assume !(0 != main_~p4~0); 24435#L83-1 assume !(0 != main_~p5~0); 24431#L87-1 assume !(0 != main_~p6~0); 24427#L91-1 assume !(0 != main_~p7~0); 24423#L95-1 assume !(0 != main_~p8~0); 24419#L99-1 assume !(0 != main_~p9~0); 24417#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24415#L107-1 assume !(0 != main_~p11~0); 24411#L111-1 assume !(0 != main_~p1~0); 24407#L117-1 assume !(0 != main_~p2~0); 24403#L122-1 assume !(0 != main_~p3~0); 24400#L127-1 assume !(0 != main_~p4~0); 24401#L132-1 assume !(0 != main_~p5~0); 24474#L137-1 assume !(0 != main_~p6~0); 24470#L142-1 assume !(0 != main_~p7~0); 24466#L147-1 assume !(0 != main_~p8~0); 24462#L152-1 assume !(0 != main_~p9~0); 24459#L157-1 assume !(0 != main_~p10~0); 24455#L162-1 assume !(0 != main_~p11~0); 24345#L167-1 [2018-12-01 14:50:46,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-12-01 14:50:46,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:46,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 143777636, now seen corresponding path program 1 times [2018-12-01 14:50:46,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:50:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:50:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:50:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:50:46,996 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:50:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:50:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:50:46,996 INFO L87 Difference]: Start difference. First operand 7937 states and 11521 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2018-12-01 14:50:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:50:47,049 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2018-12-01 14:50:47,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:50:47,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15617 states and 22273 transitions. [2018-12-01 14:50:47,106 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2018-12-01 14:50:47,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15617 states to 15617 states and 22273 transitions. [2018-12-01 14:50:47,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15617 [2018-12-01 14:50:47,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15617 [2018-12-01 14:50:47,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 22273 transitions. [2018-12-01 14:50:47,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:50:47,179 INFO L705 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2018-12-01 14:50:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 22273 transitions. [2018-12-01 14:50:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 15617. [2018-12-01 14:50:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2018-12-01 14:50:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 22273 transitions. [2018-12-01 14:50:47,305 INFO L728 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2018-12-01 14:50:47,305 INFO L608 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2018-12-01 14:50:47,305 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 14:50:47,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15617 states and 22273 transitions. [2018-12-01 14:50:47,337 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2018-12-01 14:50:47,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:50:47,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:50:47,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 14:50:47,338 INFO L867 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] [2018-12-01 14:50:47,338 INFO L794 eck$LassoCheckResult]: Stem: 47901#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;havoc main_~cond~0; 47902#L167-1 [2018-12-01 14:50:47,339 INFO L796 eck$LassoCheckResult]: Loop: 47902#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 48083#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 48080#L71 assume !(0 != main_~p1~0); 48081#L71-2 assume !(0 != main_~p2~0); 48064#L75-1 assume !(0 != main_~p3~0); 48065#L79-1 assume !(0 != main_~p4~0); 48044#L83-1 assume !(0 != main_~p5~0); 48046#L87-1 assume !(0 != main_~p6~0); 48020#L91-1 assume !(0 != main_~p7~0); 48022#L95-1 assume !(0 != main_~p8~0); 47996#L99-1 assume !(0 != main_~p9~0); 47998#L103-1 assume !(0 != main_~p10~0); 47976#L107-1 assume !(0 != main_~p11~0); 47977#L111-1 assume !(0 != main_~p1~0); 48119#L117-1 assume !(0 != main_~p2~0); 48116#L122-1 assume !(0 != main_~p3~0); 48114#L127-1 assume !(0 != main_~p4~0); 48110#L132-1 assume !(0 != main_~p5~0); 48106#L137-1 assume !(0 != main_~p6~0); 48102#L142-1 assume !(0 != main_~p7~0); 48098#L147-1 assume !(0 != main_~p8~0); 48094#L152-1 assume !(0 != main_~p9~0); 48090#L157-1 assume !(0 != main_~p10~0); 48087#L162-1 assume !(0 != main_~p11~0); 47902#L167-1 [2018-12-01 14:50:47,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2018-12-01 14:50:47,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:47,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash -443028378, now seen corresponding path program 1 times [2018-12-01 14:50:47,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:50:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:50:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash -412008571, now seen corresponding path program 1 times [2018-12-01 14:50:47,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:50:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:50:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:50:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:50:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:50:47,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 02:50:47 BoogieIcfgContainer [2018-12-01 14:50:47,496 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 14:50:47,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:50:47,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:50:47,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:50:47,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:50:46" (3/4) ... [2018-12-01 14:50:47,499 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 14:50:47,542 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d04b45e0-03d8-47d5-a6e5-64be1b608f23/bin-2019/uautomizer/witness.graphml [2018-12-01 14:50:47,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:50:47,543 INFO L168 Benchmark]: Toolchain (without parser) took 1854.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,543 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:50:47,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,544 INFO L168 Benchmark]: Boogie Preprocessor took 45.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,545 INFO L168 Benchmark]: RCFGBuilder took 172.00 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,545 INFO L168 Benchmark]: BuchiAutomizer took 1430.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. [2018-12-01 14:50:47,545 INFO L168 Benchmark]: Witness Printer took 45.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:50:47,547 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.00 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1430.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. * Witness Printer took 45.84 ms. Allocated memory is still 1.3 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15617 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 15617 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 787 SDtfs, 411 SDslu, 482 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34984009=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b944cc7=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fd9ce99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@409daac7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b688974=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@561d7613=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a2fc8c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2073ecd1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19fe0a63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9345d55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@396102e7=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b8b1339=0, lk11=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...