java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:16,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:16,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:16,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:16,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:16,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:16,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:16,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:16,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:16,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:16,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:16,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:16,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:16,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:16,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:16,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:16,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:16,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:16,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:16,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:16,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:16,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:16,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:16,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:16,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:16,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:16,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:16,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:16,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:16,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:16,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:16,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:16,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:16,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:16,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:16,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:16,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:16,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:16,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:16,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:16,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:16,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:00:16,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:16,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:16,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:16,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:16,646 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:16,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:16,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:16,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:16,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:16,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:16,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:16,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:16,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:16,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:16,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:16,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:16,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:16,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:16,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:16,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:16,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:16,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:16,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:16,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:16,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:16,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:16,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:16,702 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:16,702 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:16,703 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-20 13:00:16,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd27a479/f5baddab44f14994b2a478964e90b85b/FLAGb04eca951 [2019-09-20 13:00:17,248 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:17,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-20 13:00:17,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd27a479/f5baddab44f14994b2a478964e90b85b/FLAGb04eca951 [2019-09-20 13:00:17,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd27a479/f5baddab44f14994b2a478964e90b85b [2019-09-20 13:00:17,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:17,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:17,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:17,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:17,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:17,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3fac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,625 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:17,666 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:17,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:17,886 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:17,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:18,019 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:18,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18 WrapperNode [2019-09-20 13:00:18,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:18,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:18,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:18,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:18,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (1/1) ... [2019-09-20 13:00:18,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:18,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:18,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:18,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:18,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (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 [2019-09-20 13:00:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:18,504 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:18,505 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:18,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:18 BoogieIcfgContainer [2019-09-20 13:00:18,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:18,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:18,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:18,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:18,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:17" (1/3) ... [2019-09-20 13:00:18,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab8663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:18, skipping insertion in model container [2019-09-20 13:00:18,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:18" (2/3) ... [2019-09-20 13:00:18,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab8663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:18, skipping insertion in model container [2019-09-20 13:00:18,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:18" (3/3) ... [2019-09-20 13:00:18,516 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-09-20 13:00:18,525 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:18,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:18,550 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:18,582 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:18,582 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:18,583 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:18,583 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:18,583 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:18,583 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:18,583 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:18,584 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:18,584 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-09-20 13:00:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:18,608 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,609 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,612 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-09-20 13:00:18,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,865 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-09-20 13:00:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,929 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-09-20 13:00:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,943 INFO L225 Difference]: With dead ends: 111 [2019-09-20 13:00:18,943 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 13:00:18,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 13:00:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-20 13:00:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 13:00:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-09-20 13:00:18,992 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-09-20 13:00:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,993 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-09-20 13:00:18,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-09-20 13:00:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:18,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,995 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,995 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-09-20 13:00:18,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,075 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-09-20 13:00:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,140 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-09-20 13:00:19,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,145 INFO L225 Difference]: With dead ends: 157 [2019-09-20 13:00:19,148 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 13:00:19,149 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 13:00:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-20 13:00:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:00:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-09-20 13:00:19,165 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-09-20 13:00:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,166 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-09-20 13:00:19,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-09-20 13:00:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,167 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,167 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,168 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-09-20 13:00:19,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,242 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-09-20 13:00:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,286 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-09-20 13:00:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,289 INFO L225 Difference]: With dead ends: 144 [2019-09-20 13:00:19,289 INFO L226 Difference]: Without dead ends: 99 [2019-09-20 13:00:19,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-20 13:00:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-09-20 13:00:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:00:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-09-20 13:00:19,301 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-09-20 13:00:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,301 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-09-20 13:00:19,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-09-20 13:00:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,302 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,303 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,303 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-09-20 13:00:19,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,372 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-09-20 13:00:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,407 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-09-20 13:00:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,410 INFO L225 Difference]: With dead ends: 184 [2019-09-20 13:00:19,411 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:00:19,413 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:00:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-09-20 13:00:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-20 13:00:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-09-20 13:00:19,439 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-09-20 13:00:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,440 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-09-20 13:00:19,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-09-20 13:00:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,445 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,446 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-09-20 13:00:19,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,530 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-09-20 13:00:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,566 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-09-20 13:00:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,569 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:00:19,569 INFO L226 Difference]: Without dead ends: 184 [2019-09-20 13:00:19,570 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-20 13:00:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-20 13:00:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-20 13:00:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-09-20 13:00:19,596 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-09-20 13:00:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,597 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-09-20 13:00:19,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-09-20 13:00:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,600 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,600 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-09-20 13:00:19,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,667 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-09-20 13:00:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,693 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-09-20 13:00:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,698 INFO L225 Difference]: With dead ends: 273 [2019-09-20 13:00:19,698 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:00:19,699 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:00:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-20 13:00:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:00:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-09-20 13:00:19,724 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-09-20 13:00:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,724 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-09-20 13:00:19,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-09-20 13:00:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,729 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,729 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,730 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-09-20 13:00:19,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,785 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-09-20 13:00:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,829 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-09-20 13:00:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,836 INFO L225 Difference]: With dead ends: 348 [2019-09-20 13:00:19,837 INFO L226 Difference]: Without dead ends: 346 [2019-09-20 13:00:19,837 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-20 13:00:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-09-20 13:00:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:00:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-09-20 13:00:19,849 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-09-20 13:00:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,849 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-09-20 13:00:19,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-09-20 13:00:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,851 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,851 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,851 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-09-20 13:00:19,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,883 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-09-20 13:00:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,910 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-09-20 13:00:19,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,913 INFO L225 Difference]: With dead ends: 592 [2019-09-20 13:00:19,913 INFO L226 Difference]: Without dead ends: 354 [2019-09-20 13:00:19,916 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-20 13:00:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-20 13:00:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-20 13:00:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-09-20 13:00:19,938 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-09-20 13:00:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,938 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-09-20 13:00:19,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-09-20 13:00:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:19,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,940 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,941 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-09-20 13:00:19,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,997 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-09-20 13:00:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,024 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-09-20 13:00:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,027 INFO L225 Difference]: With dead ends: 528 [2019-09-20 13:00:20,027 INFO L226 Difference]: Without dead ends: 358 [2019-09-20 13:00:20,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-20 13:00:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-09-20 13:00:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-20 13:00:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-09-20 13:00:20,045 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-09-20 13:00:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,047 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-09-20 13:00:20,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-09-20 13:00:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,051 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,051 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,051 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-09-20 13:00:20,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,096 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-09-20 13:00:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,129 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-09-20 13:00:20,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,134 INFO L225 Difference]: With dead ends: 668 [2019-09-20 13:00:20,134 INFO L226 Difference]: Without dead ends: 666 [2019-09-20 13:00:20,135 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-20 13:00:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-09-20 13:00:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-20 13:00:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-09-20 13:00:20,153 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-09-20 13:00:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,154 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-09-20 13:00:20,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-09-20 13:00:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,159 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,160 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-09-20 13:00:20,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,211 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-09-20 13:00:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,252 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-09-20 13:00:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,257 INFO L225 Difference]: With dead ends: 1164 [2019-09-20 13:00:20,258 INFO L226 Difference]: Without dead ends: 690 [2019-09-20 13:00:20,260 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-20 13:00:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-09-20 13:00:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-20 13:00:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-09-20 13:00:20,287 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-09-20 13:00:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,287 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-09-20 13:00:20,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-09-20 13:00:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,289 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,289 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-09-20 13:00:20,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,325 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-09-20 13:00:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,356 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-09-20 13:00:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,361 INFO L225 Difference]: With dead ends: 1032 [2019-09-20 13:00:20,361 INFO L226 Difference]: Without dead ends: 698 [2019-09-20 13:00:20,362 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-20 13:00:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-20 13:00:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-20 13:00:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-09-20 13:00:20,382 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-09-20 13:00:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,383 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-09-20 13:00:20,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-09-20 13:00:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,384 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,384 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,384 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-09-20 13:00:20,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,415 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-09-20 13:00:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,444 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-09-20 13:00:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,452 INFO L225 Difference]: With dead ends: 1292 [2019-09-20 13:00:20,452 INFO L226 Difference]: Without dead ends: 1290 [2019-09-20 13:00:20,453 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-20 13:00:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-09-20 13:00:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-20 13:00:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-09-20 13:00:20,485 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-09-20 13:00:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,486 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-09-20 13:00:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-09-20 13:00:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,489 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,489 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-09-20 13:00:20,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,516 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-09-20 13:00:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,554 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-09-20 13:00:20,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,566 INFO L225 Difference]: With dead ends: 2300 [2019-09-20 13:00:20,567 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:00:20,570 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:00:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-20 13:00:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:00:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-09-20 13:00:20,629 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-09-20 13:00:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,629 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-09-20 13:00:20,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-09-20 13:00:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:20,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,634 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,634 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-09-20 13:00:20,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,711 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-09-20 13:00:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,752 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-09-20 13:00:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,759 INFO L225 Difference]: With dead ends: 2028 [2019-09-20 13:00:20,760 INFO L226 Difference]: Without dead ends: 1370 [2019-09-20 13:00:20,764 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-20 13:00:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-09-20 13:00:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-20 13:00:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-09-20 13:00:20,811 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-09-20 13:00:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,812 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-09-20 13:00:20,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-09-20 13:00:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:20,814 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,814 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,815 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-09-20 13:00:20,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,859 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-09-20 13:00:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,902 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-09-20 13:00:20,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,916 INFO L225 Difference]: With dead ends: 2508 [2019-09-20 13:00:20,916 INFO L226 Difference]: Without dead ends: 2506 [2019-09-20 13:00:20,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-20 13:00:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-09-20 13:00:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-20 13:00:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-09-20 13:00:20,977 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-09-20 13:00:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,978 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-09-20 13:00:20,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-09-20 13:00:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:20,981 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,981 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,982 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-09-20 13:00:20,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,005 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-09-20 13:00:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,058 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-09-20 13:00:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,071 INFO L225 Difference]: With dead ends: 4556 [2019-09-20 13:00:21,071 INFO L226 Difference]: Without dead ends: 2666 [2019-09-20 13:00:21,076 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-20 13:00:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-09-20 13:00:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-20 13:00:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-09-20 13:00:21,151 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-09-20 13:00:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,151 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-09-20 13:00:21,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-09-20 13:00:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:21,155 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,155 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,155 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-09-20 13:00:21,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,179 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:00:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,235 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-09-20 13:00:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,249 INFO L225 Difference]: With dead ends: 3996 [2019-09-20 13:00:21,249 INFO L226 Difference]: Without dead ends: 2698 [2019-09-20 13:00:21,252 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-09-20 13:00:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-09-20 13:00:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-09-20 13:00:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-09-20 13:00:21,328 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-09-20 13:00:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,329 INFO L475 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-09-20 13:00:21,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-09-20 13:00:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:21,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,333 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,334 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-09-20 13:00:21,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,357 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:00:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,455 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-09-20 13:00:21,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,477 INFO L225 Difference]: With dead ends: 4876 [2019-09-20 13:00:21,478 INFO L226 Difference]: Without dead ends: 4874 [2019-09-20 13:00:21,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-20 13:00:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-09-20 13:00:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-20 13:00:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-09-20 13:00:21,582 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-09-20 13:00:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,583 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-09-20 13:00:21,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-09-20 13:00:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:21,589 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,589 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,589 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-09-20 13:00:21,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,612 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-09-20 13:00:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,683 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-09-20 13:00:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,707 INFO L225 Difference]: With dead ends: 9036 [2019-09-20 13:00:21,707 INFO L226 Difference]: Without dead ends: 5258 [2019-09-20 13:00:21,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-20 13:00:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-09-20 13:00:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-09-20 13:00:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-09-20 13:00:21,853 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-09-20 13:00:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,853 INFO L475 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-09-20 13:00:21,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-09-20 13:00:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:21,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,860 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,861 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-09-20 13:00:21,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,883 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-09-20 13:00:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,965 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-09-20 13:00:21,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,979 INFO L225 Difference]: With dead ends: 7884 [2019-09-20 13:00:21,980 INFO L226 Difference]: Without dead ends: 5322 [2019-09-20 13:00:21,988 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-09-20 13:00:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-09-20 13:00:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-09-20 13:00:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-09-20 13:00:22,169 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-09-20 13:00:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,169 INFO L475 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-09-20 13:00:22,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-09-20 13:00:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:22,175 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,175 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,176 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-09-20 13:00:22,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,201 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-09-20 13:00:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,332 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-09-20 13:00:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,359 INFO L225 Difference]: With dead ends: 15564 [2019-09-20 13:00:22,359 INFO L226 Difference]: Without dead ends: 10378 [2019-09-20 13:00:22,373 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-20 13:00:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-09-20 13:00:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-20 13:00:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-09-20 13:00:22,646 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-09-20 13:00:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,646 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-09-20 13:00:22,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-09-20 13:00:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:22,661 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,661 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,661 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-09-20 13:00:22,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,688 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-09-20 13:00:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,880 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-09-20 13:00:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,919 INFO L225 Difference]: With dead ends: 12172 [2019-09-20 13:00:22,919 INFO L226 Difference]: Without dead ends: 12170 [2019-09-20 13:00:22,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-20 13:00:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-09-20 13:00:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-20 13:00:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-09-20 13:00:23,232 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-09-20 13:00:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,232 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-09-20 13:00:23,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-09-20 13:00:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:00:23,244 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,245 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,245 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-09-20 13:00:23,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,267 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-09-20 13:00:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,486 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-09-20 13:00:23,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:00:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,539 INFO L225 Difference]: With dead ends: 18316 [2019-09-20 13:00:23,540 INFO L226 Difference]: Without dead ends: 18314 [2019-09-20 13:00:23,554 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-09-20 13:00:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-09-20 13:00:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-09-20 13:00:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-09-20 13:00:24,126 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-09-20 13:00:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:24,127 INFO L475 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-09-20 13:00:24,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-09-20 13:00:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:00:24,151 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:24,151 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:24,152 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-09-20 13:00:24,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:24,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:24,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:24,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,175 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-09-20 13:00:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:24,450 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-09-20 13:00:24,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:24,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:00:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:24,494 INFO L225 Difference]: With dead ends: 35468 [2019-09-20 13:00:24,495 INFO L226 Difference]: Without dead ends: 20362 [2019-09-20 13:00:24,525 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-09-20 13:00:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-09-20 13:00:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-09-20 13:00:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-09-20 13:00:25,598 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-09-20 13:00:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,599 INFO L475 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-09-20 13:00:25,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-09-20 13:00:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:25,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,625 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,626 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-09-20 13:00:25,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,657 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-09-20 13:00:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,868 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-09-20 13:00:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,908 INFO L225 Difference]: With dead ends: 30732 [2019-09-20 13:00:25,908 INFO L226 Difference]: Without dead ends: 20746 [2019-09-20 13:00:25,930 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-09-20 13:00:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-09-20 13:00:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-09-20 13:00:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-09-20 13:00:26,426 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-09-20 13:00:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,427 INFO L475 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-09-20 13:00:26,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-09-20 13:00:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:26,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,451 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,452 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-09-20 13:00:26,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,477 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-09-20 13:00:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,775 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-09-20 13:00:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,847 INFO L225 Difference]: With dead ends: 35852 [2019-09-20 13:00:26,847 INFO L226 Difference]: Without dead ends: 35850 [2019-09-20 13:00:26,863 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-09-20 13:00:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-09-20 13:00:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-09-20 13:00:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-09-20 13:00:28,350 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-09-20 13:00:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,351 INFO L475 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-09-20 13:00:28,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-09-20 13:00:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:28,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,391 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-09-20 13:00:28,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,421 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-09-20 13:00:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,796 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-09-20 13:00:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,856 INFO L225 Difference]: With dead ends: 70668 [2019-09-20 13:00:28,857 INFO L226 Difference]: Without dead ends: 40458 [2019-09-20 13:00:28,920 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-09-20 13:00:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-09-20 13:00:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-09-20 13:00:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-09-20 13:00:29,795 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-09-20 13:00:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:29,795 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-09-20 13:00:29,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-09-20 13:00:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:29,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:29,833 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:29,833 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-09-20 13:00:29,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:29,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:29,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:29,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,863 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-09-20 13:00:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:30,218 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-09-20 13:00:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:30,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:30,301 INFO L225 Difference]: With dead ends: 60684 [2019-09-20 13:00:30,302 INFO L226 Difference]: Without dead ends: 40970 [2019-09-20 13:00:30,336 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-09-20 13:00:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-09-20 13:00:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-09-20 13:00:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-09-20 13:00:31,340 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-09-20 13:00:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:31,340 INFO L475 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-09-20 13:00:31,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-09-20 13:00:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:31,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:31,379 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:31,380 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-09-20 13:00:31,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:31,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:31,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:31,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:31,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:31,407 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-09-20 13:00:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:31,892 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-09-20 13:00:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:31,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:31,976 INFO L225 Difference]: With dead ends: 69644 [2019-09-20 13:00:31,976 INFO L226 Difference]: Without dead ends: 69642 [2019-09-20 13:00:32,003 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-09-20 13:00:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-09-20 13:00:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-09-20 13:00:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-09-20 13:00:33,086 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-09-20 13:00:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:33,086 INFO L475 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-09-20 13:00:33,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-09-20 13:00:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:33,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:33,121 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:33,121 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-09-20 13:00:33,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:33,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:33,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:33,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:33,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:33,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:33,142 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-09-20 13:00:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:34,982 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-09-20 13:00:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:34,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:35,044 INFO L225 Difference]: With dead ends: 140300 [2019-09-20 13:00:35,044 INFO L226 Difference]: Without dead ends: 79882 [2019-09-20 13:00:35,079 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-09-20 13:00:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-09-20 13:00:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-09-20 13:00:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-09-20 13:00:36,194 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-09-20 13:00:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:36,195 INFO L475 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-09-20 13:00:36,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-09-20 13:00:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:00:36,232 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:36,232 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:36,233 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-09-20 13:00:36,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:36,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:36,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:36,270 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-09-20 13:00:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:36,775 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-09-20 13:00:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:36,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:00:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:36,856 INFO L225 Difference]: With dead ends: 119820 [2019-09-20 13:00:36,857 INFO L226 Difference]: Without dead ends: 80906 [2019-09-20 13:00:36,895 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-09-20 13:00:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-09-20 13:00:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-09-20 13:00:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-09-20 13:00:39,618 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-09-20 13:00:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:39,618 INFO L475 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-09-20 13:00:39,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-09-20 13:00:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:00:39,647 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:39,647 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:39,647 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-09-20 13:00:39,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:39,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:39,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:39,667 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-09-20 13:00:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:40,757 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-09-20 13:00:40,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:40,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:00:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:40,896 INFO L225 Difference]: With dead ends: 135180 [2019-09-20 13:00:40,896 INFO L226 Difference]: Without dead ends: 135178 [2019-09-20 13:00:40,932 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-09-20 13:00:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-09-20 13:00:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-09-20 13:00:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-09-20 13:00:42,566 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-09-20 13:00:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:42,566 INFO L475 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-09-20 13:00:42,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-09-20 13:00:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:00:42,628 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:42,629 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:42,629 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-09-20 13:00:42,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:42,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:42,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:42,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:42,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:42,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:42,651 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-09-20 13:00:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:44,237 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-09-20 13:00:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:44,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:00:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:44,390 INFO L225 Difference]: With dead ends: 278540 [2019-09-20 13:00:44,390 INFO L226 Difference]: Without dead ends: 157706 [2019-09-20 13:00:44,464 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-09-20 13:00:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-09-20 13:00:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-09-20 13:00:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-09-20 13:00:48,839 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-09-20 13:00:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:48,839 INFO L475 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-09-20 13:00:48,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-09-20 13:00:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:00:48,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:48,906 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:48,906 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-09-20 13:00:48,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:48,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:48,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:48,924 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states.