java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:58:37,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:58:37,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:58:37,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:58:37,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:58:37,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:58:37,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:58:37,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:58:37,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:58:37,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:58:37,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:58:37,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:58:37,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:58:37,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:58:37,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:58:37,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:58:37,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:58:37,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:58:37,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:58:37,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:58:37,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:58:37,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:58:37,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:58:37,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:58:37,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:58:37,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:58:37,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:58:37,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:58:37,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:58:37,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:58:37,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:58:37,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:58:37,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:58:37,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:58:37,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:58:37,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:58:37,440 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:58:37,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:58:37,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:58:37,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:58:37,476 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:58:37,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:58:37,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:58:37,479 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:58:37,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:58:37,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:58:37,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:58:37,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:58:37,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:58:37,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:58:37,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:58:37,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:58:37,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:58:37,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:58:37,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:58:37,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:58:37,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:58:37,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:58:37,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:58:37,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:58:37,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:58:37,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:58:37,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:58:37,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:58:37,485 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:58:37,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:58:37,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:58:37,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:58:37,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:58:37,570 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:58:37,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-10-23 18:58:37,637 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8d2eb5d1f/26279e21a4d142f88a10ed2f27d7c5d6/FLAG926cf32d0 [2018-10-23 18:58:38,296 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:58:38,297 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-10-23 18:58:38,316 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8d2eb5d1f/26279e21a4d142f88a10ed2f27d7c5d6/FLAG926cf32d0 [2018-10-23 18:58:38,333 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8d2eb5d1f/26279e21a4d142f88a10ed2f27d7c5d6 [2018-10-23 18:58:38,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:58:38,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:58:38,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:58:38,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:58:38,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:58:38,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:58:38" (1/1) ... [2018-10-23 18:58:38,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255fd7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:38, skipping insertion in model container [2018-10-23 18:58:38,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:58:38" (1/1) ... [2018-10-23 18:58:38,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:58:38,463 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:58:39,268 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:58:39,274 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:58:39,585 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:58:39,609 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:58:39,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39 WrapperNode [2018-10-23 18:58:39,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:58:39,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:58:39,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:58:39,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:58:39,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:39,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:39,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:58:39,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:58:39,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:58:39,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:58:39,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:39,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:39,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:39,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:40,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:40,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:40,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... [2018-10-23 18:58:40,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:58:40,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:58:40,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:58:40,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:58:40,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:58:40,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:58:45,550 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:58:45,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:58:45 BoogieIcfgContainer [2018-10-23 18:58:45,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:58:45,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:58:45,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:58:45,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:58:45,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:58:38" (1/3) ... [2018-10-23 18:58:45,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0db2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:58:45, skipping insertion in model container [2018-10-23 18:58:45,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:58:39" (2/3) ... [2018-10-23 18:58:45,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0db2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:58:45, skipping insertion in model container [2018-10-23 18:58:45,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:58:45" (3/3) ... [2018-10-23 18:58:45,560 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label58_true-unreach-call.c [2018-10-23 18:58:45,569 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:58:45,578 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:58:45,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:58:45,630 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:58:45,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:58:45,631 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:58:45,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:58:45,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:58:45,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:58:45,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:58:45,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:58:45,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:58:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:58:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-23 18:58:45,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:45,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:45,680 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:45,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1203458046, now seen corresponding path program 1 times [2018-10-23 18:58:45,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:45,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:45,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:58:46,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:46,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:58:46,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:46,457 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-23 18:58:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:48,495 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-23 18:58:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:48,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2018-10-23 18:58:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:48,522 INFO L225 Difference]: With dead ends: 832 [2018-10-23 18:58:48,522 INFO L226 Difference]: Without dead ends: 525 [2018-10-23 18:58:48,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-23 18:58:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-23 18:58:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-23 18:58:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-23 18:58:48,618 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 161 [2018-10-23 18:58:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:48,619 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-23 18:58:48,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-23 18:58:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-23 18:58:48,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:48,636 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:48,636 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:48,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1307036209, now seen corresponding path program 1 times [2018-10-23 18:58:48,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:48,938 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:58:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:58:48,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:48,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:48,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:48,993 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-23 18:58:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:53,534 INFO L93 Difference]: Finished difference Result 1892 states and 3348 transitions. [2018-10-23 18:58:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-10-23 18:58:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:53,544 INFO L225 Difference]: With dead ends: 1892 [2018-10-23 18:58:53,545 INFO L226 Difference]: Without dead ends: 1383 [2018-10-23 18:58:53,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-23 18:58:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 923. [2018-10-23 18:58:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-23 18:58:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-23 18:58:53,597 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 167 [2018-10-23 18:58:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:53,598 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-23 18:58:53,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-23 18:58:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-23 18:58:53,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:53,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:53,603 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:53,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -161212219, now seen corresponding path program 1 times [2018-10-23 18:58:53,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:58:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:53,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:58:53,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:53,703 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-23 18:58:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:54,802 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-23 18:58:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:54,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-23 18:58:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:54,810 INFO L225 Difference]: With dead ends: 1823 [2018-10-23 18:58:54,810 INFO L226 Difference]: Without dead ends: 902 [2018-10-23 18:58:54,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-23 18:58:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-23 18:58:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-23 18:58:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-23 18:58:54,837 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 175 [2018-10-23 18:58:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:54,838 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-23 18:58:54,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-23 18:58:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-23 18:58:54,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:54,841 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:54,842 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:54,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash -632556310, now seen corresponding path program 1 times [2018-10-23 18:58:54,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:54,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-23 18:58:54,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:54,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:54,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:54,997 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-23 18:58:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:57,281 INFO L93 Difference]: Finished difference Result 3477 states and 5598 transitions. [2018-10-23 18:58:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:57,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-23 18:58:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:57,297 INFO L225 Difference]: With dead ends: 3477 [2018-10-23 18:58:57,298 INFO L226 Difference]: Without dead ends: 2577 [2018-10-23 18:58:57,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2018-10-23 18:58:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1723. [2018-10-23 18:58:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-23 18:58:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-23 18:58:57,352 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 177 [2018-10-23 18:58:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:57,352 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-23 18:58:57,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-23 18:58:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-23 18:58:57,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:57,358 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:57,358 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1264201284, now seen corresponding path program 1 times [2018-10-23 18:58:57,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:57,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:57,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 18:58:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:58:57,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:57,485 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-23 18:58:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:58,758 INFO L93 Difference]: Finished difference Result 4273 states and 6419 transitions. [2018-10-23 18:58:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:58,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-10-23 18:58:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:58,772 INFO L225 Difference]: With dead ends: 4273 [2018-10-23 18:58:58,772 INFO L226 Difference]: Without dead ends: 2552 [2018-10-23 18:58:58,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-23 18:58:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2551. [2018-10-23 18:58:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2018-10-23 18:58:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3792 transitions. [2018-10-23 18:58:58,822 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3792 transitions. Word has length 180 [2018-10-23 18:58:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:58,822 INFO L481 AbstractCegarLoop]: Abstraction has 2551 states and 3792 transitions. [2018-10-23 18:58:58,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3792 transitions. [2018-10-23 18:58:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-23 18:58:58,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:58,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:58,828 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:58,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1447699458, now seen corresponding path program 1 times [2018-10-23 18:58:58,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:58,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 18:58:58,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:58:58,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:58,933 INFO L87 Difference]: Start difference. First operand 2551 states and 3792 transitions. Second operand 3 states. [2018-10-23 18:58:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:59,618 INFO L93 Difference]: Finished difference Result 7640 states and 11360 transitions. [2018-10-23 18:58:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:59,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-23 18:58:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:59,650 INFO L225 Difference]: With dead ends: 7640 [2018-10-23 18:58:59,650 INFO L226 Difference]: Without dead ends: 5091 [2018-10-23 18:58:59,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2018-10-23 18:58:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5089. [2018-10-23 18:58:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2018-10-23 18:58:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7560 transitions. [2018-10-23 18:58:59,789 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7560 transitions. Word has length 184 [2018-10-23 18:58:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:59,789 INFO L481 AbstractCegarLoop]: Abstraction has 5089 states and 7560 transitions. [2018-10-23 18:58:59,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7560 transitions. [2018-10-23 18:58:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-23 18:58:59,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:59,800 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:58:59,800 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:59,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1313542557, now seen corresponding path program 1 times [2018-10-23 18:58:59,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:59,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:58:59,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:59,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:59,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:59,973 INFO L87 Difference]: Start difference. First operand 5089 states and 7560 transitions. Second operand 3 states. [2018-10-23 18:59:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:01,642 INFO L93 Difference]: Finished difference Result 14871 states and 22177 transitions. [2018-10-23 18:59:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:59:01,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-23 18:59:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:01,689 INFO L225 Difference]: With dead ends: 14871 [2018-10-23 18:59:01,689 INFO L226 Difference]: Without dead ends: 9784 [2018-10-23 18:59:01,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:59:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2018-10-23 18:59:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 9782. [2018-10-23 18:59:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9782 states. [2018-10-23 18:59:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9782 states to 9782 states and 13465 transitions. [2018-10-23 18:59:01,904 INFO L78 Accepts]: Start accepts. Automaton has 9782 states and 13465 transitions. Word has length 186 [2018-10-23 18:59:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:01,904 INFO L481 AbstractCegarLoop]: Abstraction has 9782 states and 13465 transitions. [2018-10-23 18:59:01,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:59:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9782 states and 13465 transitions. [2018-10-23 18:59:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-23 18:59:01,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:01,916 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:01,916 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:01,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1878651544, now seen corresponding path program 2 times [2018-10-23 18:59:01,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:01,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:01,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:01,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:59:02,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:02,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:59:02,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:59:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:59:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:59:02,054 INFO L87 Difference]: Start difference. First operand 9782 states and 13465 transitions. Second operand 3 states. [2018-10-23 18:59:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:04,112 INFO L93 Difference]: Finished difference Result 27930 states and 38574 transitions. [2018-10-23 18:59:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:59:04,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-23 18:59:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:04,165 INFO L225 Difference]: With dead ends: 27930 [2018-10-23 18:59:04,166 INFO L226 Difference]: Without dead ends: 18150 [2018-10-23 18:59:04,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:59:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18150 states. [2018-10-23 18:59:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18150 to 18146. [2018-10-23 18:59:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18146 states. [2018-10-23 18:59:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18146 states to 18146 states and 22636 transitions. [2018-10-23 18:59:04,511 INFO L78 Accepts]: Start accepts. Automaton has 18146 states and 22636 transitions. Word has length 188 [2018-10-23 18:59:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:04,511 INFO L481 AbstractCegarLoop]: Abstraction has 18146 states and 22636 transitions. [2018-10-23 18:59:04,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:59:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18146 states and 22636 transitions. [2018-10-23 18:59:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-23 18:59:04,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:04,535 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:04,536 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:04,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1084271195, now seen corresponding path program 1 times [2018-10-23 18:59:04,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:04,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:04,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 18:59:04,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-23 18:59:04,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:59:04,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:59:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:59:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:04,805 INFO L87 Difference]: Start difference. First operand 18146 states and 22636 transitions. Second operand 4 states. [2018-10-23 18:59:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:06,612 INFO L93 Difference]: Finished difference Result 35880 states and 44699 transitions. [2018-10-23 18:59:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:59:06,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-23 18:59:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:06,648 INFO L225 Difference]: With dead ends: 35880 [2018-10-23 18:59:06,648 INFO L226 Difference]: Without dead ends: 17736 [2018-10-23 18:59:06,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17736 states. [2018-10-23 18:59:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17736 to 17734. [2018-10-23 18:59:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17734 states. [2018-10-23 18:59:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17734 states to 17734 states and 21102 transitions. [2018-10-23 18:59:06,928 INFO L78 Accepts]: Start accepts. Automaton has 17734 states and 21102 transitions. Word has length 206 [2018-10-23 18:59:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:06,928 INFO L481 AbstractCegarLoop]: Abstraction has 17734 states and 21102 transitions. [2018-10-23 18:59:06,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:59:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17734 states and 21102 transitions. [2018-10-23 18:59:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-23 18:59:06,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:06,947 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:06,947 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:06,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 939934429, now seen corresponding path program 1 times [2018-10-23 18:59:06,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:06,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:06,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 87 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-23 18:59:07,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:59:07,415 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:59:07,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:07,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:59:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-23 18:59:07,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:59:07,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:59:07,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:59:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:59:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:59:07,690 INFO L87 Difference]: Start difference. First operand 17734 states and 21102 transitions. Second operand 7 states. [2018-10-23 18:59:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:17,715 INFO L93 Difference]: Finished difference Result 76878 states and 91858 transitions. [2018-10-23 18:59:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:59:17,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2018-10-23 18:59:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:17,799 INFO L225 Difference]: With dead ends: 76878 [2018-10-23 18:59:17,799 INFO L226 Difference]: Without dead ends: 59146 [2018-10-23 18:59:17,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-23 18:59:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59146 states. [2018-10-23 18:59:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59146 to 57510. [2018-10-23 18:59:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57510 states. [2018-10-23 18:59:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57510 states to 57510 states and 65040 transitions. [2018-10-23 18:59:18,792 INFO L78 Accepts]: Start accepts. Automaton has 57510 states and 65040 transitions. Word has length 232 [2018-10-23 18:59:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:18,793 INFO L481 AbstractCegarLoop]: Abstraction has 57510 states and 65040 transitions. [2018-10-23 18:59:18,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:59:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 57510 states and 65040 transitions. [2018-10-23 18:59:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-23 18:59:18,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:18,861 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:18,861 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:18,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1191696217, now seen corresponding path program 1 times [2018-10-23 18:59:18,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:18,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 18:59:19,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:59:19,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:59:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:59:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:59:19,402 INFO L87 Difference]: Start difference. First operand 57510 states and 65040 transitions. Second operand 3 states. [2018-10-23 18:59:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:21,362 INFO L93 Difference]: Finished difference Result 111948 states and 126719 transitions. [2018-10-23 18:59:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:59:21,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-10-23 18:59:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:21,467 INFO L225 Difference]: With dead ends: 111948 [2018-10-23 18:59:21,467 INFO L226 Difference]: Without dead ends: 54440 [2018-10-23 18:59:21,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:59:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54440 states. [2018-10-23 18:59:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54440 to 54434. [2018-10-23 18:59:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54434 states. [2018-10-23 18:59:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54434 states to 54434 states and 59941 transitions. [2018-10-23 18:59:22,241 INFO L78 Accepts]: Start accepts. Automaton has 54434 states and 59941 transitions. Word has length 294 [2018-10-23 18:59:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:22,241 INFO L481 AbstractCegarLoop]: Abstraction has 54434 states and 59941 transitions. [2018-10-23 18:59:22,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:59:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 54434 states and 59941 transitions. [2018-10-23 18:59:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-23 18:59:22,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:22,276 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:22,276 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:22,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash -572156507, now seen corresponding path program 1 times [2018-10-23 18:59:22,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:22,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:22,819 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:59:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-23 18:59:22,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:22,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:59:22,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:59:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:59:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:59:22,906 INFO L87 Difference]: Start difference. First operand 54434 states and 59941 transitions. Second operand 5 states. [2018-10-23 18:59:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:25,942 INFO L93 Difference]: Finished difference Result 112792 states and 124338 transitions. [2018-10-23 18:59:25,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:59:25,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2018-10-23 18:59:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:26,008 INFO L225 Difference]: With dead ends: 112792 [2018-10-23 18:59:26,009 INFO L226 Difference]: Without dead ends: 58360 [2018-10-23 18:59:26,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:59:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58360 states. [2018-10-23 18:59:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58360 to 54838. [2018-10-23 18:59:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54838 states. [2018-10-23 18:59:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54838 states to 54838 states and 60222 transitions. [2018-10-23 18:59:26,673 INFO L78 Accepts]: Start accepts. Automaton has 54838 states and 60222 transitions. Word has length 336 [2018-10-23 18:59:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:26,673 INFO L481 AbstractCegarLoop]: Abstraction has 54838 states and 60222 transitions. [2018-10-23 18:59:26,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:59:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 54838 states and 60222 transitions. [2018-10-23 18:59:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-23 18:59:26,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:26,707 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:26,707 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:26,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1004908900, now seen corresponding path program 1 times [2018-10-23 18:59:26,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:26,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:26,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-23 18:59:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:59:27,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:59:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:59:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:27,152 INFO L87 Difference]: Start difference. First operand 54838 states and 60222 transitions. Second operand 4 states. [2018-10-23 18:59:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:29,956 INFO L93 Difference]: Finished difference Result 167935 states and 184282 transitions. [2018-10-23 18:59:29,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:59:29,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-10-23 18:59:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:30,103 INFO L225 Difference]: With dead ends: 167935 [2018-10-23 18:59:30,103 INFO L226 Difference]: Without dead ends: 113099 [2018-10-23 18:59:30,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113099 states. [2018-10-23 18:59:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113099 to 87062. [2018-10-23 18:59:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87062 states. [2018-10-23 18:59:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87062 states to 87062 states and 95038 transitions. [2018-10-23 18:59:31,873 INFO L78 Accepts]: Start accepts. Automaton has 87062 states and 95038 transitions. Word has length 362 [2018-10-23 18:59:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:31,874 INFO L481 AbstractCegarLoop]: Abstraction has 87062 states and 95038 transitions. [2018-10-23 18:59:31,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:59:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 87062 states and 95038 transitions. [2018-10-23 18:59:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-23 18:59:31,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:31,925 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:31,926 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:31,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash -459397716, now seen corresponding path program 1 times [2018-10-23 18:59:31,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:31,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-23 18:59:32,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:32,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:59:32,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:59:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:59:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:32,224 INFO L87 Difference]: Start difference. First operand 87062 states and 95038 transitions. Second operand 4 states. [2018-10-23 18:59:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:34,638 INFO L93 Difference]: Finished difference Result 177616 states and 193734 transitions. [2018-10-23 18:59:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:59:34,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-23 18:59:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:34,748 INFO L225 Difference]: With dead ends: 177616 [2018-10-23 18:59:34,748 INFO L226 Difference]: Without dead ends: 90556 [2018-10-23 18:59:34,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90556 states. [2018-10-23 18:59:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90556 to 87061. [2018-10-23 18:59:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87061 states. [2018-10-23 18:59:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87061 states to 87061 states and 94704 transitions. [2018-10-23 18:59:36,864 INFO L78 Accepts]: Start accepts. Automaton has 87061 states and 94704 transitions. Word has length 365 [2018-10-23 18:59:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:36,864 INFO L481 AbstractCegarLoop]: Abstraction has 87061 states and 94704 transitions. [2018-10-23 18:59:36,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:59:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 87061 states and 94704 transitions. [2018-10-23 18:59:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-23 18:59:36,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:36,906 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:36,906 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:36,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1828943484, now seen corresponding path program 1 times [2018-10-23 18:59:36,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:36,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-10-23 18:59:37,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:37,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:59:37,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:59:37,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:59:37,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:37,161 INFO L87 Difference]: Start difference. First operand 87061 states and 94704 transitions. Second operand 4 states. [2018-10-23 18:59:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:39,274 INFO L93 Difference]: Finished difference Result 254578 states and 276221 transitions. [2018-10-23 18:59:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:59:39,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-23 18:59:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:39,487 INFO L225 Difference]: With dead ends: 254578 [2018-10-23 18:59:39,487 INFO L226 Difference]: Without dead ends: 167519 [2018-10-23 18:59:39,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:59:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167519 states. [2018-10-23 18:59:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167519 to 163228. [2018-10-23 18:59:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163228 states. [2018-10-23 18:59:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163228 states to 163228 states and 176899 transitions. [2018-10-23 18:59:42,748 INFO L78 Accepts]: Start accepts. Automaton has 163228 states and 176899 transitions. Word has length 371 [2018-10-23 18:59:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:42,749 INFO L481 AbstractCegarLoop]: Abstraction has 163228 states and 176899 transitions. [2018-10-23 18:59:42,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:59:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 163228 states and 176899 transitions. [2018-10-23 18:59:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-23 18:59:42,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:42,813 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:59:42,813 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:42,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1063794315, now seen corresponding path program 1 times [2018-10-23 18:59:42,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:42,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:42,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:42,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:43,544 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-23 18:59:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-23 18:59:43,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:59:43,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:59:43,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:59:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:59:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:59:43,726 INFO L87 Difference]: Start difference. First operand 163228 states and 176899 transitions. Second operand 5 states. [2018-10-23 18:59:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:49,262 INFO L93 Difference]: Finished difference Result 578114 states and 628235 transitions. [2018-10-23 18:59:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:59:49,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 383 [2018-10-23 18:59:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:49,845 INFO L225 Difference]: With dead ends: 578114 [2018-10-23 18:59:49,845 INFO L226 Difference]: Without dead ends: 414888 [2018-10-23 18:59:49,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:59:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414888 states. [2018-10-23 19:00:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414888 to 326218. [2018-10-23 19:00:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326218 states. [2018-10-23 19:00:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326218 states to 326218 states and 354335 transitions. [2018-10-23 19:00:01,222 INFO L78 Accepts]: Start accepts. Automaton has 326218 states and 354335 transitions. Word has length 383 [2018-10-23 19:00:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 19:00:01,222 INFO L481 AbstractCegarLoop]: Abstraction has 326218 states and 354335 transitions. [2018-10-23 19:00:01,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 19:00:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 326218 states and 354335 transitions. [2018-10-23 19:00:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-23 19:00:01,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 19:00:01,252 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 19:00:01,253 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 19:00:01,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 19:00:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -288142344, now seen corresponding path program 1 times [2018-10-23 19:00:01,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 19:00:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 19:00:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:00:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 19:00:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:00:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 19:00:01,818 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-23 19:00:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 226 proven. 10 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-23 19:00:02,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 19:00:02,009 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 19:00:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 19:00:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 19:00:02,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 19:00:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-23 19:00:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 19:00:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-23 19:00:03,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 19:00:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 19:00:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-23 19:00:03,107 INFO L87 Difference]: Start difference. First operand 326218 states and 354335 transitions. Second operand 8 states. [2018-10-23 19:00:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 19:00:25,754 INFO L93 Difference]: Finished difference Result 2959481 states and 3209997 transitions. [2018-10-23 19:00:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-23 19:00:25,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2018-10-23 19:00:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 19:00:30,208 INFO L225 Difference]: With dead ends: 2959481 [2018-10-23 19:00:30,208 INFO L226 Difference]: Without dead ends: 2633469 [2018-10-23 19:00:30,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-23 19:00:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633469 states. [2018-10-23 19:01:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633469 to 1699314. [2018-10-23 19:01:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699314 states. [2018-10-23 19:01:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699314 states to 1699314 states and 1829095 transitions. [2018-10-23 19:01:36,914 INFO L78 Accepts]: Start accepts. Automaton has 1699314 states and 1829095 transitions. Word has length 392 [2018-10-23 19:01:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 19:01:36,914 INFO L481 AbstractCegarLoop]: Abstraction has 1699314 states and 1829095 transitions. [2018-10-23 19:01:36,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 19:01:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1699314 states and 1829095 transitions. [2018-10-23 19:01:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-23 19:01:36,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 19:01:36,999 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 19:01:37,000 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 19:01:37,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 19:01:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -662806004, now seen corresponding path program 1 times [2018-10-23 19:01:37,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 19:01:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 19:01:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:01:37,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 19:01:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:01:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 19:01:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-23 19:01:37,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 19:01:37,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 19:01:37,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 19:01:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 19:01:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 19:01:37,470 INFO L87 Difference]: Start difference. First operand 1699314 states and 1829095 transitions. Second operand 4 states. Received shutdown request... [2018-10-23 19:01:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 19:01:54,652 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 19:01:54,657 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 19:01:54,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 07:01:54 BoogieIcfgContainer [2018-10-23 19:01:54,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 19:01:54,658 INFO L168 Benchmark]: Toolchain (without parser) took 196313.40 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,659 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 19:01:54,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1264.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 340.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,663 INFO L168 Benchmark]: Boogie Preprocessor took 131.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,667 INFO L168 Benchmark]: RCFGBuilder took 5466.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 268.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,667 INFO L168 Benchmark]: TraceAbstraction took 189104.74 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2018-10-23 19:01:54,674 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1264.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 340.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.96 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5466.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 268.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189104.74 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1515]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (1699314states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1438885 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 189.0s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 92.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5594 SDtfs, 18077 SDslu, 5984 SDs, 0 SdLazy, 22443 SolverSat, 4612 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 648 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1699314occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 87.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 1063151 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 5415 NumberOfCodeBlocks, 5415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5395 ConstructedInterpolants, 0 QuantifiedInterpolants, 3159276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 3448/3462 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown