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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:15,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:15,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:15,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:15,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:15,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:15,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:15,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:15,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:15,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:15,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:15,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:15,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:15,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:15,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:15,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:15,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:15,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:15,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:15,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:15,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:15,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:15,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:15,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:15,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:15,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:15,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:15,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:15,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:15,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:15,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:15,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:15,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:15,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:15,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:15,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:15,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:15,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:15,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:15,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:15,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:15,570 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:15,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:15,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:15,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:15,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:15,596 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:15,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:15,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:15,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:15,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:15,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:15,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:15,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:15,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:15,599 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:15,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:15,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:15,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:15,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:15,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:15,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:15,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:15,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:15,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:15,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:15,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:15,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:15,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:15,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:15,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:15,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:15,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:15,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:15,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:15,682 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:15,683 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-09-20 13:00:15,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39f97d/08b055692597475a8d880a8a9aaf0374/FLAG5bda61ae7 [2019-09-20 13:00:16,228 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:16,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-09-20 13:00:16,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39f97d/08b055692597475a8d880a8a9aaf0374/FLAG5bda61ae7 [2019-09-20 13:00:16,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39f97d/08b055692597475a8d880a8a9aaf0374 [2019-09-20 13:00:16,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:16,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:16,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:16,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:16,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:16,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:16" (1/1) ... [2019-09-20 13:00:16,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16604776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:16, skipping insertion in model container [2019-09-20 13:00:16,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:16" (1/1) ... [2019-09-20 13:00:16,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:16,642 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:16,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:16,835 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:16,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:16,978 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:16,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:16 WrapperNode [2019-09-20 13:00:16,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:16,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:16,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:16,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:16,993 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:16" (1/1) ... [2019-09-20 13:00:16,994 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:16" (1/1) ... [2019-09-20 13:00:17,000 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:16" (1/1) ... [2019-09-20 13:00:17,000 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:16" (1/1) ... [2019-09-20 13:00:17,006 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:16" (1/1) ... [2019-09-20 13:00:17,014 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:16" (1/1) ... [2019-09-20 13:00:17,015 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:16" (1/1) ... [2019-09-20 13:00:17,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:17,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:17,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:17,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:17,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:16" (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:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:17,422 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:17,423 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:17,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:17 BoogieIcfgContainer [2019-09-20 13:00:17,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:17,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:17,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:17,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:17,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:16" (1/3) ... [2019-09-20 13:00:17,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fea79b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:16" (2/3) ... [2019-09-20 13:00:17,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fea79b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:17" (3/3) ... [2019-09-20 13:00:17,450 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-09-20 13:00:17,465 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:17,473 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:17,487 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:17,518 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:17,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:17,519 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:17,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:17,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:17,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:17,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:17,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:17,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-20 13:00:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:17,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,547 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:17,549 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,554 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-09-20 13:00:17,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,733 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:17,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:17,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:17,756 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-09-20 13:00:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,832 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-09-20 13:00:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:17,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,849 INFO L225 Difference]: With dead ends: 87 [2019-09-20 13:00:17,850 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 13:00:17,854 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:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 13:00:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-09-20 13:00:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 13:00:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-09-20 13:00:17,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-09-20 13:00:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,937 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-09-20 13:00:17,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-09-20 13:00:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:17,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,941 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:17,942 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-09-20 13:00:17,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,095 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-09-20 13:00:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,148 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-09-20 13:00:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,153 INFO L225 Difference]: With dead ends: 117 [2019-09-20 13:00:18,153 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 13:00:18,154 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 13:00:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-20 13:00:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:00:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-09-20 13:00:18,178 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-09-20 13:00:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,179 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-09-20 13:00:18,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-09-20 13:00:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:18,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,181 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:18,181 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-09-20 13:00:18,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,284 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-09-20 13:00:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,323 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-09-20 13:00:18,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,327 INFO L225 Difference]: With dead ends: 108 [2019-09-20 13:00:18,327 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 13:00:18,328 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 13:00:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-09-20 13:00:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 13:00:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-09-20 13:00:18,346 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-09-20 13:00:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,347 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-09-20 13:00:18,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-09-20 13:00:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:18,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,349 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:18,349 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-09-20 13:00:18,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,420 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-09-20 13:00:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,454 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-09-20 13:00:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,458 INFO L225 Difference]: With dead ends: 136 [2019-09-20 13:00:18,458 INFO L226 Difference]: Without dead ends: 134 [2019-09-20 13:00:18,459 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-20 13:00:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-09-20 13:00:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 13:00:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-09-20 13:00:18,473 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-09-20 13:00:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,474 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-09-20 13:00:18,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-09-20 13:00:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:18,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,476 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:18,476 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-09-20 13:00:18,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,542 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-09-20 13:00:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,580 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-09-20 13:00:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,583 INFO L225 Difference]: With dead ends: 224 [2019-09-20 13:00:18,583 INFO L226 Difference]: Without dead ends: 136 [2019-09-20 13:00:18,586 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-20 13:00:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-20 13:00:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-20 13:00:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-09-20 13:00:18,607 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-09-20 13:00:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,608 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-09-20 13:00:18,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-09-20 13:00:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,615 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,615 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:18,615 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-09-20 13:00:18,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,656 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-09-20 13:00:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,679 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-09-20 13:00:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,682 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:00:18,682 INFO L226 Difference]: Without dead ends: 138 [2019-09-20 13:00:18,683 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-20 13:00:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-20 13:00:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:00:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-09-20 13:00:18,694 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-09-20 13:00:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,694 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-09-20 13:00:18,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-09-20 13:00:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,696 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:18,697 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-09-20 13:00:18,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,733 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-09-20 13:00:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,757 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-09-20 13:00:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,759 INFO L225 Difference]: With dead ends: 252 [2019-09-20 13:00:18,760 INFO L226 Difference]: Without dead ends: 250 [2019-09-20 13:00:18,764 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-20 13:00:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-09-20 13:00:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:00:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-09-20 13:00:18,784 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-09-20 13:00:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,784 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-09-20 13:00:18,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-09-20 13:00:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,787 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,788 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:18,788 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-09-20 13:00:18,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,835 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-09-20 13:00:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,887 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-09-20 13:00:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,889 INFO L225 Difference]: With dead ends: 432 [2019-09-20 13:00:18,890 INFO L226 Difference]: Without dead ends: 258 [2019-09-20 13:00:18,891 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-20 13:00:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-20 13:00:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:00:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-09-20 13:00:18,904 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-09-20 13:00:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,904 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-09-20 13:00:18,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-09-20 13:00:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,906 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,906 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-09-20 13:00:18,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,947 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-09-20 13:00:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,971 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-09-20 13:00:18,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,974 INFO L225 Difference]: With dead ends: 384 [2019-09-20 13:00:18,974 INFO L226 Difference]: Without dead ends: 262 [2019-09-20 13:00:18,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-20 13:00:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-20 13:00:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:00:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-09-20 13:00:18,986 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-09-20 13:00:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,986 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-09-20 13:00:18,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-09-20 13:00:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,988 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,988 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:18,988 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-09-20 13:00:18,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,014 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-09-20 13:00:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,037 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-09-20 13:00:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,041 INFO L225 Difference]: With dead ends: 476 [2019-09-20 13:00:19,041 INFO L226 Difference]: Without dead ends: 474 [2019-09-20 13:00:19,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-20 13:00:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-09-20 13:00:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:00:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-09-20 13:00:19,055 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-09-20 13:00:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,056 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-09-20 13:00:19,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-09-20 13:00:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:19,058 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,058 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:19,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-09-20 13:00:19,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,085 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-09-20 13:00:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,115 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-09-20 13:00:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,120 INFO L225 Difference]: With dead ends: 844 [2019-09-20 13:00:19,120 INFO L226 Difference]: Without dead ends: 498 [2019-09-20 13:00:19,121 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-20 13:00:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-09-20 13:00:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-20 13:00:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-09-20 13:00:19,141 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-09-20 13:00:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,142 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-09-20 13:00:19,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-09-20 13:00:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,144 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,144 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-09-20 13:00:19,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,168 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-09-20 13:00:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,189 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-09-20 13:00:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,193 INFO L225 Difference]: With dead ends: 744 [2019-09-20 13:00:19,193 INFO L226 Difference]: Without dead ends: 506 [2019-09-20 13:00:19,194 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-20 13:00:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-20 13:00:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-20 13:00:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-09-20 13:00:19,210 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-09-20 13:00:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,211 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-09-20 13:00:19,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-09-20 13:00:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,213 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,213 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-09-20 13:00:19,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,238 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-09-20 13:00:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,267 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-09-20 13:00:19,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,273 INFO L225 Difference]: With dead ends: 908 [2019-09-20 13:00:19,273 INFO L226 Difference]: Without dead ends: 906 [2019-09-20 13:00:19,274 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-20 13:00:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-09-20 13:00:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-20 13:00:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-09-20 13:00:19,298 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-09-20 13:00:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,299 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-09-20 13:00:19,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-09-20 13:00:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,301 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,301 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,301 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-09-20 13:00:19,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,322 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:00:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,358 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-09-20 13:00:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,365 INFO L225 Difference]: With dead ends: 1660 [2019-09-20 13:00:19,365 INFO L226 Difference]: Without dead ends: 970 [2019-09-20 13:00:19,370 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-20 13:00:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-20 13:00:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-20 13:00:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-09-20 13:00:19,403 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-09-20 13:00:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,403 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-09-20 13:00:19,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-09-20 13:00:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,405 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,406 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-09-20 13:00:19,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,436 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:00:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,466 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-09-20 13:00:19,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,472 INFO L225 Difference]: With dead ends: 1452 [2019-09-20 13:00:19,472 INFO L226 Difference]: Without dead ends: 986 [2019-09-20 13:00:19,475 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-20 13:00:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-09-20 13:00:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-20 13:00:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-09-20 13:00:19,512 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-09-20 13:00:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,513 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-09-20 13:00:19,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-09-20 13:00:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,516 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-09-20 13:00:19,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,550 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:00:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,600 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-09-20 13:00:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,609 INFO L225 Difference]: With dead ends: 1740 [2019-09-20 13:00:19,609 INFO L226 Difference]: Without dead ends: 1738 [2019-09-20 13:00:19,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-20 13:00:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-09-20 13:00:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-20 13:00:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-09-20 13:00:19,652 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-09-20 13:00:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,653 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-09-20 13:00:19,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-09-20 13:00:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,656 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,656 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,657 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-09-20 13:00:19,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,684 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-09-20 13:00:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,729 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-09-20 13:00:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,739 INFO L225 Difference]: With dead ends: 3276 [2019-09-20 13:00:19,739 INFO L226 Difference]: Without dead ends: 1898 [2019-09-20 13:00:19,743 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-20 13:00:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-20 13:00:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-20 13:00:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-09-20 13:00:19,803 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-09-20 13:00:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,803 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-09-20 13:00:19,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-09-20 13:00:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,807 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,807 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,808 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-09-20 13:00:19,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,844 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-09-20 13:00:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,903 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-09-20 13:00:19,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,914 INFO L225 Difference]: With dead ends: 2844 [2019-09-20 13:00:19,915 INFO L226 Difference]: Without dead ends: 1930 [2019-09-20 13:00:19,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-20 13:00:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-20 13:00:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-20 13:00:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-09-20 13:00:20,000 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-09-20 13:00:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,001 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-09-20 13:00:20,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-09-20 13:00:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:20,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,005 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,006 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-09-20 13:00:20,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,041 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-09-20 13:00:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,121 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-09-20 13:00:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,144 INFO L225 Difference]: With dead ends: 3340 [2019-09-20 13:00:20,145 INFO L226 Difference]: Without dead ends: 3338 [2019-09-20 13:00:20,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-20 13:00:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-09-20 13:00:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-20 13:00:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-09-20 13:00:20,239 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-09-20 13:00:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,240 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-09-20 13:00:20,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-09-20 13:00:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:20,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,246 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,247 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-09-20 13:00:20,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,271 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:00:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,379 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-09-20 13:00:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,397 INFO L225 Difference]: With dead ends: 6476 [2019-09-20 13:00:20,398 INFO L226 Difference]: Without dead ends: 3722 [2019-09-20 13:00:20,403 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-20 13:00:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-09-20 13:00:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-20 13:00:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-09-20 13:00:20,512 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-09-20 13:00:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,513 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-09-20 13:00:20,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-09-20 13:00:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,519 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,519 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,519 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-09-20 13:00:20,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,543 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-09-20 13:00:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,627 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-09-20 13:00:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,648 INFO L225 Difference]: With dead ends: 5580 [2019-09-20 13:00:20,649 INFO L226 Difference]: Without dead ends: 3786 [2019-09-20 13:00:20,654 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-09-20 13:00:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-09-20 13:00:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-09-20 13:00:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-09-20 13:00:20,772 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-09-20 13:00:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,773 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-09-20 13:00:20,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-09-20 13:00:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,778 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,778 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,779 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-09-20 13:00:20,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,804 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-09-20 13:00:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,925 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-09-20 13:00:20,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,006 INFO L225 Difference]: With dead ends: 10956 [2019-09-20 13:00:21,006 INFO L226 Difference]: Without dead ends: 7306 [2019-09-20 13:00:21,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-20 13:00:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-09-20 13:00:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-20 13:00:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-09-20 13:00:21,205 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-09-20 13:00:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,205 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-09-20 13:00:21,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-09-20 13:00:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:21,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,215 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,215 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-09-20 13:00:21,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,235 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-09-20 13:00:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,371 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-09-20 13:00:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,391 INFO L225 Difference]: With dead ends: 8076 [2019-09-20 13:00:21,391 INFO L226 Difference]: Without dead ends: 8074 [2019-09-20 13:00:21,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-20 13:00:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-09-20 13:00:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-20 13:00:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-09-20 13:00:21,593 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-09-20 13:00:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,594 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-09-20 13:00:21,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-09-20 13:00:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:21,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,605 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,606 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-09-20 13:00:21,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,627 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-09-20 13:00:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,832 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-09-20 13:00:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,855 INFO L225 Difference]: With dead ends: 12172 [2019-09-20 13:00:21,855 INFO L226 Difference]: Without dead ends: 12170 [2019-09-20 13:00:21,859 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-20 13:00:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-09-20 13:00:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-20 13:00:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-09-20 13:00:22,072 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-09-20 13:00:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,072 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-09-20 13:00:22,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-09-20 13:00:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:22,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,089 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,089 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-09-20 13:00:22,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,113 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-09-20 13:00:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,366 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-09-20 13:00:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,402 INFO L225 Difference]: With dead ends: 25228 [2019-09-20 13:00:22,402 INFO L226 Difference]: Without dead ends: 14218 [2019-09-20 13:00:22,432 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-09-20 13:00:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-09-20 13:00:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-20 13:00:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-09-20 13:00:22,896 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-09-20 13:00:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,896 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-09-20 13:00:22,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-09-20 13:00:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:22,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,916 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,916 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-09-20 13:00:22,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,938 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-09-20 13:00:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,144 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-09-20 13:00:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,172 INFO L225 Difference]: With dead ends: 21516 [2019-09-20 13:00:23,173 INFO L226 Difference]: Without dead ends: 14602 [2019-09-20 13:00:23,190 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-09-20 13:00:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-09-20 13:00:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-09-20 13:00:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-09-20 13:00:23,570 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-09-20 13:00:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,570 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-09-20 13:00:23,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-09-20 13:00:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:23,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,590 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,591 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-09-20 13:00:23,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,617 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-09-20 13:00:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,891 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-09-20 13:00:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,934 INFO L225 Difference]: With dead ends: 23562 [2019-09-20 13:00:23,934 INFO L226 Difference]: Without dead ends: 23560 [2019-09-20 13:00:23,943 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-09-20 13:00:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-09-20 13:00:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-09-20 13:00:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-09-20 13:00:24,819 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-09-20 13:00:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:24,820 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-09-20 13:00:24,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-09-20 13:00:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:24,856 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:24,856 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:24,856 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-09-20 13:00:24,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:24,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:24,876 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,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:24,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:24,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,877 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-09-20 13:00:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,342 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-09-20 13:00:25,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,343 INFO L225 Difference]: With dead ends: 50184 [2019-09-20 13:00:25,343 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:25,401 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,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:25,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-20 13:00:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,403 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:25,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:25,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:25,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:25,430 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:25,430 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:25,430 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:25,430 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:25,431 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:25,431 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:25,431 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-09-20 13:00:25,431 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-09-20 13:00:25,431 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,431 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,431 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,432 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,433 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,433 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-09-20 13:00:25,433 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-09-20 13:00:25,433 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-20 13:00:25,434 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-09-20 13:00:25,434 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-20 13:00:25,434 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-09-20 13:00:25,434 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,434 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,434 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-09-20 13:00:25,435 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-09-20 13:00:25,436 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,437 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-09-20 13:00:25,437 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-20 13:00:25,437 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-09-20 13:00:25,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:25 BoogieIcfgContainer [2019-09-20 13:00:25,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:25,452 INFO L168 Benchmark]: Toolchain (without parser) took 8848.78 ms. Allocated memory was 132.1 MB in the beginning and 561.0 MB in the end (delta: 428.9 MB). Free memory was 87.3 MB in the beginning and 412.5 MB in the end (delta: -325.1 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:25,452 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 132.1 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:00:25,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.61 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.3 MB in the beginning and 176.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:25,459 INFO L168 Benchmark]: Boogie Preprocessor took 38.04 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.7 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:25,460 INFO L168 Benchmark]: RCFGBuilder took 406.39 ms. Allocated memory is still 199.8 MB. Free memory was 174.7 MB in the beginning and 155.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:25,461 INFO L168 Benchmark]: TraceAbstraction took 8016.32 ms. Allocated memory was 199.8 MB in the beginning and 561.0 MB in the end (delta: 361.2 MB). Free memory was 154.6 MB in the beginning and 412.5 MB in the end (delta: -257.9 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:25,471 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.48 ms. Allocated memory is still 132.1 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 376.61 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.3 MB in the beginning and 176.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.04 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.39 ms. Allocated memory is still 199.8 MB. Free memory was 174.7 MB in the beginning and 155.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8016.32 ms. Allocated memory was 199.8 MB in the beginning and 561.0 MB in the end (delta: 361.2 MB). Free memory was 154.6 MB in the beginning and 412.5 MB in the end (delta: -257.9 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 3.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...