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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:22,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:22,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:22,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:22,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:22,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:22,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:22,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:22,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:22,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:22,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:22,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:22,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:22,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:22,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:22,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:22,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:22,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:22,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:22,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:22,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:22,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:22,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:22,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:22,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:22,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:22,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:22,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:22,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:22,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:22,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:22,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:22,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:22,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:22,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:22,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:22,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:22,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:22,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:22,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:22,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:22,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:00:22,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:22,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:22,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:22,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:22,685 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:22,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:22,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:22,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:22,687 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:22,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:22,688 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:22,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:22,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:22,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:22,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:22,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:22,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:22,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:22,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:22,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:22,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:22,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:22,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:22,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:22,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:22,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:22,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:22,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:22,750 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:22,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-09-20 13:00:22,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a79a7f2/1efc2d1c3d8b4afdaef0d9318a81b35a/FLAGfa407dd6e [2019-09-20 13:00:23,325 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:23,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-09-20 13:00:23,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a79a7f2/1efc2d1c3d8b4afdaef0d9318a81b35a/FLAGfa407dd6e [2019-09-20 13:00:23,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a79a7f2/1efc2d1c3d8b4afdaef0d9318a81b35a [2019-09-20 13:00:23,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:23,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:23,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:23,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:23,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:23,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:23" (1/1) ... [2019-09-20 13:00:23,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e46397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:23, skipping insertion in model container [2019-09-20 13:00:23,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:23" (1/1) ... [2019-09-20 13:00:23,738 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:23,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:24,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:24,028 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:24,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:24,155 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:24,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24 WrapperNode [2019-09-20 13:00:24,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:24,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:24,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:24,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:24,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:24,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:24,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:24,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:24,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:24,517 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:24,518 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:24,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:24 BoogieIcfgContainer [2019-09-20 13:00:24,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:24,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:24,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:24,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:24,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:23" (1/3) ... [2019-09-20 13:00:24,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d2e72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:24, skipping insertion in model container [2019-09-20 13:00:24,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (2/3) ... [2019-09-20 13:00:24,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d2e72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:24, skipping insertion in model container [2019-09-20 13:00:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:24" (3/3) ... [2019-09-20 13:00:24,528 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-09-20 13:00:24,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:24,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:24,608 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:24,657 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:24,658 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:24,658 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:24,658 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:24,658 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:24,658 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:24,658 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:24,658 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:24,658 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-20 13:00:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:24,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:24,691 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:24,694 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:24,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-09-20 13:00:24,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:24,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:24,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:24,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:24,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,900 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-09-20 13:00:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:24,953 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-09-20 13:00:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:24,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:24,967 INFO L225 Difference]: With dead ends: 69 [2019-09-20 13:00:24,967 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:00:24,971 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:00:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-09-20 13:00:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:00:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-09-20 13:00:25,018 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-09-20 13:00:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,019 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-09-20 13:00:25,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-09-20 13:00:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:25,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,021 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,021 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-09-20 13:00:25,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,098 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-09-20 13:00:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,154 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-09-20 13:00:25,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,157 INFO L225 Difference]: With dead ends: 87 [2019-09-20 13:00:25,157 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:00:25,159 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:00:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-09-20 13:00:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:00:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-09-20 13:00:25,183 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-09-20 13:00:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-09-20 13:00:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-09-20 13:00:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:25,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,190 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,190 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-09-20 13:00:25,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,277 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-09-20 13:00:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,322 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-09-20 13:00:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,325 INFO L225 Difference]: With dead ends: 81 [2019-09-20 13:00:25,326 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:00:25,329 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:00:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-20 13:00:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 13:00:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-09-20 13:00:25,345 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-09-20 13:00:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,346 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-09-20 13:00:25,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-09-20 13:00:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:25,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,349 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,350 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-09-20 13:00:25,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,413 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-09-20 13:00:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,450 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-09-20 13:00:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,452 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:00:25,453 INFO L226 Difference]: Without dead ends: 98 [2019-09-20 13:00:25,453 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-20 13:00:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-09-20 13:00:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 13:00:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-09-20 13:00:25,475 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-09-20 13:00:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,475 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-09-20 13:00:25,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-09-20 13:00:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:25,477 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,478 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,479 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-09-20 13:00:25,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,542 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-09-20 13:00:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,578 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-09-20 13:00:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,581 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:00:25,581 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:00:25,585 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:00:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-20 13:00:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-20 13:00:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-09-20 13:00:25,606 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-09-20 13:00:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,609 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-09-20 13:00:25,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-09-20 13:00:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,611 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,611 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,611 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-09-20 13:00:25,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,669 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-09-20 13:00:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,703 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-09-20 13:00:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,705 INFO L225 Difference]: With dead ends: 147 [2019-09-20 13:00:25,706 INFO L226 Difference]: Without dead ends: 102 [2019-09-20 13:00:25,706 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-20 13:00:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-20 13:00:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:00:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-09-20 13:00:25,726 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-09-20 13:00:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,728 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-09-20 13:00:25,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-09-20 13:00:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,732 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,732 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,732 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-09-20 13:00:25,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,770 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-09-20 13:00:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,788 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-09-20 13:00:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,791 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:00:25,791 INFO L226 Difference]: Without dead ends: 178 [2019-09-20 13:00:25,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-20 13:00:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-09-20 13:00:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:00:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-09-20 13:00:25,807 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-09-20 13:00:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,807 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-09-20 13:00:25,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-09-20 13:00:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,809 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,810 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-09-20 13:00:25,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,840 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-09-20 13:00:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,871 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-09-20 13:00:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,874 INFO L225 Difference]: With dead ends: 312 [2019-09-20 13:00:25,876 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:00:25,878 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:00:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-20 13:00:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:00:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-09-20 13:00:25,900 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-09-20 13:00:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,900 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-09-20 13:00:25,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-09-20 13:00:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:25,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,902 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,903 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-09-20 13:00:25,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,952 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-09-20 13:00:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,983 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-09-20 13:00:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,985 INFO L225 Difference]: With dead ends: 276 [2019-09-20 13:00:25,985 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:00:25,986 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:00:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-09-20 13:00:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-20 13:00:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-09-20 13:00:25,997 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-09-20 13:00:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,997 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-09-20 13:00:25,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-09-20 13:00:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:25,999 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,999 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,999 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-09-20 13:00:26,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,052 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-09-20 13:00:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,086 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-09-20 13:00:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,097 INFO L225 Difference]: With dead ends: 332 [2019-09-20 13:00:26,097 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:00:26,098 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:00:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-09-20 13:00:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:00:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-09-20 13:00:26,116 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-09-20 13:00:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,116 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-09-20 13:00:26,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-09-20 13:00:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,122 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,123 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-09-20 13:00:26,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,171 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-09-20 13:00:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,211 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-09-20 13:00:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,215 INFO L225 Difference]: With dead ends: 604 [2019-09-20 13:00:26,215 INFO L226 Difference]: Without dead ends: 354 [2019-09-20 13:00:26,216 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-20 13:00:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-20 13:00:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-20 13:00:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-09-20 13:00:26,236 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-09-20 13:00:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,236 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-09-20 13:00:26,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-09-20 13:00:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,239 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,241 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-09-20 13:00:26,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,280 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-09-20 13:00:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,300 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-09-20 13:00:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,303 INFO L225 Difference]: With dead ends: 528 [2019-09-20 13:00:26,303 INFO L226 Difference]: Without dead ends: 362 [2019-09-20 13:00:26,304 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-20 13:00:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-20 13:00:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:00:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-09-20 13:00:26,317 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-09-20 13:00:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,317 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-09-20 13:00:26,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-09-20 13:00:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,319 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,319 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-09-20 13:00:26,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,342 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-09-20 13:00:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,363 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-09-20 13:00:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,367 INFO L225 Difference]: With dead ends: 620 [2019-09-20 13:00:26,367 INFO L226 Difference]: Without dead ends: 618 [2019-09-20 13:00:26,368 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-20 13:00:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-09-20 13:00:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-20 13:00:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-09-20 13:00:26,386 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-09-20 13:00:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,386 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-09-20 13:00:26,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-09-20 13:00:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,388 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,388 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,388 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-09-20 13:00:26,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,408 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-09-20 13:00:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,439 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-09-20 13:00:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,444 INFO L225 Difference]: With dead ends: 1180 [2019-09-20 13:00:26,444 INFO L226 Difference]: Without dead ends: 682 [2019-09-20 13:00:26,447 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-20 13:00:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-09-20 13:00:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-20 13:00:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-09-20 13:00:26,470 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-09-20 13:00:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,470 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-09-20 13:00:26,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-09-20 13:00:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,472 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,472 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-09-20 13:00:26,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,503 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-09-20 13:00:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,528 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-09-20 13:00:26,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,533 INFO L225 Difference]: With dead ends: 1020 [2019-09-20 13:00:26,533 INFO L226 Difference]: Without dead ends: 698 [2019-09-20 13:00:26,535 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-20 13:00:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-20 13:00:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-20 13:00:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-09-20 13:00:26,559 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-09-20 13:00:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,559 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-09-20 13:00:26,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-09-20 13:00:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,561 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,561 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,561 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-09-20 13:00:26,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,589 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-09-20 13:00:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,618 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-09-20 13:00:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,624 INFO L225 Difference]: With dead ends: 1164 [2019-09-20 13:00:26,624 INFO L226 Difference]: Without dead ends: 1162 [2019-09-20 13:00:26,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-20 13:00:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-09-20 13:00:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-09-20 13:00:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-09-20 13:00:26,662 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-09-20 13:00:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,663 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-09-20 13:00:26,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-09-20 13:00:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,666 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,666 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-09-20 13:00:26,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,693 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-09-20 13:00:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,737 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-09-20 13:00:26,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,744 INFO L225 Difference]: With dead ends: 2316 [2019-09-20 13:00:26,745 INFO L226 Difference]: Without dead ends: 1322 [2019-09-20 13:00:26,748 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-20 13:00:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-09-20 13:00:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-09-20 13:00:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-09-20 13:00:26,808 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-09-20 13:00:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,808 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-09-20 13:00:26,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-09-20 13:00:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:26,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,811 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,811 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-09-20 13:00:26,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,837 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-09-20 13:00:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,883 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-09-20 13:00:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,893 INFO L225 Difference]: With dead ends: 1980 [2019-09-20 13:00:26,893 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:00:26,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:00:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-20 13:00:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:00:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-09-20 13:00:26,953 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-09-20 13:00:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,954 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-09-20 13:00:26,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-09-20 13:00:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:26,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,959 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,959 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-09-20 13:00:26,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,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-20 13:00:26,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,993 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-09-20 13:00:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,058 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-09-20 13:00:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,071 INFO L225 Difference]: With dead ends: 2186 [2019-09-20 13:00:27,071 INFO L226 Difference]: Without dead ends: 2184 [2019-09-20 13:00:27,073 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-20 13:00:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-09-20 13:00:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-20 13:00:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-09-20 13:00:27,162 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-09-20 13:00:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,162 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-09-20 13:00:27,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-09-20 13:00:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,166 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,167 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,167 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-09-20 13:00:27,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,194 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:00:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,270 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-09-20 13:00:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,271 INFO L225 Difference]: With dead ends: 4552 [2019-09-20 13:00:27,271 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:27,278 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:27,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-20 13:00:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,280 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:27,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:27,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:27,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:27,308 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:27,308 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:27,308 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:27,308 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:27,308 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:27,308 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:27,309 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-09-20 13:00:27,309 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-20 13:00:27,309 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,309 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-09-20 13:00:27,309 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-09-20 13:00:27,309 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,310 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-09-20 13:00:27,310 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,311 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-20 13:00:27,311 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,311 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,311 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-09-20 13:00:27,311 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,313 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-09-20 13:00:27,314 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-09-20 13:00:27,314 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,314 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-09-20 13:00:27,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:27 BoogieIcfgContainer [2019-09-20 13:00:27,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:27,332 INFO L168 Benchmark]: Toolchain (without parser) took 3607.79 ms. Allocated memory was 134.7 MB in the beginning and 256.4 MB in the end (delta: 121.6 MB). Free memory was 90.9 MB in the beginning and 124.8 MB in the end (delta: -33.9 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,340 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.82 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 90.7 MB in the beginning and 175.4 MB in the end (delta: -84.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,341 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 173.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,342 INFO L168 Benchmark]: RCFGBuilder took 325.72 ms. Allocated memory is still 198.7 MB. Free memory was 173.2 MB in the beginning and 157.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,343 INFO L168 Benchmark]: TraceAbstraction took 2806.01 ms. Allocated memory was 198.7 MB in the beginning and 256.4 MB in the end (delta: 57.7 MB). Free memory was 156.5 MB in the beginning and 124.8 MB in the end (delta: 31.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:27,354 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.26 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.82 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 90.7 MB in the beginning and 175.4 MB in the end (delta: -84.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 173.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.72 ms. Allocated memory is still 198.7 MB. Free memory was 173.2 MB in the beginning and 157.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2806.01 ms. Allocated memory was 198.7 MB in the beginning and 256.4 MB in the end (delta: 57.7 MB). Free memory was 156.5 MB in the beginning and 124.8 MB in the end (delta: 31.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 35 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 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.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...