java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:04:04,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:04:04,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:04:04,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:04:04,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:04:04,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:04:04,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:04:04,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:04:04,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:04:04,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:04:04,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:04:04,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:04:04,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:04:04,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:04:04,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:04:04,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:04:04,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:04:04,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:04:04,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:04:04,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:04:04,553 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:04:04,554 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:04:04,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:04:04,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:04:04,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:04:04,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:04:04,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:04:04,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:04:04,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:04:04,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:04:04,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:04:04,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:04:04,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:04:04,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:04:04,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:04:04,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:04:04,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:04:04,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:04:04,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:04:04,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:04:04,588 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:04:04,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:04:04,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:04:04,589 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:04:04,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:04:04,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:04:04,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:04:04,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:04:04,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:04:04,591 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:04:04,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:04:04,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:04:04,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:04:04,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:04:04,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:04:04,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:04:04,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:04:04,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:04:04,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:04:04,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:04:04,593 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:04:04,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:04:04,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:04:04,594 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:04:04,594 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:04:04,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:04:04,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:04:04,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:04:04,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:04:04,672 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:04:04,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-11-06 19:04:04,741 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f423c45/15a1b019fbd345dbaf8267093318942c/FLAG70dd77ccc [2018-11-06 19:04:05,517 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:04:05,518 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-11-06 19:04:05,545 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f423c45/15a1b019fbd345dbaf8267093318942c/FLAG70dd77ccc [2018-11-06 19:04:05,562 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f423c45/15a1b019fbd345dbaf8267093318942c [2018-11-06 19:04:05,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:04:05,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:04:05,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:04:05,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:04:05,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:04:05,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:04:05" (1/1) ... [2018-11-06 19:04:05,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eee2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:05, skipping insertion in model container [2018-11-06 19:04:05,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:04:05" (1/1) ... [2018-11-06 19:04:05,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:04:05,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:04:06,986 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:04:06,992 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:04:07,595 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:04:07,632 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:04:07,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07 WrapperNode [2018-11-06 19:04:07,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:04:07,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:04:07,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:04:07,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:04:07,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:07,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:04:08,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:04:08,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:04:08,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:04:08,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... [2018-11-06 19:04:08,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:04:08,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:04:08,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:04:08,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:04:08,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-11-06 19:04:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:04:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:04:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:04:17,426 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:04:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:04:17 BoogieIcfgContainer [2018-11-06 19:04:17,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:04:17,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:04:17,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:04:17,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:04:17,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:04:05" (1/3) ... [2018-11-06 19:04:17,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b14ae69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:04:17, skipping insertion in model container [2018-11-06 19:04:17,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:04:07" (2/3) ... [2018-11-06 19:04:17,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b14ae69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:04:17, skipping insertion in model container [2018-11-06 19:04:17,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:04:17" (3/3) ... [2018-11-06 19:04:17,437 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label25_false-unreach-call.c [2018-11-06 19:04:17,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:04:17,466 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:04:17,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:04:17,538 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:04:17,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:04:17,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:04:17,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:04:17,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:04:17,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:04:17,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:04:17,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:04:17,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:04:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-11-06 19:04:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 19:04:17,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:17,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:04:17,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:17,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-11-06 19:04:17,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:17,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:17,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:17,976 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:04:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:17,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:17,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:17,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:18,009 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-11-06 19:04:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:29,293 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-11-06 19:04:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:29,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-06 19:04:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:29,335 INFO L225 Difference]: With dead ends: 3146 [2018-11-06 19:04:29,336 INFO L226 Difference]: Without dead ends: 2320 [2018-11-06 19:04:29,343 INFO L604 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-11-06 19:04:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-11-06 19:04:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-11-06 19:04:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-11-06 19:04:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4229 transitions. [2018-11-06 19:04:29,518 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4229 transitions. Word has length 18 [2018-11-06 19:04:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:29,519 INFO L480 AbstractCegarLoop]: Abstraction has 2320 states and 4229 transitions. [2018-11-06 19:04:29,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:04:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4229 transitions. [2018-11-06 19:04:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-06 19:04:29,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:29,524 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:04:29,524 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:29,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 446746015, now seen corresponding path program 1 times [2018-11-06 19:04:29,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:29,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:29,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:29,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:29,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:29,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:29,851 INFO L87 Difference]: Start difference. First operand 2320 states and 4229 transitions. Second operand 4 states. [2018-11-06 19:04:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:40,468 INFO L93 Difference]: Finished difference Result 9150 states and 16788 transitions. [2018-11-06 19:04:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:40,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-06 19:04:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:40,504 INFO L225 Difference]: With dead ends: 9150 [2018-11-06 19:04:40,505 INFO L226 Difference]: Without dead ends: 6832 [2018-11-06 19:04:40,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-11-06 19:04:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-11-06 19:04:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-11-06 19:04:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10629 transitions. [2018-11-06 19:04:40,641 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10629 transitions. Word has length 94 [2018-11-06 19:04:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:40,642 INFO L480 AbstractCegarLoop]: Abstraction has 6832 states and 10629 transitions. [2018-11-06 19:04:40,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:04:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10629 transitions. [2018-11-06 19:04:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 19:04:40,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:40,653 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:04:40,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:40,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 343230256, now seen corresponding path program 1 times [2018-11-06 19:04:40,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:40,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:40,822 INFO L87 Difference]: Start difference. First operand 6832 states and 10629 transitions. Second operand 4 states. [2018-11-06 19:04:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:48,300 INFO L93 Difference]: Finished difference Result 27260 states and 42449 transitions. [2018-11-06 19:04:48,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:48,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-06 19:04:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:48,383 INFO L225 Difference]: With dead ends: 27260 [2018-11-06 19:04:48,384 INFO L226 Difference]: Without dead ends: 20430 [2018-11-06 19:04:48,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2018-11-06 19:04:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 13600. [2018-11-06 19:04:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2018-11-06 19:04:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 19341 transitions. [2018-11-06 19:04:48,702 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 19341 transitions. Word has length 100 [2018-11-06 19:04:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:48,702 INFO L480 AbstractCegarLoop]: Abstraction has 13600 states and 19341 transitions. [2018-11-06 19:04:48,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:04:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 19341 transitions. [2018-11-06 19:04:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-06 19:04:48,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:48,705 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:04:48,706 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:48,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -544105501, now seen corresponding path program 1 times [2018-11-06 19:04:48,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:49,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:04:49,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:49,052 INFO L87 Difference]: Start difference. First operand 13600 states and 19341 transitions. Second operand 4 states. [2018-11-06 19:04:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:04:57,440 INFO L93 Difference]: Finished difference Result 52783 states and 74748 transitions. [2018-11-06 19:04:57,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:04:57,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-06 19:04:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:04:57,517 INFO L225 Difference]: With dead ends: 52783 [2018-11-06 19:04:57,517 INFO L226 Difference]: Without dead ends: 39185 [2018-11-06 19:04:57,538 INFO L604 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-11-06 19:04:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39185 states. [2018-11-06 19:04:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39185 to 26384. [2018-11-06 19:04:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-11-06 19:04:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 33902 transitions. [2018-11-06 19:04:58,020 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 33902 transitions. Word has length 118 [2018-11-06 19:04:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:04:58,020 INFO L480 AbstractCegarLoop]: Abstraction has 26384 states and 33902 transitions. [2018-11-06 19:04:58,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:04:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 33902 transitions. [2018-11-06 19:04:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-06 19:04:58,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:04:58,031 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:04:58,031 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:04:58,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:04:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1050401920, now seen corresponding path program 1 times [2018-11-06 19:04:58,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:04:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:04:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:58,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:04:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:04:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:04:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:04:58,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:04:58,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:04:58,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:04:58,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:04:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:04:58,542 INFO L87 Difference]: Start difference. First operand 26384 states and 33902 transitions. Second operand 4 states. [2018-11-06 19:05:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:06,597 INFO L93 Difference]: Finished difference Result 52766 states and 67802 transitions. [2018-11-06 19:05:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:05:06,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-11-06 19:05:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:06,655 INFO L225 Difference]: With dead ends: 52766 [2018-11-06 19:05:06,655 INFO L226 Difference]: Without dead ends: 26384 [2018-11-06 19:05:06,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-06 19:05:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2018-11-06 19:05:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26384. [2018-11-06 19:05:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-11-06 19:05:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 32888 transitions. [2018-11-06 19:05:07,018 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 32888 transitions. Word has length 247 [2018-11-06 19:05:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:07,019 INFO L480 AbstractCegarLoop]: Abstraction has 26384 states and 32888 transitions. [2018-11-06 19:05:07,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:05:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 32888 transitions. [2018-11-06 19:05:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 19:05:07,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:07,027 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:05:07,027 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:07,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -827461878, now seen corresponding path program 1 times [2018-11-06 19:05:07,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:07,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:07,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-06 19:05:07,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:07,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:05:07,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:05:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:05:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:05:07,316 INFO L87 Difference]: Start difference. First operand 26384 states and 32888 transitions. Second operand 5 states. [2018-11-06 19:05:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:15,351 INFO L93 Difference]: Finished difference Result 98638 states and 123348 transitions. [2018-11-06 19:05:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:05:15,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2018-11-06 19:05:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:15,438 INFO L225 Difference]: With dead ends: 98638 [2018-11-06 19:05:15,439 INFO L226 Difference]: Without dead ends: 72256 [2018-11-06 19:05:15,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:05:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72256 states. [2018-11-06 19:05:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72256 to 72256. [2018-11-06 19:05:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72256 states. [2018-11-06 19:05:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72256 states to 72256 states and 84563 transitions. [2018-11-06 19:05:16,262 INFO L78 Accepts]: Start accepts. Automaton has 72256 states and 84563 transitions. Word has length 251 [2018-11-06 19:05:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:16,263 INFO L480 AbstractCegarLoop]: Abstraction has 72256 states and 84563 transitions. [2018-11-06 19:05:16,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:05:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 72256 states and 84563 transitions. [2018-11-06 19:05:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-06 19:05:16,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:16,274 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:05:16,275 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:16,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 891280383, now seen corresponding path program 1 times [2018-11-06 19:05:16,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:16,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:16,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 203 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:05:16,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:05:16,674 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:05:16,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:16,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:05:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:05:16,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:05:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 19:05:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:05:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:05:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:05:16,950 INFO L87 Difference]: Start difference. First operand 72256 states and 84563 transitions. Second operand 6 states. [2018-11-06 19:05:18,287 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 19:05:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:35,320 INFO L93 Difference]: Finished difference Result 176128 states and 202657 transitions. [2018-11-06 19:05:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:05:35,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-11-06 19:05:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:35,595 INFO L225 Difference]: With dead ends: 176128 [2018-11-06 19:05:35,596 INFO L226 Difference]: Without dead ends: 102367 [2018-11-06 19:05:35,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:05:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102367 states. [2018-11-06 19:05:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102367 to 73759. [2018-11-06 19:05:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73759 states. [2018-11-06 19:05:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73759 states to 73759 states and 84004 transitions. [2018-11-06 19:05:36,800 INFO L78 Accepts]: Start accepts. Automaton has 73759 states and 84004 transitions. Word has length 275 [2018-11-06 19:05:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:36,801 INFO L480 AbstractCegarLoop]: Abstraction has 73759 states and 84004 transitions. [2018-11-06 19:05:36,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:05:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 73759 states and 84004 transitions. [2018-11-06 19:05:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-06 19:05:36,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:36,813 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:05:36,813 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:36,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 28154518, now seen corresponding path program 1 times [2018-11-06 19:05:36,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:36,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-06 19:05:37,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:37,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:05:37,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:05:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:05:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:37,141 INFO L87 Difference]: Start difference. First operand 73759 states and 84004 transitions. Second operand 3 states. [2018-11-06 19:05:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:41,726 INFO L93 Difference]: Finished difference Result 162556 states and 184984 transitions. [2018-11-06 19:05:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:05:41,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-06 19:05:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:41,837 INFO L225 Difference]: With dead ends: 162556 [2018-11-06 19:05:41,837 INFO L226 Difference]: Without dead ends: 89551 [2018-11-06 19:05:41,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89551 states. [2018-11-06 19:05:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89551 to 89551. [2018-11-06 19:05:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89551 states. [2018-11-06 19:05:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89551 states to 89551 states and 100849 transitions. [2018-11-06 19:05:43,378 INFO L78 Accepts]: Start accepts. Automaton has 89551 states and 100849 transitions. Word has length 278 [2018-11-06 19:05:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:43,379 INFO L480 AbstractCegarLoop]: Abstraction has 89551 states and 100849 transitions. [2018-11-06 19:05:43,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:05:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 89551 states and 100849 transitions. [2018-11-06 19:05:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-06 19:05:43,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:43,397 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2018-11-06 19:05:43,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:43,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1666325953, now seen corresponding path program 1 times [2018-11-06 19:05:43,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:43,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:43,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-06 19:05:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:44,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:05:44,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:05:44,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:05:44,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:05:44,083 INFO L87 Difference]: Start difference. First operand 89551 states and 100849 transitions. Second operand 6 states. [2018-11-06 19:05:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:52,636 INFO L93 Difference]: Finished difference Result 207677 states and 235838 transitions. [2018-11-06 19:05:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:05:52,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2018-11-06 19:05:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:52,797 INFO L225 Difference]: With dead ends: 207677 [2018-11-06 19:05:52,797 INFO L226 Difference]: Without dead ends: 112101 [2018-11-06 19:05:52,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:05:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112101 states. [2018-11-06 19:05:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112101 to 110597. [2018-11-06 19:05:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110597 states. [2018-11-06 19:05:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110597 states to 110597 states and 122825 transitions. [2018-11-06 19:05:54,715 INFO L78 Accepts]: Start accepts. Automaton has 110597 states and 122825 transitions. Word has length 377 [2018-11-06 19:05:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:05:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 110597 states and 122825 transitions. [2018-11-06 19:05:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:05:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 110597 states and 122825 transitions. [2018-11-06 19:05:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-06 19:05:54,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:05:54,735 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2018-11-06 19:05:54,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:05:54,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:05:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1258323644, now seen corresponding path program 1 times [2018-11-06 19:05:54,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:05:54,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:05:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:54,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:05:54,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:05:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:05:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-06 19:05:55,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:05:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:05:55,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:05:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:05:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:05:55,068 INFO L87 Difference]: Start difference. First operand 110597 states and 122825 transitions. Second operand 3 states. [2018-11-06 19:05:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:05:59,596 INFO L93 Difference]: Finished difference Result 241496 states and 268474 transitions. [2018-11-06 19:05:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:05:59,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2018-11-06 19:05:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:05:59,748 INFO L225 Difference]: With dead ends: 241496 [2018-11-06 19:05:59,748 INFO L226 Difference]: Without dead ends: 131653 [2018-11-06 19:05:59,810 INFO L604 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-11-06 19:05:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131653 states. [2018-11-06 19:06:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131653 to 130901. [2018-11-06 19:06:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130901 states. [2018-11-06 19:06:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130901 states to 130901 states and 142197 transitions. [2018-11-06 19:06:01,898 INFO L78 Accepts]: Start accepts. Automaton has 130901 states and 142197 transitions. Word has length 459 [2018-11-06 19:06:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:01,899 INFO L480 AbstractCegarLoop]: Abstraction has 130901 states and 142197 transitions. [2018-11-06 19:06:01,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:06:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 130901 states and 142197 transitions. [2018-11-06 19:06:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-11-06 19:06:01,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:01,915 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2018-11-06 19:06:01,915 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:01,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1041678296, now seen corresponding path program 1 times [2018-11-06 19:06:01,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:01,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 585 proven. 8 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-06 19:06:02,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:06:02,685 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:06:02,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:02,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:06:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-11-06 19:06:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:06:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:06:03,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:06:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:06:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:06:03,044 INFO L87 Difference]: Start difference. First operand 130901 states and 142197 transitions. Second operand 7 states. [2018-11-06 19:06:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:16,406 INFO L93 Difference]: Finished difference Result 258787 states and 281383 transitions. [2018-11-06 19:06:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:06:16,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 497 [2018-11-06 19:06:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:16,585 INFO L225 Difference]: With dead ends: 258787 [2018-11-06 19:06:16,585 INFO L226 Difference]: Without dead ends: 128640 [2018-11-06 19:06:16,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 499 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:06:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128640 states. [2018-11-06 19:06:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128640 to 125632. [2018-11-06 19:06:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125632 states. [2018-11-06 19:06:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125632 states to 125632 states and 132732 transitions. [2018-11-06 19:06:18,844 INFO L78 Accepts]: Start accepts. Automaton has 125632 states and 132732 transitions. Word has length 497 [2018-11-06 19:06:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:18,845 INFO L480 AbstractCegarLoop]: Abstraction has 125632 states and 132732 transitions. [2018-11-06 19:06:18,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:06:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 125632 states and 132732 transitions. [2018-11-06 19:06:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-11-06 19:06:18,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:18,880 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:06:18,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:18,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1463867924, now seen corresponding path program 1 times [2018-11-06 19:06:18,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:18,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:18,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-06 19:06:21,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:21,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:06:21,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:06:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:06:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:21,074 INFO L87 Difference]: Start difference. First operand 125632 states and 132732 transitions. Second operand 4 states. [2018-11-06 19:06:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:27,658 INFO L93 Difference]: Finished difference Result 261790 states and 276791 transitions. [2018-11-06 19:06:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:06:27,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 698 [2018-11-06 19:06:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:27,800 INFO L225 Difference]: With dead ends: 261790 [2018-11-06 19:06:27,801 INFO L226 Difference]: Without dead ends: 136912 [2018-11-06 19:06:27,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-06 19:06:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136912 states. [2018-11-06 19:06:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136912 to 133904. [2018-11-06 19:06:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133904 states. [2018-11-06 19:06:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133904 states to 133904 states and 140186 transitions. [2018-11-06 19:06:30,381 INFO L78 Accepts]: Start accepts. Automaton has 133904 states and 140186 transitions. Word has length 698 [2018-11-06 19:06:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:30,382 INFO L480 AbstractCegarLoop]: Abstraction has 133904 states and 140186 transitions. [2018-11-06 19:06:30,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:06:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 133904 states and 140186 transitions. [2018-11-06 19:06:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2018-11-06 19:06:30,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:30,445 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:06:30,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:30,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash -28131880, now seen corresponding path program 1 times [2018-11-06 19:06:30,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:30,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:30,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:06:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:06:35,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:06:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:06:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:35,637 INFO L87 Difference]: Start difference. First operand 133904 states and 140186 transitions. Second operand 4 states. [2018-11-06 19:06:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:42,018 INFO L93 Difference]: Finished difference Result 267054 states and 279613 transitions. [2018-11-06 19:06:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:06:42,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 905 [2018-11-06 19:06:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:42,176 INFO L225 Difference]: With dead ends: 267054 [2018-11-06 19:06:42,176 INFO L226 Difference]: Without dead ends: 129383 [2018-11-06 19:06:42,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129383 states. [2018-11-06 19:06:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129383 to 124871. [2018-11-06 19:06:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124871 states. [2018-11-06 19:06:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124871 states to 124871 states and 128727 transitions. [2018-11-06 19:06:43,280 INFO L78 Accepts]: Start accepts. Automaton has 124871 states and 128727 transitions. Word has length 905 [2018-11-06 19:06:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 124871 states and 128727 transitions. [2018-11-06 19:06:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:06:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 124871 states and 128727 transitions. [2018-11-06 19:06:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2018-11-06 19:06:43,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:43,343 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:06:43,344 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:43,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:43,344 INFO L82 PathProgramCache]: Analyzing trace with hash 760328512, now seen corresponding path program 1 times [2018-11-06 19:06:43,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:43,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:43,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:43,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:43,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:44,271 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 19:06:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-11-06 19:06:45,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:06:45,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:06:45,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:06:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:06:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:45,046 INFO L87 Difference]: Start difference. First operand 124871 states and 128727 transitions. Second operand 4 states. [2018-11-06 19:06:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:06:50,097 INFO L93 Difference]: Finished difference Result 249740 states and 257451 transitions. [2018-11-06 19:06:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:06:50,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 993 [2018-11-06 19:06:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:06:50,224 INFO L225 Difference]: With dead ends: 249740 [2018-11-06 19:06:50,224 INFO L226 Difference]: Without dead ends: 120353 [2018-11-06 19:06:50,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:06:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120353 states. [2018-11-06 19:06:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120353 to 118849. [2018-11-06 19:06:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118849 states. [2018-11-06 19:06:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118849 states to 118849 states and 122482 transitions. [2018-11-06 19:06:51,561 INFO L78 Accepts]: Start accepts. Automaton has 118849 states and 122482 transitions. Word has length 993 [2018-11-06 19:06:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:06:51,562 INFO L480 AbstractCegarLoop]: Abstraction has 118849 states and 122482 transitions. [2018-11-06 19:06:51,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:06:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 118849 states and 122482 transitions. [2018-11-06 19:06:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2018-11-06 19:06:51,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:06:51,614 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:06:51,614 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:06:51,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:06:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1341308809, now seen corresponding path program 1 times [2018-11-06 19:06:51,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:06:51,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:06:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:06:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:52,421 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:06:52,782 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-06 19:06:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1014 proven. 461 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-06 19:06:54,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:06:54,520 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:06:54,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:06:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:06:54,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:06:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1250 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-11-06 19:06:55,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:06:55,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 19:06:55,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:06:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:06:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:06:55,917 INFO L87 Difference]: Start difference. First operand 118849 states and 122482 transitions. Second operand 11 states. [2018-11-06 19:07:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:07:36,352 INFO L93 Difference]: Finished difference Result 258001 states and 265953 transitions. [2018-11-06 19:07:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 19:07:36,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1076 [2018-11-06 19:07:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:07:36,518 INFO L225 Difference]: With dead ends: 258001 [2018-11-06 19:07:36,519 INFO L226 Difference]: Without dead ends: 131621 [2018-11-06 19:07:36,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1082 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-11-06 19:07:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131621 states. [2018-11-06 19:07:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131621 to 111317. [2018-11-06 19:07:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111317 states. [2018-11-06 19:07:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111317 states to 111317 states and 113919 transitions. [2018-11-06 19:07:38,046 INFO L78 Accepts]: Start accepts. Automaton has 111317 states and 113919 transitions. Word has length 1076 [2018-11-06 19:07:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:07:38,046 INFO L480 AbstractCegarLoop]: Abstraction has 111317 states and 113919 transitions. [2018-11-06 19:07:38,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:07:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 111317 states and 113919 transitions. [2018-11-06 19:07:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-11-06 19:07:38,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:07:38,098 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:07:38,098 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:07:38,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:07:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1911710261, now seen corresponding path program 1 times [2018-11-06 19:07:38,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:07:38,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:07:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:38,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:07:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 1267 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-06 19:07:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:07:39,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:39,413 INFO L87 Difference]: Start difference. First operand 111317 states and 113919 transitions. Second operand 4 states. [2018-11-06 19:07:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:07:45,548 INFO L93 Difference]: Finished difference Result 221880 states and 227079 transitions. [2018-11-06 19:07:45,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:07:45,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1088 [2018-11-06 19:07:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:07:45,670 INFO L225 Difference]: With dead ends: 221880 [2018-11-06 19:07:45,670 INFO L226 Difference]: Without dead ends: 104537 [2018-11-06 19:07:45,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104537 states. [2018-11-06 19:07:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104537 to 97769. [2018-11-06 19:07:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97769 states. [2018-11-06 19:07:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97769 states to 97769 states and 99665 transitions. [2018-11-06 19:07:47,030 INFO L78 Accepts]: Start accepts. Automaton has 97769 states and 99665 transitions. Word has length 1088 [2018-11-06 19:07:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:07:47,031 INFO L480 AbstractCegarLoop]: Abstraction has 97769 states and 99665 transitions. [2018-11-06 19:07:47,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:07:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97769 states and 99665 transitions. [2018-11-06 19:07:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2018-11-06 19:07:47,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:07:47,083 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:07:47,084 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:07:47,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:07:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash -987531257, now seen corresponding path program 1 times [2018-11-06 19:07:47,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:07:47,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:07:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:47,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:07:47,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:47,997 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:07:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-11-06 19:07:49,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:07:49,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:49,261 INFO L87 Difference]: Start difference. First operand 97769 states and 99665 transitions. Second operand 4 states. Received shutdown request... [2018-11-06 19:07:49,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 19:07:49,509 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:07:49,514 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:07:49,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:07:49 BoogieIcfgContainer [2018-11-06 19:07:49,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:07:49,515 INFO L168 Benchmark]: Toolchain (without parser) took 223941.18 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,516 INFO L168 Benchmark]: CDTParser took 1.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:07:49,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2057.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 627.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -963.2 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,519 INFO L168 Benchmark]: Boogie Preprocessor took 336.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,519 INFO L168 Benchmark]: RCFGBuilder took 8828.56 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 233.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -200.8 MB). Peak memory consumption was 627.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,520 INFO L168 Benchmark]: TraceAbstraction took 212086.32 ms. Allocated memory was 2.5 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 203.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 19:07:49,525 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2057.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 627.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 783.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -963.2 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 336.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8828.56 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 233.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -200.8 MB). Peak memory consumption was 627.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 212086.32 ms. Allocated memory was 2.5 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 203.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 63). Cancelled while BasicCegarLoop was constructing difference of abstraction (97769states) and FLOYD_HOARE automaton (currently 2 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (273 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 211.9s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 170.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9438 SDtfs, 38576 SDslu, 1964 SDs, 0 SdLazy, 118976 SolverSat, 15419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 131.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1968 GetRequests, 1884 SyntacticMatches, 25 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133904occurred in iteration=12, 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: 18.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 89599 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 10423 NumberOfCodeBlocks, 10423 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 18910182 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2345 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 12942/13416 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown