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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:04:34,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:04:34,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:04:34,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:04:34,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:04:34,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:04:34,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:04:34,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:04:34,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:04:34,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:04:34,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:04:34,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:04:34,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:04:34,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:04:34,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:04:34,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:04:34,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:04:34,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:04:34,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:04:34,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:04:34,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:04:34,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:04:34,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:04:34,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:04:34,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:04:34,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:04:34,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:04:34,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:04:34,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:04:34,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:04:34,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:04:34,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:04:34,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:04:34,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:04:34,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:04:34,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:04:34,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:04:34,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:04:34,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:04:34,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:04:34,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:04:34,618 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-07 13:04:34,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:04:34,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:04:34,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:04:34,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:04:34,634 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:04:34,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:04:34,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:04:34,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:04:34,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:04:34,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:04:34,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:04:34,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:04:34,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:04:34,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:04:34,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:04:34,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:04:34,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:04:34,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:04:34,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:04:34,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:04:34,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:04:34,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:04:34,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:04:34,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:04:34,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:04:34,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:04:34,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:04:34,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:04:34,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:04:34,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-09-07 13:04:34,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34da851b/5c058ba196994f4a850ffe0861bde4b3/FLAG7bb18cfda [2019-09-07 13:04:35,187 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:04:35,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-09-07 13:04:35,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34da851b/5c058ba196994f4a850ffe0861bde4b3/FLAG7bb18cfda [2019-09-07 13:04:35,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34da851b/5c058ba196994f4a850ffe0861bde4b3 [2019-09-07 13:04:35,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:04:35,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:04:35,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:35,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:04:35,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:04:35,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:35,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ec451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35, skipping insertion in model container [2019-09-07 13:04:35,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:35,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:04:35,558 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:04:35,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:35,826 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:04:35,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:35,891 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:04:35,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35 WrapperNode [2019-09-07 13:04:35,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:35,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:04:35,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:04:35,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:04:35,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:35,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (1/1) ... [2019-09-07 13:04:36,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:04:36,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:04:36,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:04:36,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:04:36,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (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-07 13:04:36,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:04:36,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:04:36,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:04:36,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:04:36,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:04:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:04:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:04:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:04:36,431 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:04:36,432 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:04:36,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:36 BoogieIcfgContainer [2019-09-07 13:04:36,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:04:36,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:04:36,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:04:36,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:04:36,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:04:35" (1/3) ... [2019-09-07 13:04:36,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbf31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:36, skipping insertion in model container [2019-09-07 13:04:36,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:35" (2/3) ... [2019-09-07 13:04:36,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbf31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:36, skipping insertion in model container [2019-09-07 13:04:36,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:36" (3/3) ... [2019-09-07 13:04:36,456 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-09-07 13:04:36,471 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:04:36,486 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:04:36,507 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:04:36,535 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:04:36,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:04:36,536 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:04:36,537 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:04:36,537 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:04:36,538 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:04:36,538 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:04:36,538 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:04:36,538 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:04:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-07 13:04:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:04:36,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:36,570 INFO L399 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] [2019-09-07 13:04:36,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-09-07 13:04:36,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:36,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:36,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:36,799 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-07 13:04:36,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:36,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:36,818 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-07 13:04:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:36,876 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-09-07 13:04:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:36,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:04:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:36,889 INFO L225 Difference]: With dead ends: 105 [2019-09-07 13:04:36,889 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 13:04:36,892 INFO L628 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-07 13:04:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 13:04:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-09-07 13:04:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 13:04:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-09-07 13:04:36,937 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-09-07 13:04:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:36,938 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-09-07 13:04:36,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-09-07 13:04:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:04:36,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:36,940 INFO L399 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] [2019-09-07 13:04:36,940 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-09-07 13:04:36,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:36,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,020 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-07 13:04:37,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,024 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-09-07 13:04:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,063 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-09-07 13:04:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:04:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,066 INFO L225 Difference]: With dead ends: 147 [2019-09-07 13:04:37,066 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 13:04:37,067 INFO L628 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-07 13:04:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 13:04:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-07 13:04:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 13:04:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-09-07 13:04:37,083 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-09-07 13:04:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,084 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-09-07 13:04:37,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-09-07 13:04:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:04:37,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,086 INFO L399 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-07 13:04:37,086 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-09-07 13:04:37,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,166 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-07 13:04:37,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,168 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-09-07 13:04:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,207 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-09-07 13:04:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:04:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,211 INFO L225 Difference]: With dead ends: 135 [2019-09-07 13:04:37,211 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 13:04:37,212 INFO L628 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-07 13:04:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 13:04:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-07 13:04:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 13:04:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-09-07 13:04:37,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-09-07 13:04:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,235 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-09-07 13:04:37,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-09-07 13:04:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:04:37,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,237 INFO L399 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-07 13:04:37,240 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-09-07 13:04:37,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,313 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-07 13:04:37,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,314 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-09-07 13:04:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,338 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-09-07 13:04:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:04:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,340 INFO L225 Difference]: With dead ends: 172 [2019-09-07 13:04:37,341 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 13:04:37,341 INFO L628 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-07 13:04:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 13:04:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-09-07 13:04:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 13:04:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-09-07 13:04:37,354 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-09-07 13:04:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,354 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-09-07 13:04:37,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-09-07 13:04:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:04:37,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,356 INFO L399 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-07 13:04:37,357 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-09-07 13:04:37,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,393 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-07 13:04:37,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,395 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-09-07 13:04:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,415 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-09-07 13:04:37,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:04:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,417 INFO L225 Difference]: With dead ends: 284 [2019-09-07 13:04:37,418 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 13:04:37,419 INFO L628 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-07 13:04:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 13:04:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-07 13:04:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 13:04:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-09-07 13:04:37,436 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-09-07 13:04:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,437 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-09-07 13:04:37,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-09-07 13:04:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:37,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,441 INFO L399 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-07 13:04:37,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-09-07 13:04:37,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,492 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-07 13:04:37,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,494 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-09-07 13:04:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,522 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-09-07 13:04:37,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,524 INFO L225 Difference]: With dead ends: 255 [2019-09-07 13:04:37,524 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 13:04:37,526 INFO L628 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-07 13:04:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 13:04:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-07 13:04:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-07 13:04:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-09-07 13:04:37,548 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-09-07 13:04:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,548 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-09-07 13:04:37,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-09-07 13:04:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:37,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,550 INFO L399 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-07 13:04:37,550 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-09-07 13:04:37,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,586 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-07 13:04:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,588 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-09-07 13:04:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,629 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-09-07 13:04:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,637 INFO L225 Difference]: With dead ends: 324 [2019-09-07 13:04:37,637 INFO L226 Difference]: Without dead ends: 322 [2019-09-07 13:04:37,638 INFO L628 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-07 13:04:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-07 13:04:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-09-07 13:04:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 13:04:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-09-07 13:04:37,657 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-09-07 13:04:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,657 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-09-07 13:04:37,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-09-07 13:04:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:37,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,663 INFO L399 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-07 13:04:37,663 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-09-07 13:04:37,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,696 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-07 13:04:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,697 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-09-07 13:04:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,723 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-09-07 13:04:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,726 INFO L225 Difference]: With dead ends: 552 [2019-09-07 13:04:37,726 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 13:04:37,728 INFO L628 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-07 13:04:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 13:04:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-07 13:04:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-07 13:04:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-09-07 13:04:37,739 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-09-07 13:04:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,740 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-09-07 13:04:37,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-09-07 13:04:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:37,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,741 INFO L399 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-07 13:04:37,742 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-09-07 13:04:37,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,764 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-07 13:04:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,766 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-09-07 13:04:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,784 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-09-07 13:04:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,787 INFO L225 Difference]: With dead ends: 492 [2019-09-07 13:04:37,787 INFO L226 Difference]: Without dead ends: 334 [2019-09-07 13:04:37,788 INFO L628 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-07 13:04:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-07 13:04:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-07 13:04:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-07 13:04:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-09-07 13:04:37,798 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-09-07 13:04:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,799 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-09-07 13:04:37,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-09-07 13:04:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:37,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,800 INFO L399 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-07 13:04:37,800 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-09-07 13:04:37,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,823 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-07 13:04:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,824 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-09-07 13:04:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,846 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-09-07 13:04:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,850 INFO L225 Difference]: With dead ends: 620 [2019-09-07 13:04:37,850 INFO L226 Difference]: Without dead ends: 618 [2019-09-07 13:04:37,851 INFO L628 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-07 13:04:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-07 13:04:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-09-07 13:04:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-07 13:04:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-09-07 13:04:37,867 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-09-07 13:04:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,867 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-09-07 13:04:37,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-09-07 13:04:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:37,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,868 INFO L399 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-07 13:04:37,869 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-09-07 13:04:37,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,898 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-07 13:04:37,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,899 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-09-07 13:04:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:37,932 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-09-07 13:04:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:37,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:37,936 INFO L225 Difference]: With dead ends: 1084 [2019-09-07 13:04:37,937 INFO L226 Difference]: Without dead ends: 642 [2019-09-07 13:04:37,938 INFO L628 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-07 13:04:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-07 13:04:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-09-07 13:04:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-07 13:04:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-09-07 13:04:37,963 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-09-07 13:04:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:37,963 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-09-07 13:04:37,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-09-07 13:04:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:37,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,965 INFO L399 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-07 13:04:37,965 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-09-07 13:04:37,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:37,993 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-07 13:04:37,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:37,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:37,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:37,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:37,995 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-09-07 13:04:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,015 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-09-07 13:04:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,020 INFO L225 Difference]: With dead ends: 960 [2019-09-07 13:04:38,020 INFO L226 Difference]: Without dead ends: 650 [2019-09-07 13:04:38,021 INFO L628 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-07 13:04:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-07 13:04:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-07 13:04:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-07 13:04:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-09-07 13:04:38,040 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-09-07 13:04:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,040 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-09-07 13:04:38,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-09-07 13:04:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:38,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,042 INFO L399 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-07 13:04:38,042 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-09-07 13:04:38,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,069 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-07 13:04:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,071 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-09-07 13:04:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,097 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-09-07 13:04:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,103 INFO L225 Difference]: With dead ends: 1196 [2019-09-07 13:04:38,104 INFO L226 Difference]: Without dead ends: 1194 [2019-09-07 13:04:38,104 INFO L628 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-07 13:04:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-07 13:04:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-09-07 13:04:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-07 13:04:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-09-07 13:04:38,131 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-09-07 13:04:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,132 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-09-07 13:04:38,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-09-07 13:04:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:38,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,134 INFO L399 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-07 13:04:38,135 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-09-07 13:04:38,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,160 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-07 13:04:38,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,161 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-09-07 13:04:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,196 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-09-07 13:04:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,204 INFO L225 Difference]: With dead ends: 2140 [2019-09-07 13:04:38,205 INFO L226 Difference]: Without dead ends: 1258 [2019-09-07 13:04:38,210 INFO L628 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-07 13:04:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-07 13:04:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-07 13:04:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-07 13:04:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-09-07 13:04:38,250 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-09-07 13:04:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,251 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-09-07 13:04:38,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-09-07 13:04:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:38,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,253 INFO L399 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-07 13:04:38,254 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-09-07 13:04:38,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,298 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-07 13:04:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,300 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-09-07 13:04:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,365 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-09-07 13:04:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,375 INFO L225 Difference]: With dead ends: 1884 [2019-09-07 13:04:38,375 INFO L226 Difference]: Without dead ends: 1274 [2019-09-07 13:04:38,379 INFO L628 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-07 13:04:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-07 13:04:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-07 13:04:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-07 13:04:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-09-07 13:04:38,425 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-09-07 13:04:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,426 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-09-07 13:04:38,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-09-07 13:04:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:38,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,430 INFO L399 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-07 13:04:38,431 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-09-07 13:04:38,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,474 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-07 13:04:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,477 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-09-07 13:04:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,528 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-09-07 13:04:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,540 INFO L225 Difference]: With dead ends: 2316 [2019-09-07 13:04:38,541 INFO L226 Difference]: Without dead ends: 2314 [2019-09-07 13:04:38,541 INFO L628 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-07 13:04:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-07 13:04:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-09-07 13:04:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-07 13:04:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-09-07 13:04:38,601 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-09-07 13:04:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,601 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-09-07 13:04:38,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-09-07 13:04:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:38,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,604 INFO L399 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-07 13:04:38,604 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-09-07 13:04:38,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,631 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-07 13:04:38,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,632 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-09-07 13:04:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,680 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-09-07 13:04:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,692 INFO L225 Difference]: With dead ends: 4236 [2019-09-07 13:04:38,692 INFO L226 Difference]: Without dead ends: 2474 [2019-09-07 13:04:38,695 INFO L628 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-07 13:04:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-07 13:04:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-07 13:04:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-07 13:04:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-09-07 13:04:38,761 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-09-07 13:04:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,762 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-09-07 13:04:38,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-09-07 13:04:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:38,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,765 INFO L399 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-07 13:04:38,765 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-09-07 13:04:38,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,795 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-07 13:04:38,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,797 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-09-07 13:04:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,868 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-09-07 13:04:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,882 INFO L225 Difference]: With dead ends: 3708 [2019-09-07 13:04:38,883 INFO L226 Difference]: Without dead ends: 2506 [2019-09-07 13:04:38,885 INFO L628 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-07 13:04:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-07 13:04:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-09-07 13:04:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-07 13:04:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-09-07 13:04:38,959 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-09-07 13:04:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,959 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-09-07 13:04:38,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-09-07 13:04:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:38,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,965 INFO L399 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-07 13:04:38,965 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-09-07 13:04:38,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,992 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-07 13:04:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,994 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-09-07 13:04:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,081 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-09-07 13:04:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,101 INFO L225 Difference]: With dead ends: 4492 [2019-09-07 13:04:39,102 INFO L226 Difference]: Without dead ends: 4490 [2019-09-07 13:04:39,103 INFO L628 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-07 13:04:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-07 13:04:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-09-07 13:04:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-09-07 13:04:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-09-07 13:04:39,216 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-09-07 13:04:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,217 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-09-07 13:04:39,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-09-07 13:04:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:39,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,226 INFO L399 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-07 13:04:39,226 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-09-07 13:04:39,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,248 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-07 13:04:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,249 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-09-07 13:04:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,366 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-09-07 13:04:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,394 INFO L225 Difference]: With dead ends: 8396 [2019-09-07 13:04:39,394 INFO L226 Difference]: Without dead ends: 4874 [2019-09-07 13:04:39,401 INFO L628 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-07 13:04:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-07 13:04:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-09-07 13:04:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-09-07 13:04:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-09-07 13:04:39,542 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-09-07 13:04:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,542 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-09-07 13:04:39,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-09-07 13:04:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:39,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,548 INFO L399 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-07 13:04:39,548 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-09-07 13:04:39,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,565 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-07 13:04:39,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,567 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-09-07 13:04:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,673 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-09-07 13:04:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,685 INFO L225 Difference]: With dead ends: 7308 [2019-09-07 13:04:39,686 INFO L226 Difference]: Without dead ends: 4938 [2019-09-07 13:04:39,690 INFO L628 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-07 13:04:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-09-07 13:04:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-09-07 13:04:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-09-07 13:04:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-09-07 13:04:39,803 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-09-07 13:04:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,803 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-09-07 13:04:39,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-09-07 13:04:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:39,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,810 INFO L399 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-07 13:04:39,810 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-09-07 13:04:39,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,828 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-07 13:04:39,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,830 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-09-07 13:04:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,942 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-09-07 13:04:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,964 INFO L225 Difference]: With dead ends: 14412 [2019-09-07 13:04:39,964 INFO L226 Difference]: Without dead ends: 9610 [2019-09-07 13:04:39,974 INFO L628 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-07 13:04:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-09-07 13:04:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-09-07 13:04:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-07 13:04:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-09-07 13:04:40,264 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-09-07 13:04:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,264 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-09-07 13:04:40,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-09-07 13:04:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:40,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,275 INFO L399 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-07 13:04:40,275 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-09-07 13:04:40,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,292 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-07 13:04:40,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,294 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-09-07 13:04:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,414 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-09-07 13:04:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,440 INFO L225 Difference]: With dead ends: 11148 [2019-09-07 13:04:40,441 INFO L226 Difference]: Without dead ends: 11146 [2019-09-07 13:04:40,445 INFO L628 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-07 13:04:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-09-07 13:04:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-09-07 13:04:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-07 13:04:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-09-07 13:04:40,666 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-09-07 13:04:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,667 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-09-07 13:04:40,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-09-07 13:04:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:04:40,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,678 INFO L399 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-07 13:04:40,678 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-09-07 13:04:40,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,697 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-07 13:04:40,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,699 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-09-07 13:04:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,968 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-09-07 13:04:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:04:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:41,003 INFO L225 Difference]: With dead ends: 16780 [2019-09-07 13:04:41,003 INFO L226 Difference]: Without dead ends: 16778 [2019-09-07 13:04:41,007 INFO L628 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-07 13:04:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-09-07 13:04:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-09-07 13:04:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-07 13:04:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-09-07 13:04:41,310 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-09-07 13:04:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:41,310 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-09-07 13:04:41,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-09-07 13:04:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:04:41,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:41,331 INFO L399 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-07 13:04:41,332 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-09-07 13:04:41,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:41,348 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-07 13:04:41,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:41,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:41,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:41,350 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-09-07 13:04:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:41,696 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-09-07 13:04:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:41,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:04:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:41,735 INFO L225 Difference]: With dead ends: 32908 [2019-09-07 13:04:41,735 INFO L226 Difference]: Without dead ends: 18826 [2019-09-07 13:04:41,763 INFO L628 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-07 13:04:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-09-07 13:04:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-09-07 13:04:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-09-07 13:04:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-09-07 13:04:42,194 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-09-07 13:04:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:42,195 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-09-07 13:04:42,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-09-07 13:04:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 13:04:42,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:42,735 INFO L399 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-07 13:04:42,735 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-09-07 13:04:42,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:42,755 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-07 13:04:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:42,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:42,757 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-09-07 13:04:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:42,954 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-09-07 13:04:42,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:42,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 13:04:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:42,990 INFO L225 Difference]: With dead ends: 28428 [2019-09-07 13:04:42,991 INFO L226 Difference]: Without dead ends: 19210 [2019-09-07 13:04:43,010 INFO L628 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-07 13:04:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-09-07 13:04:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-09-07 13:04:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-09-07 13:04:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-09-07 13:04:43,498 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-09-07 13:04:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:43,498 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-09-07 13:04:43,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-09-07 13:04:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 13:04:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:43,519 INFO L399 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-07 13:04:43,520 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-09-07 13:04:43,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:43,536 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-07 13:04:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:43,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:43,537 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-09-07 13:04:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:43,934 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-09-07 13:04:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:43,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 13:04:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:43,992 INFO L225 Difference]: With dead ends: 32780 [2019-09-07 13:04:43,992 INFO L226 Difference]: Without dead ends: 32778 [2019-09-07 13:04:43,999 INFO L628 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-07 13:04:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-09-07 13:04:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-09-07 13:04:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-09-07 13:04:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-09-07 13:04:44,670 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-09-07 13:04:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:44,670 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-09-07 13:04:44,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-09-07 13:04:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 13:04:44,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:44,709 INFO L399 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-07 13:04:44,709 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-09-07 13:04:44,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:44,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:44,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:44,727 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-07 13:04:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:44,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:44,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:44,728 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-09-07 13:04:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:45,102 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-09-07 13:04:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:45,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 13:04:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:45,170 INFO L225 Difference]: With dead ends: 65548 [2019-09-07 13:04:45,171 INFO L226 Difference]: Without dead ends: 37386 [2019-09-07 13:04:45,222 INFO L628 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-07 13:04:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-09-07 13:04:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-09-07 13:04:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-09-07 13:04:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-09-07 13:04:46,719 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-09-07 13:04:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:46,720 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-09-07 13:04:46,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-09-07 13:04:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:46,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:46,752 INFO L399 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-07 13:04:46,752 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-09-07 13:04:46,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:46,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:46,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:46,769 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-07 13:04:46,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:46,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:46,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:46,770 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-09-07 13:04:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:47,101 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-09-07 13:04:47,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:47,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:47,176 INFO L225 Difference]: With dead ends: 56076 [2019-09-07 13:04:47,176 INFO L226 Difference]: Without dead ends: 37898 [2019-09-07 13:04:47,207 INFO L628 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-07 13:04:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-09-07 13:04:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-09-07 13:04:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-09-07 13:04:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-09-07 13:04:47,989 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-09-07 13:04:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:47,989 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-09-07 13:04:47,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-09-07 13:04:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:48,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:48,030 INFO L399 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-07 13:04:48,031 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-09-07 13:04:48,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:48,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:48,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:48,053 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-07 13:04:48,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:48,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:48,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:48,059 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-09-07 13:04:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:48,572 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-09-07 13:04:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:48,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:48,679 INFO L225 Difference]: With dead ends: 63500 [2019-09-07 13:04:48,679 INFO L226 Difference]: Without dead ends: 63498 [2019-09-07 13:04:48,705 INFO L628 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-07 13:04:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-09-07 13:04:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-09-07 13:04:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-09-07 13:04:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-09-07 13:04:50,164 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-09-07 13:04:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:50,164 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-09-07 13:04:50,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-09-07 13:04:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:50,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:50,209 INFO L399 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-07 13:04:50,209 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-09-07 13:04:50,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:50,229 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-07 13:04:50,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:50,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:50,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:50,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:50,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:50,230 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-09-07 13:04:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:51,156 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-09-07 13:04:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:51,253 INFO L225 Difference]: With dead ends: 130060 [2019-09-07 13:04:51,254 INFO L226 Difference]: Without dead ends: 73738 [2019-09-07 13:04:51,327 INFO L628 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-07 13:04:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-09-07 13:04:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-09-07 13:04:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-09-07 13:04:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-09-07 13:04:54,025 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-09-07 13:04:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:54,025 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-09-07 13:04:54,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-09-07 13:04:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:54,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:54,067 INFO L399 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-07 13:04:54,068 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-09-07 13:04:54,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:54,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:54,091 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-07 13:04:54,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:54,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:54,092 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-09-07 13:04:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:54,753 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-09-07 13:04:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:54,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:04:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:54,825 INFO L225 Difference]: With dead ends: 110604 [2019-09-07 13:04:54,825 INFO L226 Difference]: Without dead ends: 74762 [2019-09-07 13:04:54,868 INFO L628 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-07 13:04:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-09-07 13:04:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-09-07 13:04:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-09-07 13:04:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-09-07 13:04:55,942 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-09-07 13:04:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:55,942 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-09-07 13:04:55,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-09-07 13:04:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:55,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:55,975 INFO L399 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-07 13:04:55,975 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-09-07 13:04:55,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:55,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:55,991 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-07 13:04:55,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:55,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:55,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:55,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:55,993 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-09-07 13:04:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:57,076 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-09-07 13:04:57,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:57,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:04:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:57,201 INFO L225 Difference]: With dead ends: 122892 [2019-09-07 13:04:57,201 INFO L226 Difference]: Without dead ends: 122890 [2019-09-07 13:04:57,222 INFO L628 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-07 13:04:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-09-07 13:04:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-09-07 13:04:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-09-07 13:04:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-09-07 13:04:59,860 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-09-07 13:04:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:59,860 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-09-07 13:04:59,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-09-07 13:04:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:59,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:59,904 INFO L399 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-07 13:04:59,904 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-09-07 13:04:59,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:59,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:59,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:59,920 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-07 13:04:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:59,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:59,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:59,921 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-09-07 13:05:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:01,398 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-09-07 13:05:01,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:01,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:05:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:01,495 INFO L225 Difference]: With dead ends: 258060 [2019-09-07 13:05:01,496 INFO L226 Difference]: Without dead ends: 145418 [2019-09-07 13:05:01,553 INFO L628 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-07 13:05:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-09-07 13:05:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-09-07 13:05:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-09-07 13:05:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-09-07 13:05:05,724 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-09-07 13:05:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:05,725 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-09-07 13:05:05,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-09-07 13:05:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:05:05,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:05,771 INFO L399 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-07 13:05:05,771 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-09-07 13:05:05,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:05,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:05,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:05,795 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-07 13:05:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:05,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:05,797 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-09-07 13:05:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:06,633 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2019-09-07 13:05:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:05:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:06,751 INFO L225 Difference]: With dead ends: 218124 [2019-09-07 13:05:06,751 INFO L226 Difference]: Without dead ends: 147466 [2019-09-07 13:05:06,809 INFO L628 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-07 13:05:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-09-07 13:05:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-09-07 13:05:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-09-07 13:05:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-09-07 13:05:08,748 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-09-07 13:05:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:08,748 INFO L475 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-09-07 13:05:08,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-09-07 13:05:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:05:08,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:08,794 INFO L399 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-07 13:05:08,794 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:08,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-09-07 13:05:08,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:08,818 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-07 13:05:08,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:08,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:08,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:08,819 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-09-07 13:05:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,779 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2019-09-07 13:05:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:05:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,972 INFO L225 Difference]: With dead ends: 237578 [2019-09-07 13:05:10,972 INFO L226 Difference]: Without dead ends: 237576 [2019-09-07 13:05:11,000 INFO L628 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-07 13:05:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-09-07 13:05:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-09-07 13:05:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-09-07 13:05:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-09-07 13:05:16,452 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-09-07 13:05:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:16,452 INFO L475 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-09-07 13:05:16,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-09-07 13:05:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:05:16,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:16,566 INFO L399 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-07 13:05:16,567 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-09-07 13:05:16,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:16,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:16,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:16,585 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-07 13:05:16,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:16,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:16,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:16,586 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-09-07 13:05:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:18,476 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2019-09-07 13:05:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:18,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:05:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:18,477 INFO L225 Difference]: With dead ends: 512008 [2019-09-07 13:05:18,478 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:05:23,020 INFO L628 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-07 13:05:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:05:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:05:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:05:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:05:23,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-09-07 13:05:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:23,021 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:05:23,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:05:23,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:05:23,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:05:23,067 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:05:23,068 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:23,068 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:23,068 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:05:23,068 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:05:23,068 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:05:23,068 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2019-09-07 13:05:23,068 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2019-09-07 13:05:23,069 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 13:05:23,070 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,071 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,072 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,073 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-09-07 13:05:23,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:05:23 BoogieIcfgContainer [2019-09-07 13:05:23,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:05:23,086 INFO L168 Benchmark]: Toolchain (without parser) took 47585.57 ms. Allocated memory was 142.1 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 88.9 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 602.0 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,087 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.99 ms. Allocated memory is still 142.1 MB. Free memory was 88.4 MB in the beginning and 77.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,088 INFO L168 Benchmark]: Boogie Preprocessor took 148.49 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 77.5 MB in the beginning and 179.0 MB in the end (delta: -101.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,089 INFO L168 Benchmark]: RCFGBuilder took 399.60 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 157.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,090 INFO L168 Benchmark]: TraceAbstraction took 46641.85 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 157.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 610.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:23,093 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.99 ms. Allocated memory is still 142.1 MB. Free memory was 88.4 MB in the beginning and 77.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.49 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 77.5 MB in the beginning and 179.0 MB in the end (delta: -101.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.60 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 157.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46641.85 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 157.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 610.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 46.5s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 24.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...