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/Problem16_label22_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:23:45,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:23:45,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:23:45,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:23:45,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:23:45,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:23:45,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:23:45,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:23:45,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:23:45,547 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:23:45,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:23:45,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:23:45,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:23:45,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:23:45,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:23:45,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:23:45,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:23:45,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:23:45,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:23:45,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:23:45,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:23:45,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:23:45,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:23:45,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:23:45,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:23:45,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:23:45,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:23:45,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:23:45,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:23:45,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:23:45,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:23:45,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:23:45,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:23:45,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:23:45,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:23:45,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:23:45,591 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:23:45,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:23:45,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:23:45,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:23:45,615 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:23:45,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:23:45,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:23:45,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:23:45,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:23:45,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:23:45,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:23:45,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:23:45,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:23:45,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:23:45,618 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:23:45,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:23:45,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:23:45,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:23:45,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:23:45,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:23:45,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:23:45,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:23:45,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:23:45,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:23:45,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:23:45,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:23:45,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:23:45,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:23:45,622 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:23:45,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:23:45,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:23:45,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:23:45,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:23:45,693 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:23:45,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label22_false-unreach-call.c [2018-11-06 19:23:45,760 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd50fbe30/69320afd8a7a450f92368406f0823714/FLAG568c3579f [2018-11-06 19:23:46,406 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:23:46,407 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label22_false-unreach-call.c [2018-11-06 19:23:46,427 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd50fbe30/69320afd8a7a450f92368406f0823714/FLAG568c3579f [2018-11-06 19:23:46,448 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd50fbe30/69320afd8a7a450f92368406f0823714 [2018-11-06 19:23:46,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:23:46,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:23:46,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:23:46,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:23:46,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:23:46,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:46" (1/1) ... [2018-11-06 19:23:46,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9260898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:46, skipping insertion in model container [2018-11-06 19:23:46,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:46" (1/1) ... [2018-11-06 19:23:46,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:23:46,574 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:23:47,530 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:23:47,536 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:23:47,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:23:47,862 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:23:47,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47 WrapperNode [2018-11-06 19:23:47,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:23:47,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:23:47,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:23:47,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:23:47,876 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:23:47" (1/1) ... [2018-11-06 19:23:48,044 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:23:47" (1/1) ... [2018-11-06 19:23:48,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:23:48,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:23:48,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:23:48,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:23:48,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (1/1) ... [2018-11-06 19:23:48,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:23:48,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:23:48,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:23:48,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:23:48,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (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:23:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:23:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:23:48,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:23:54,473 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:23:54,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:54 BoogieIcfgContainer [2018-11-06 19:23:54,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:23:54,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:23:54,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:23:54,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:23:54,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:46" (1/3) ... [2018-11-06 19:23:54,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ccc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:54, skipping insertion in model container [2018-11-06 19:23:54,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:47" (2/3) ... [2018-11-06 19:23:54,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ccc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:54, skipping insertion in model container [2018-11-06 19:23:54,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:54" (3/3) ... [2018-11-06 19:23:54,483 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label22_false-unreach-call.c [2018-11-06 19:23:54,492 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:23:54,500 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:23:54,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:23:54,559 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:23:54,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:23:54,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:23:54,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:23:54,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:23:54,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:23:54,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:23:54,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:23:54,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:23:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-11-06 19:23:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-06 19:23:54,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:54,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:54,606 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:54,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash 340357962, now seen corresponding path program 1 times [2018-11-06 19:23:54,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:54,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:54,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:55,014 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:23:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:23:55,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:23:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:23:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:55,042 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-11-06 19:24:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:01,751 INFO L93 Difference]: Finished difference Result 1473 states and 2781 transitions. [2018-11-06 19:24:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:01,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-06 19:24:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:01,783 INFO L225 Difference]: With dead ends: 1473 [2018-11-06 19:24:01,783 INFO L226 Difference]: Without dead ends: 1069 [2018-11-06 19:24:01,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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:24:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-06 19:24:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2018-11-06 19:24:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-11-06 19:24:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1914 transitions. [2018-11-06 19:24:01,901 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1914 transitions. Word has length 14 [2018-11-06 19:24:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:01,901 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 1914 transitions. [2018-11-06 19:24:01,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1914 transitions. [2018-11-06 19:24:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-06 19:24:01,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:01,907 INFO L375 BasicCegarLoop]: trace histogram [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:24:01,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:01,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:01,908 INFO L82 PathProgramCache]: Analyzing trace with hash 549376810, now seen corresponding path program 1 times [2018-11-06 19:24:01,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:01,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:01,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:01,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:24:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:02,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:24:02,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:02,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:02,129 INFO L87 Difference]: Start difference. First operand 1069 states and 1914 transitions. Second operand 4 states. [2018-11-06 19:24:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:07,138 INFO L93 Difference]: Finished difference Result 4116 states and 7498 transitions. [2018-11-06 19:24:07,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:07,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-06 19:24:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:07,157 INFO L225 Difference]: With dead ends: 4116 [2018-11-06 19:24:07,157 INFO L226 Difference]: Without dead ends: 3049 [2018-11-06 19:24:07,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2018-11-06 19:24:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 3049. [2018-11-06 19:24:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3049 states. [2018-11-06 19:24:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4881 transitions. [2018-11-06 19:24:07,230 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4881 transitions. Word has length 81 [2018-11-06 19:24:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:07,230 INFO L480 AbstractCegarLoop]: Abstraction has 3049 states and 4881 transitions. [2018-11-06 19:24:07,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4881 transitions. [2018-11-06 19:24:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-06 19:24:07,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:07,240 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:24:07,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:07,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1240645888, now seen corresponding path program 1 times [2018-11-06 19:24:07,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:07,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:07,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:07,915 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-06 19:24:08,294 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-11-06 19:24:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:24:08,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:08,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:24:08,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:24:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:24:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:24:08,455 INFO L87 Difference]: Start difference. First operand 3049 states and 4881 transitions. Second operand 7 states. [2018-11-06 19:24:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:16,487 INFO L93 Difference]: Finished difference Result 9395 states and 14329 transitions. [2018-11-06 19:24:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:24:16,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2018-11-06 19:24:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:16,521 INFO L225 Difference]: With dead ends: 9395 [2018-11-06 19:24:16,521 INFO L226 Difference]: Without dead ends: 6348 [2018-11-06 19:24:16,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:24:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-11-06 19:24:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 6016. [2018-11-06 19:24:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6016 states. [2018-11-06 19:24:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6016 states to 6016 states and 8749 transitions. [2018-11-06 19:24:16,647 INFO L78 Accepts]: Start accepts. Automaton has 6016 states and 8749 transitions. Word has length 149 [2018-11-06 19:24:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:16,648 INFO L480 AbstractCegarLoop]: Abstraction has 6016 states and 8749 transitions. [2018-11-06 19:24:16,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:24:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6016 states and 8749 transitions. [2018-11-06 19:24:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-06 19:24:16,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:16,662 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:16,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1900838013, now seen corresponding path program 1 times [2018-11-06 19:24:16,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:16,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:16,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:16,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:17,081 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:24:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-06 19:24:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:24:17,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:24:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:24:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:24:17,523 INFO L87 Difference]: Start difference. First operand 6016 states and 8749 transitions. Second operand 7 states. [2018-11-06 19:24:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:22,546 INFO L93 Difference]: Finished difference Result 12419 states and 17899 transitions. [2018-11-06 19:24:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:24:22,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2018-11-06 19:24:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:22,578 INFO L225 Difference]: With dead ends: 12419 [2018-11-06 19:24:22,578 INFO L226 Difference]: Without dead ends: 6405 [2018-11-06 19:24:22,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:24:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2018-11-06 19:24:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6346. [2018-11-06 19:24:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6346 states. [2018-11-06 19:24:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 9085 transitions. [2018-11-06 19:24:22,735 INFO L78 Accepts]: Start accepts. Automaton has 6346 states and 9085 transitions. Word has length 241 [2018-11-06 19:24:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:22,736 INFO L480 AbstractCegarLoop]: Abstraction has 6346 states and 9085 transitions. [2018-11-06 19:24:22,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:24:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 6346 states and 9085 transitions. [2018-11-06 19:24:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-06 19:24:22,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:22,741 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,742 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1428658561, now seen corresponding path program 1 times [2018-11-06 19:24:22,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:23,065 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:24:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 19:24:23,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:23,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:24:23,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:23,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:23,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:23,143 INFO L87 Difference]: Start difference. First operand 6346 states and 9085 transitions. Second operand 4 states. [2018-11-06 19:24:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:25,533 INFO L93 Difference]: Finished difference Result 16980 states and 24791 transitions. [2018-11-06 19:24:25,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:24:25,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2018-11-06 19:24:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:25,584 INFO L225 Difference]: With dead ends: 16980 [2018-11-06 19:24:25,585 INFO L226 Difference]: Without dead ends: 10966 [2018-11-06 19:24:25,594 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:24:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10966 states. [2018-11-06 19:24:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10966 to 10966. [2018-11-06 19:24:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10966 states. [2018-11-06 19:24:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10966 states to 10966 states and 14706 transitions. [2018-11-06 19:24:25,769 INFO L78 Accepts]: Start accepts. Automaton has 10966 states and 14706 transitions. Word has length 244 [2018-11-06 19:24:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 10966 states and 14706 transitions. [2018-11-06 19:24:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10966 states and 14706 transitions. [2018-11-06 19:24:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-11-06 19:24:25,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:25,778 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:24:25,778 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:25,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 697681205, now seen corresponding path program 1 times [2018-11-06 19:24:25,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:25,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-06 19:24:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:24:26,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:24:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:24:26,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:24:26,195 INFO L87 Difference]: Start difference. First operand 10966 states and 14706 transitions. Second operand 3 states. [2018-11-06 19:24:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:28,468 INFO L93 Difference]: Finished difference Result 26550 states and 35820 transitions. [2018-11-06 19:24:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:24:28,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2018-11-06 19:24:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:28,493 INFO L225 Difference]: With dead ends: 26550 [2018-11-06 19:24:28,493 INFO L226 Difference]: Without dead ends: 12590 [2018-11-06 19:24:28,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:24:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12590 states. [2018-11-06 19:24:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12590 to 12590. [2018-11-06 19:24:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12590 states. [2018-11-06 19:24:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12590 states to 12590 states and 14003 transitions. [2018-11-06 19:24:28,675 INFO L78 Accepts]: Start accepts. Automaton has 12590 states and 14003 transitions. Word has length 394 [2018-11-06 19:24:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:28,675 INFO L480 AbstractCegarLoop]: Abstraction has 12590 states and 14003 transitions. [2018-11-06 19:24:28,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:24:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 12590 states and 14003 transitions. [2018-11-06 19:24:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-11-06 19:24:28,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:28,684 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:24:28,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:28,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 201322050, now seen corresponding path program 1 times [2018-11-06 19:24:28,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:28,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:24:29,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:29,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:29,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:29,098 INFO L87 Difference]: Start difference. First operand 12590 states and 14003 transitions. Second operand 4 states. [2018-11-06 19:24:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:31,491 INFO L93 Difference]: Finished difference Result 31778 states and 35523 transitions. [2018-11-06 19:24:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:31,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2018-11-06 19:24:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:31,533 INFO L225 Difference]: With dead ends: 31778 [2018-11-06 19:24:31,534 INFO L226 Difference]: Without dead ends: 19520 [2018-11-06 19:24:31,553 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:24:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19520 states. [2018-11-06 19:24:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19520 to 18530. [2018-11-06 19:24:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18530 states. [2018-11-06 19:24:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18530 states to 18530 states and 20230 transitions. [2018-11-06 19:24:31,965 INFO L78 Accepts]: Start accepts. Automaton has 18530 states and 20230 transitions. Word has length 410 [2018-11-06 19:24:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:31,966 INFO L480 AbstractCegarLoop]: Abstraction has 18530 states and 20230 transitions. [2018-11-06 19:24:31,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18530 states and 20230 transitions. [2018-11-06 19:24:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-06 19:24:31,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:31,978 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:24:31,978 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:31,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -175545890, now seen corresponding path program 1 times [2018-11-06 19:24:31,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:31,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:31,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:32,489 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:24:32,869 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 19:24:33,316 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-06 19:24:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 67 proven. 130 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-06 19:24:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:24:34,128 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:24:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:34,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:24:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-11-06 19:24:34,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:24:34,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-11-06 19:24:34,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:24:34,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:24:34,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:24:34,837 INFO L87 Difference]: Start difference. First operand 18530 states and 20230 transitions. Second operand 11 states. [2018-11-06 19:24:35,003 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:24:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:45,248 INFO L93 Difference]: Finished difference Result 44021 states and 47868 transitions. [2018-11-06 19:24:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 19:24:45,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 422 [2018-11-06 19:24:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:45,296 INFO L225 Difference]: With dead ends: 44021 [2018-11-06 19:24:45,296 INFO L226 Difference]: Without dead ends: 25823 [2018-11-06 19:24:45,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:24:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25823 states. [2018-11-06 19:24:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25823 to 23809. [2018-11-06 19:24:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23809 states. [2018-11-06 19:24:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23809 states to 23809 states and 25479 transitions. [2018-11-06 19:24:45,687 INFO L78 Accepts]: Start accepts. Automaton has 23809 states and 25479 transitions. Word has length 422 [2018-11-06 19:24:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:45,687 INFO L480 AbstractCegarLoop]: Abstraction has 23809 states and 25479 transitions. [2018-11-06 19:24:45,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:24:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23809 states and 25479 transitions. [2018-11-06 19:24:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-11-06 19:24:45,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:45,708 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:45,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash 77242414, now seen corresponding path program 1 times [2018-11-06 19:24:45,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:45,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:45,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:46,452 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:24:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-06 19:24:46,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:46,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:46,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:46,993 INFO L87 Difference]: Start difference. First operand 23809 states and 25479 transitions. Second operand 4 states. [2018-11-06 19:24:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:49,389 INFO L93 Difference]: Finished difference Result 47286 states and 50624 transitions. [2018-11-06 19:24:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:49,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 548 [2018-11-06 19:24:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:49,427 INFO L225 Difference]: With dead ends: 47286 [2018-11-06 19:24:49,427 INFO L226 Difference]: Without dead ends: 23809 [2018-11-06 19:24:49,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23809 states. [2018-11-06 19:24:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23809 to 23809. [2018-11-06 19:24:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23809 states. [2018-11-06 19:24:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23809 states to 23809 states and 25204 transitions. [2018-11-06 19:24:49,704 INFO L78 Accepts]: Start accepts. Automaton has 23809 states and 25204 transitions. Word has length 548 [2018-11-06 19:24:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:49,705 INFO L480 AbstractCegarLoop]: Abstraction has 23809 states and 25204 transitions. [2018-11-06 19:24:49,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 23809 states and 25204 transitions. [2018-11-06 19:24:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-06 19:24:49,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:49,727 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:24:49,727 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:49,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1898482885, now seen corresponding path program 1 times [2018-11-06 19:24:49,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:49,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:49,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-06 19:24:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:50,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:50,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:50,323 INFO L87 Difference]: Start difference. First operand 23809 states and 25204 transitions. Second operand 4 states. [2018-11-06 19:24:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:52,482 INFO L93 Difference]: Finished difference Result 50585 states and 53469 transitions. [2018-11-06 19:24:52,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:52,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 571 [2018-11-06 19:24:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:52,512 INFO L225 Difference]: With dead ends: 50585 [2018-11-06 19:24:52,512 INFO L226 Difference]: Without dead ends: 27108 [2018-11-06 19:24:52,529 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:24:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27108 states. [2018-11-06 19:24:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27108 to 23806. [2018-11-06 19:24:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2018-11-06 19:24:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 24891 transitions. [2018-11-06 19:24:52,977 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 24891 transitions. Word has length 571 [2018-11-06 19:24:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:52,978 INFO L480 AbstractCegarLoop]: Abstraction has 23806 states and 24891 transitions. [2018-11-06 19:24:52,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 24891 transitions. [2018-11-06 19:24:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2018-11-06 19:24:53,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:53,027 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:53,027 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:53,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 533836620, now seen corresponding path program 1 times [2018-11-06 19:24:53,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2927 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2018-11-06 19:24:55,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:55,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:55,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:55,280 INFO L87 Difference]: Start difference. First operand 23806 states and 24891 transitions. Second operand 4 states. [2018-11-06 19:24:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:57,564 INFO L93 Difference]: Finished difference Result 47275 states and 49410 transitions. [2018-11-06 19:24:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:57,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1363 [2018-11-06 19:24:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:57,593 INFO L225 Difference]: With dead ends: 47275 [2018-11-06 19:24:57,593 INFO L226 Difference]: Without dead ends: 23471 [2018-11-06 19:24:57,611 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:24:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23471 states. [2018-11-06 19:24:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23471 to 23141. [2018-11-06 19:24:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23141 states. [2018-11-06 19:24:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23141 states to 23141 states and 23922 transitions. [2018-11-06 19:24:57,892 INFO L78 Accepts]: Start accepts. Automaton has 23141 states and 23922 transitions. Word has length 1363 [2018-11-06 19:24:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:57,894 INFO L480 AbstractCegarLoop]: Abstraction has 23141 states and 23922 transitions. [2018-11-06 19:24:57,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23141 states and 23922 transitions. [2018-11-06 19:24:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1365 [2018-11-06 19:24:57,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:57,940 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:57,941 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash -385920212, now seen corresponding path program 1 times [2018-11-06 19:24:57,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:57,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 2160 proven. 0 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2018-11-06 19:25:01,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:25:01,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-06 19:25:01,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:25:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:25:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:25:01,642 INFO L87 Difference]: Start difference. First operand 23141 states and 23922 transitions. Second operand 9 states. [2018-11-06 19:25:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:05,296 INFO L93 Difference]: Finished difference Result 46519 states and 48110 transitions. [2018-11-06 19:25:05,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:25:05,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1364 [2018-11-06 19:25:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:05,324 INFO L225 Difference]: With dead ends: 46519 [2018-11-06 19:25:05,324 INFO L226 Difference]: Without dead ends: 23380 [2018-11-06 19:25:05,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:25:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23380 states. [2018-11-06 19:25:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23380 to 21160. [2018-11-06 19:25:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21160 states. [2018-11-06 19:25:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21160 states to 21160 states and 21730 transitions. [2018-11-06 19:25:05,573 INFO L78 Accepts]: Start accepts. Automaton has 21160 states and 21730 transitions. Word has length 1364 [2018-11-06 19:25:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:05,575 INFO L480 AbstractCegarLoop]: Abstraction has 21160 states and 21730 transitions. [2018-11-06 19:25:05,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:25:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21160 states and 21730 transitions. [2018-11-06 19:25:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1775 [2018-11-06 19:25:05,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:05,629 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:25:05,629 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:05,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1375269529, now seen corresponding path program 1 times [2018-11-06 19:25:05,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:05,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4982 backedges. 3529 proven. 0 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2018-11-06 19:25:08,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:25:08,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:25:08,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:25:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:25:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:25:08,999 INFO L87 Difference]: Start difference. First operand 21160 states and 21730 transitions. Second operand 6 states. [2018-11-06 19:25:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:11,286 INFO L93 Difference]: Finished difference Result 42982 states and 44140 transitions. [2018-11-06 19:25:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:25:11,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1774 [2018-11-06 19:25:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:11,311 INFO L225 Difference]: With dead ends: 42982 [2018-11-06 19:25:11,311 INFO L226 Difference]: Without dead ends: 21824 [2018-11-06 19:25:11,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:25:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21824 states. [2018-11-06 19:25:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21824 to 21490. [2018-11-06 19:25:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21490 states. [2018-11-06 19:25:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21490 states to 21490 states and 22068 transitions. [2018-11-06 19:25:11,529 INFO L78 Accepts]: Start accepts. Automaton has 21490 states and 22068 transitions. Word has length 1774 [2018-11-06 19:25:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:11,530 INFO L480 AbstractCegarLoop]: Abstraction has 21490 states and 22068 transitions. [2018-11-06 19:25:11,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:25:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21490 states and 22068 transitions. [2018-11-06 19:25:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2033 [2018-11-06 19:25:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:11,691 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:11,691 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:11,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash -802222378, now seen corresponding path program 1 times [2018-11-06 19:25:11,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6754 backedges. 2793 proven. 243 refuted. 0 times theorem prover too weak. 3718 trivial. 0 not checked. [2018-11-06 19:25:17,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:17,172 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:25:17,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:17,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6754 backedges. 2793 proven. 0 refuted. 0 times theorem prover too weak. 3961 trivial. 0 not checked. [2018-11-06 19:25:20,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:25:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-11-06 19:25:20,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:25:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:25:20,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:25:20,765 INFO L87 Difference]: Start difference. First operand 21490 states and 22068 transitions. Second operand 10 states. [2018-11-06 19:25:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:29,002 INFO L93 Difference]: Finished difference Result 45625 states and 46810 transitions. [2018-11-06 19:25:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:25:29,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2032 [2018-11-06 19:25:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:29,026 INFO L225 Difference]: With dead ends: 45625 [2018-11-06 19:25:29,027 INFO L226 Difference]: Without dead ends: 24137 [2018-11-06 19:25:29,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2048 GetRequests, 2031 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:25:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24137 states. [2018-11-06 19:25:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24137 to 21490. [2018-11-06 19:25:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21490 states. [2018-11-06 19:25:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21490 states to 21490 states and 22060 transitions. [2018-11-06 19:25:29,246 INFO L78 Accepts]: Start accepts. Automaton has 21490 states and 22060 transitions. Word has length 2032 [2018-11-06 19:25:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:29,247 INFO L480 AbstractCegarLoop]: Abstraction has 21490 states and 22060 transitions. [2018-11-06 19:25:29,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:25:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 21490 states and 22060 transitions. [2018-11-06 19:25:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2064 [2018-11-06 19:25:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:29,296 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,296 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:29,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -16334730, now seen corresponding path program 1 times [2018-11-06 19:25:29,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:29,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:29,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:30,208 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-06 19:25:30,523 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-11-06 19:25:30,862 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 19:25:31,049 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-11-06 19:25:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7426 backedges. 2661 proven. 158 refuted. 0 times theorem prover too weak. 4607 trivial. 0 not checked. [2018-11-06 19:25:34,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:34,112 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:25:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:34,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7426 backedges. 2819 proven. 0 refuted. 0 times theorem prover too weak. 4607 trivial. 0 not checked. [2018-11-06 19:25:37,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:25:37,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 19:25:37,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:25:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:25:37,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:25:37,215 INFO L87 Difference]: Start difference. First operand 21490 states and 22060 transitions. Second operand 10 states. [2018-11-06 19:25:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:46,069 INFO L93 Difference]: Finished difference Result 55172 states and 56618 transitions. [2018-11-06 19:25:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 19:25:46,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2063 [2018-11-06 19:25:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:46,098 INFO L225 Difference]: With dead ends: 55172 [2018-11-06 19:25:46,098 INFO L226 Difference]: Without dead ends: 33684 [2018-11-06 19:25:46,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2093 GetRequests, 2073 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:25:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33684 states. [2018-11-06 19:25:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33684 to 26701. [2018-11-06 19:25:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26701 states. [2018-11-06 19:25:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26701 states to 26701 states and 27309 transitions. [2018-11-06 19:25:46,359 INFO L78 Accepts]: Start accepts. Automaton has 26701 states and 27309 transitions. Word has length 2063 [2018-11-06 19:25:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:46,359 INFO L480 AbstractCegarLoop]: Abstraction has 26701 states and 27309 transitions. [2018-11-06 19:25:46,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:25:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26701 states and 27309 transitions. [2018-11-06 19:25:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2125 [2018-11-06 19:25:46,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:46,400 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:46,400 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:46,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1055198405, now seen corresponding path program 1 times [2018-11-06 19:25:46,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:46,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:46,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:47,632 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:25:47,819 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:25:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7734 backedges. 3547 proven. 251 refuted. 0 times theorem prover too weak. 3936 trivial. 0 not checked. [2018-11-06 19:25:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:52,895 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:25:52,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:53,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7734 backedges. 4284 proven. 0 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2018-11-06 19:25:55,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:25:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-11-06 19:25:55,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:25:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:25:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:25:55,858 INFO L87 Difference]: Start difference. First operand 26701 states and 27309 transitions. Second operand 9 states. [2018-11-06 19:26:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:26:03,221 INFO L93 Difference]: Finished difference Result 57319 states and 58689 transitions. [2018-11-06 19:26:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:26:03,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2124 [2018-11-06 19:26:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:26:03,249 INFO L225 Difference]: With dead ends: 57319 [2018-11-06 19:26:03,249 INFO L226 Difference]: Without dead ends: 30620 [2018-11-06 19:26:03,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2143 GetRequests, 2127 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:26:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30620 states. [2018-11-06 19:26:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30620 to 30138. [2018-11-06 19:26:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30138 states. [2018-11-06 19:26:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30138 states to 30138 states and 30770 transitions. [2018-11-06 19:26:03,582 INFO L78 Accepts]: Start accepts. Automaton has 30138 states and 30770 transitions. Word has length 2124 [2018-11-06 19:26:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:26:03,583 INFO L480 AbstractCegarLoop]: Abstraction has 30138 states and 30770 transitions. [2018-11-06 19:26:03,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:26:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30138 states and 30770 transitions. [2018-11-06 19:26:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2436 [2018-11-06 19:26:03,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:26:03,797 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:26:03,797 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:26:03,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:26:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 223387130, now seen corresponding path program 1 times [2018-11-06 19:26:03,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:26:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:26:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:03,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:06,066 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:26:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9925 backedges. 4969 proven. 572 refuted. 0 times theorem prover too weak. 4384 trivial. 0 not checked. [2018-11-06 19:26:10,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:26:10,357 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:26:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:10,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:26:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9925 backedges. 5074 proven. 467 refuted. 0 times theorem prover too weak. 4384 trivial. 0 not checked. [2018-11-06 19:26:14,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:26:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-11-06 19:26:14,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:26:14,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:26:14,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:26:14,595 INFO L87 Difference]: Start difference. First operand 30138 states and 30770 transitions. Second operand 9 states. [2018-11-06 19:26:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:26:19,835 INFO L93 Difference]: Finished difference Result 60403 states and 61663 transitions. [2018-11-06 19:26:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 19:26:19,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2435 [2018-11-06 19:26:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:26:19,862 INFO L225 Difference]: With dead ends: 60403 [2018-11-06 19:26:19,862 INFO L226 Difference]: Without dead ends: 31257 [2018-11-06 19:26:19,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2448 GetRequests, 2435 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:26:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31257 states. [2018-11-06 19:26:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31257 to 29891. [2018-11-06 19:26:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29891 states. [2018-11-06 19:26:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29891 states to 29891 states and 30437 transitions. [2018-11-06 19:26:20,174 INFO L78 Accepts]: Start accepts. Automaton has 29891 states and 30437 transitions. Word has length 2435 [2018-11-06 19:26:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:26:20,175 INFO L480 AbstractCegarLoop]: Abstraction has 29891 states and 30437 transitions. [2018-11-06 19:26:20,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:26:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29891 states and 30437 transitions. [2018-11-06 19:26:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2458 [2018-11-06 19:26:20,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:26:20,235 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:26:20,235 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:26:20,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:26:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1470984143, now seen corresponding path program 1 times [2018-11-06 19:26:20,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:26:20,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:26:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10083 backedges. 6953 proven. 889 refuted. 0 times theorem prover too weak. 2241 trivial. 0 not checked. [2018-11-06 19:26:28,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:26:28,716 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:26:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:29,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:26:29,889 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 432 DAG size of output: 28 [2018-11-06 19:26:30,708 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-06 19:26:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10083 backedges. 7832 proven. 10 refuted. 0 times theorem prover too weak. 2241 trivial. 0 not checked. [2018-11-06 19:26:43,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:26:43,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-06 19:26:43,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 19:26:43,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 19:26:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:26:43,695 INFO L87 Difference]: Start difference. First operand 29891 states and 30437 transitions. Second operand 13 states. [2018-11-06 19:26:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:26:53,939 INFO L93 Difference]: Finished difference Result 80955 states and 82396 transitions. [2018-11-06 19:26:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 19:26:53,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 2457 [2018-11-06 19:26:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:26:53,994 INFO L225 Difference]: With dead ends: 80955 [2018-11-06 19:26:53,994 INFO L226 Difference]: Without dead ends: 52056 [2018-11-06 19:26:54,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2490 GetRequests, 2386 SyntacticMatches, 81 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-11-06 19:26:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52056 states. [2018-11-06 19:26:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52056 to 31528. [2018-11-06 19:26:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31528 states. [2018-11-06 19:26:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31528 states to 31528 states and 32008 transitions. [2018-11-06 19:26:54,423 INFO L78 Accepts]: Start accepts. Automaton has 31528 states and 32008 transitions. Word has length 2457 [2018-11-06 19:26:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:26:54,424 INFO L480 AbstractCegarLoop]: Abstraction has 31528 states and 32008 transitions. [2018-11-06 19:26:54,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 19:26:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31528 states and 32008 transitions. [2018-11-06 19:26:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2679 [2018-11-06 19:26:54,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:26:54,475 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:26:54,475 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:26:54,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:26:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 342412550, now seen corresponding path program 1 times [2018-11-06 19:26:54,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:26:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:26:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:56,806 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 19:26:57,117 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-06 19:27:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12206 backedges. 8936 proven. 1277 refuted. 0 times theorem prover too weak. 1993 trivial. 0 not checked. [2018-11-06 19:27:06,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:27:06,043 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:27:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:27:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:27:06,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:27:07,971 WARN L179 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-06 19:27:08,597 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-11-06 19:27:09,008 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 18 [2018-11-06 19:27:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12206 backedges. 9150 proven. 816 refuted. 0 times theorem prover too weak. 2240 trivial. 0 not checked. [2018-11-06 19:27:16,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:27:16,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-06 19:27:16,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 19:27:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 19:27:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:27:16,329 INFO L87 Difference]: Start difference. First operand 31528 states and 32008 transitions. Second operand 13 states. Received shutdown request... [2018-11-06 19:27:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 19:27:28,661 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:27:28,667 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:27:28,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:27:28 BoogieIcfgContainer [2018-11-06 19:27:28,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:27:28,669 INFO L168 Benchmark]: Toolchain (without parser) took 222210.96 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,670 INFO L168 Benchmark]: CDTParser took 0.21 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:27:28,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1404.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 328.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -851.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,672 INFO L168 Benchmark]: Boogie Preprocessor took 164.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,673 INFO L168 Benchmark]: RCFGBuilder took 6115.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 276.8 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,674 INFO L168 Benchmark]: TraceAbstraction took 214192.69 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.7 GB in the end (delta: -823.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-06 19:27:28,678 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 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 1404.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 328.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -851.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6115.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 276.8 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214192.69 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.7 GB in the end (delta: -823.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 46). Cancelled while BasicCegarLoop was constructing difference of abstraction (31528states) and FLOYD_HOARE automaton (currently 16 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (20117 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 397 locations, 1 error locations. TIMEOUT Result, 214.1s OverallTime, 19 OverallIterations, 13 TraceHistogramMax, 108.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4839 SDtfs, 26370 SDslu, 3173 SDs, 0 SdLazy, 83150 SolverSat, 5746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14432 GetRequests, 14176 SyntacticMatches, 103 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31528occurred in iteration=18, 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: 4.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 41587 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 54.7s InterpolantComputationTime, 35575 NumberOfCodeBlocks, 35575 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 35549 ConstructedInterpolants, 534 QuantifiedInterpolants, 318796871 SizeOfPredicates, 15 NumberOfNonLiveVariables, 16201 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 116593/121406 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown