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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:08:19,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:08:19,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:08:19,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:08:19,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:08:19,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:08:19,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:08:19,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:08:19,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:08:19,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:08:19,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:08:19,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:08:19,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:08:19,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:08:19,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:08:19,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:08:19,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:08:19,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:08:19,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:08:19,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:08:19,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:08:19,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:08:19,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:08:19,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:08:19,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:08:19,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:08:19,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:08:19,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:08:19,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:08:19,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:08:19,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:08:19,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:08:19,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:08:19,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:08:19,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:08:19,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:08:19,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:08:19,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:08:19,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:08:19,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:08:19,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:08:19,608 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-10-02 11:08:19,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:08:19,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:08:19,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:08:19,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:08:19,635 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:08:19,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:08:19,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:08:19,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:08:19,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:08:19,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:08:19,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:08:19,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:08:19,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:08:19,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:08:19,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:08:19,638 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:08:19,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:08:19,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:08:19,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:08:19,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:08:19,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:08:19,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:08:19,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:08:19,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:08:19,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:08:19,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:08:19,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:08:19,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:08:19,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:08:19,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:08:19,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:08:19,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:08:19,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:08:19,691 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:08:19,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-02 11:08:19,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85614de9/5437d6f0dd3c402ab649f6e2671abeb7/FLAGaa03ec02f [2019-10-02 11:08:20,195 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:08:20,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-02 11:08:20,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85614de9/5437d6f0dd3c402ab649f6e2671abeb7/FLAGaa03ec02f [2019-10-02 11:08:20,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85614de9/5437d6f0dd3c402ab649f6e2671abeb7 [2019-10-02 11:08:20,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:08:20,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:08:20,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:20,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:08:20,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:08:20,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:20,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774ea263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20, skipping insertion in model container [2019-10-02 11:08:20,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:20,611 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:08:20,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:08:20,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:20,868 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:08:20,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:20,990 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:08:20,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20 WrapperNode [2019-10-02 11:08:20,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:20,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:08:20,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:08:20,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:08:21,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (1/1) ... [2019-10-02 11:08:21,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:08:21,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:08:21,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:08:21,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:08:21,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (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-10-02 11:08:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:08:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:08:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:08:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:08:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:08:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:08:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:08:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:08:21,449 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:08:21,449 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:08:21,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:21 BoogieIcfgContainer [2019-10-02 11:08:21,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:08:21,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:08:21,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:08:21,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:08:21,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:08:20" (1/3) ... [2019-10-02 11:08:21,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:21, skipping insertion in model container [2019-10-02 11:08:21,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:20" (2/3) ... [2019-10-02 11:08:21,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b0cc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:21, skipping insertion in model container [2019-10-02 11:08:21,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:21" (3/3) ... [2019-10-02 11:08:21,460 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-02 11:08:21,469 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:08:21,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:08:21,493 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:08:21,524 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:08:21,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:08:21,525 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:08:21,526 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:08:21,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:08:21,526 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:08:21,526 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:08:21,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:08:21,527 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:08:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-02 11:08:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:21,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:21,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:21,555 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-10-02 11:08:21,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:21,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:21,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:21,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:21,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:21,762 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-10-02 11:08:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:21,830 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-10-02 11:08:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:21,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:21,849 INFO L225 Difference]: With dead ends: 75 [2019-10-02 11:08:21,850 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:08:21,854 INFO L640 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-10-02 11:08:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:08:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-02 11:08:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:08:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-10-02 11:08:21,895 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-10-02 11:08:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:21,895 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-10-02 11:08:21,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-10-02 11:08:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:08:21,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:21,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:21,897 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-10-02 11:08:21,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:21,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:21,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:21,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:21,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:21,959 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-10-02 11:08:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:21,997 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-10-02 11:08:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:21,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 11:08:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:21,999 INFO L225 Difference]: With dead ends: 97 [2019-10-02 11:08:21,999 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:08:22,001 INFO L640 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-10-02 11:08:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:08:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-02 11:08:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:08:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-10-02 11:08:22,018 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-10-02 11:08:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,018 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-10-02 11:08:22,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-10-02 11:08:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:22,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,020 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-10-02 11:08:22,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,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-10-02 11:08:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,095 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-10-02 11:08:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,124 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-10-02 11:08:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,126 INFO L225 Difference]: With dead ends: 90 [2019-10-02 11:08:22,127 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 11:08:22,127 INFO L640 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-10-02 11:08:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 11:08:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 11:08:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 11:08:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-10-02 11:08:22,146 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-10-02 11:08:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,146 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-10-02 11:08:22,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-10-02 11:08:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:22,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,152 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-10-02 11:08:22,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,198 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-10-02 11:08:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,233 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-10-02 11:08:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,238 INFO L225 Difference]: With dead ends: 112 [2019-10-02 11:08:22,238 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:08:22,241 INFO L640 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-10-02 11:08:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:08:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-10-02 11:08:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-02 11:08:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-10-02 11:08:22,267 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-10-02 11:08:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,268 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-10-02 11:08:22,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-10-02 11:08:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:22,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,270 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-10-02 11:08:22,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,331 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-10-02 11:08:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,355 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-10-02 11:08:22,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,356 INFO L225 Difference]: With dead ends: 184 [2019-10-02 11:08:22,357 INFO L226 Difference]: Without dead ends: 112 [2019-10-02 11:08:22,358 INFO L640 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-10-02 11:08:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-02 11:08:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-10-02 11:08:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-02 11:08:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-10-02 11:08:22,368 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-10-02 11:08:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,369 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-10-02 11:08:22,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-10-02 11:08:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:22,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,371 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,371 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-10-02 11:08:22,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,417 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-10-02 11:08:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,446 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-10-02 11:08:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,448 INFO L225 Difference]: With dead ends: 165 [2019-10-02 11:08:22,449 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 11:08:22,449 INFO L640 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-10-02 11:08:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 11:08:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-02 11:08:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-02 11:08:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-10-02 11:08:22,470 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-10-02 11:08:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,471 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-10-02 11:08:22,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-10-02 11:08:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:22,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,473 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-10-02 11:08:22,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,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-10-02 11:08:22,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,541 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-10-02 11:08:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,563 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-10-02 11:08:22,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,566 INFO L225 Difference]: With dead ends: 204 [2019-10-02 11:08:22,566 INFO L226 Difference]: Without dead ends: 202 [2019-10-02 11:08:22,567 INFO L640 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-10-02 11:08:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-02 11:08:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-10-02 11:08:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-02 11:08:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-10-02 11:08:22,578 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-10-02 11:08:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,579 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-10-02 11:08:22,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-10-02 11:08:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:22,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:22,581 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-10-02 11:08:22,582 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,619 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-10-02 11:08:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,645 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-10-02 11:08:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,647 INFO L225 Difference]: With dead ends: 352 [2019-10-02 11:08:22,647 INFO L226 Difference]: Without dead ends: 210 [2019-10-02 11:08:22,649 INFO L640 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-10-02 11:08:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-02 11:08:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-10-02 11:08:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-02 11:08:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-10-02 11:08:22,665 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-10-02 11:08:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,666 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-10-02 11:08:22,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-10-02 11:08:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:22,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,671 INFO L411 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-10-02 11:08:22,672 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-10-02 11:08:22,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,708 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-10-02 11:08:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,736 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-02 11:08:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,740 INFO L225 Difference]: With dead ends: 312 [2019-10-02 11:08:22,740 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 11:08:22,743 INFO L640 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-10-02 11:08:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 11:08:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-02 11:08:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-02 11:08:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-10-02 11:08:22,776 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-10-02 11:08:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,777 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-10-02 11:08:22,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-10-02 11:08:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:22,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,779 INFO L411 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-10-02 11:08:22,779 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-10-02 11:08:22,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,815 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-10-02 11:08:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,838 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-10-02 11:08:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,844 INFO L225 Difference]: With dead ends: 380 [2019-10-02 11:08:22,844 INFO L226 Difference]: Without dead ends: 378 [2019-10-02 11:08:22,845 INFO L640 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-10-02 11:08:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-02 11:08:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-10-02 11:08:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-02 11:08:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-10-02 11:08:22,857 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-10-02 11:08:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-10-02 11:08:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-10-02 11:08:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:22,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,866 INFO L411 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-10-02 11:08:22,867 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-10-02 11:08:22,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:22,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:22,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:22,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,916 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-10-02 11:08:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,952 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-10-02 11:08:22,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,955 INFO L225 Difference]: With dead ends: 684 [2019-10-02 11:08:22,956 INFO L226 Difference]: Without dead ends: 402 [2019-10-02 11:08:22,958 INFO L640 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-10-02 11:08:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-02 11:08:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-10-02 11:08:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-02 11:08:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-10-02 11:08:22,977 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-10-02 11:08:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:22,977 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-10-02 11:08:22,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-10-02 11:08:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:22,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:22,981 INFO L411 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-10-02 11:08:22,981 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-10-02 11:08:22,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,025 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-10-02 11:08:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,045 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-10-02 11:08:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,049 INFO L225 Difference]: With dead ends: 600 [2019-10-02 11:08:23,049 INFO L226 Difference]: Without dead ends: 410 [2019-10-02 11:08:23,050 INFO L640 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-10-02 11:08:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-02 11:08:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-10-02 11:08:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-02 11:08:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-10-02 11:08:23,066 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-10-02 11:08:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,068 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-10-02 11:08:23,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-10-02 11:08:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:23,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,070 INFO L411 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-10-02 11:08:23,070 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-10-02 11:08:23,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,111 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-10-02 11:08:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,137 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-10-02 11:08:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,142 INFO L225 Difference]: With dead ends: 716 [2019-10-02 11:08:23,142 INFO L226 Difference]: Without dead ends: 714 [2019-10-02 11:08:23,143 INFO L640 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-10-02 11:08:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-02 11:08:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-10-02 11:08:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-02 11:08:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-10-02 11:08:23,163 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-10-02 11:08:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,163 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-10-02 11:08:23,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-10-02 11:08:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:23,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,165 INFO L411 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-10-02 11:08:23,165 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-10-02 11:08:23,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,185 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-10-02 11:08:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,213 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-10-02 11:08:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,218 INFO L225 Difference]: With dead ends: 1340 [2019-10-02 11:08:23,218 INFO L226 Difference]: Without dead ends: 778 [2019-10-02 11:08:23,219 INFO L640 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-10-02 11:08:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-10-02 11:08:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-10-02 11:08:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-02 11:08:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-10-02 11:08:23,243 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-10-02 11:08:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,243 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-10-02 11:08:23,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-10-02 11:08:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:23,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,245 INFO L411 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-10-02 11:08:23,245 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-10-02 11:08:23,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,265 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-10-02 11:08:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,291 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-10-02 11:08:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,295 INFO L225 Difference]: With dead ends: 1164 [2019-10-02 11:08:23,295 INFO L226 Difference]: Without dead ends: 794 [2019-10-02 11:08:23,296 INFO L640 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-10-02 11:08:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-02 11:08:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-10-02 11:08:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-10-02 11:08:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-10-02 11:08:23,320 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-10-02 11:08:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,321 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-10-02 11:08:23,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-10-02 11:08:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:23,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,322 INFO L411 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-10-02 11:08:23,323 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-10-02 11:08:23,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,347 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-10-02 11:08:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,378 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-10-02 11:08:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,385 INFO L225 Difference]: With dead ends: 1356 [2019-10-02 11:08:23,385 INFO L226 Difference]: Without dead ends: 1354 [2019-10-02 11:08:23,386 INFO L640 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-10-02 11:08:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-02 11:08:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-10-02 11:08:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-02 11:08:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-10-02 11:08:23,424 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-10-02 11:08:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,424 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-10-02 11:08:23,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-10-02 11:08:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:23,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,427 INFO L411 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-10-02 11:08:23,427 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-10-02 11:08:23,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,454 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-10-02 11:08:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,513 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-10-02 11:08:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,521 INFO L225 Difference]: With dead ends: 2636 [2019-10-02 11:08:23,522 INFO L226 Difference]: Without dead ends: 1514 [2019-10-02 11:08:23,525 INFO L640 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-10-02 11:08:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-10-02 11:08:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-10-02 11:08:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-10-02 11:08:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-10-02 11:08:23,604 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-10-02 11:08:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,606 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-10-02 11:08:23,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-10-02 11:08:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:23,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,610 INFO L411 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-10-02 11:08:23,610 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-10-02 11:08:23,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,648 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-10-02 11:08:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,699 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-10-02 11:08:23,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,710 INFO L225 Difference]: With dead ends: 2268 [2019-10-02 11:08:23,710 INFO L226 Difference]: Without dead ends: 1546 [2019-10-02 11:08:23,713 INFO L640 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-10-02 11:08:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-02 11:08:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-10-02 11:08:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-02 11:08:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-10-02 11:08:23,775 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-10-02 11:08:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,775 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-10-02 11:08:23,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-10-02 11:08:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:23,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,779 INFO L411 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-10-02 11:08:23,779 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-10-02 11:08:23,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,808 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-10-02 11:08:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:23,870 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-10-02 11:08:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:23,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:23,882 INFO L225 Difference]: With dead ends: 2572 [2019-10-02 11:08:23,883 INFO L226 Difference]: Without dead ends: 2570 [2019-10-02 11:08:23,885 INFO L640 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-10-02 11:08:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-10-02 11:08:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-10-02 11:08:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-02 11:08:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-10-02 11:08:23,951 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-10-02 11:08:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,951 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-10-02 11:08:23,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-10-02 11:08:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:23,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,955 INFO L411 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-10-02 11:08:23,955 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-10-02 11:08:23,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,983 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-10-02 11:08:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:24,064 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-10-02 11:08:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:24,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:24,078 INFO L225 Difference]: With dead ends: 5196 [2019-10-02 11:08:24,078 INFO L226 Difference]: Without dead ends: 2954 [2019-10-02 11:08:24,082 INFO L640 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-10-02 11:08:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-02 11:08:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-10-02 11:08:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-10-02 11:08:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-10-02 11:08:24,180 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-10-02 11:08:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:24,180 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-10-02 11:08:24,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-10-02 11:08:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:24,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:24,188 INFO L411 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-10-02 11:08:24,188 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-10-02 11:08:24,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:24,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:24,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:24,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:24,230 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-10-02 11:08:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:24,314 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-10-02 11:08:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:24,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:24,349 INFO L225 Difference]: With dead ends: 4428 [2019-10-02 11:08:24,350 INFO L226 Difference]: Without dead ends: 3018 [2019-10-02 11:08:24,353 INFO L640 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-10-02 11:08:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-10-02 11:08:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-10-02 11:08:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-02 11:08:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-10-02 11:08:24,446 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-10-02 11:08:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:24,446 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-10-02 11:08:24,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-10-02 11:08:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:24,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:24,450 INFO L411 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-10-02 11:08:24,450 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-10-02 11:08:24,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:24,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:24,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:24,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:24,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:24,469 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-10-02 11:08:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:24,581 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-10-02 11:08:24,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:24,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:24,594 INFO L225 Difference]: With dead ends: 8650 [2019-10-02 11:08:24,594 INFO L226 Difference]: Without dead ends: 3016 [2019-10-02 11:08:24,604 INFO L640 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-10-02 11:08:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-10-02 11:08:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-10-02 11:08:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-10-02 11:08:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-10-02 11:08:24,698 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-10-02 11:08:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:24,698 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-10-02 11:08:24,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-10-02 11:08:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:24,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:24,704 INFO L411 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-10-02 11:08:24,704 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-10-02 11:08:24,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:24,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:24,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:24,725 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-10-02 11:08:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:24,775 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-10-02 11:08:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:24,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:24,776 INFO L225 Difference]: With dead ends: 3016 [2019-10-02 11:08:24,776 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:08:24,781 INFO L640 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-10-02 11:08:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:08:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:08:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:08:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:08:24,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-02 11:08:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:24,783 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:08:24,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:08:24,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:08:24,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:08:24,808 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:08:24,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:24,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:24,808 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:08:24,809 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:08:24,809 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:08:24,809 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-02 11:08:24,809 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-02 11:08:24,809 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,809 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-02 11:08:24,809 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 11:08:24,810 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 11:08:24,811 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-02 11:08:24,812 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,812 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-02 11:08:24,813 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,813 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,813 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-02 11:08:24,813 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-02 11:08:24,813 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-10-02 11:08:24,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:08:24 BoogieIcfgContainer [2019-10-02 11:08:24,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:08:24,833 INFO L168 Benchmark]: Toolchain (without parser) took 4228.86 ms. Allocated memory was 130.5 MB in the beginning and 269.5 MB in the end (delta: 138.9 MB). Free memory was 85.1 MB in the beginning and 103.7 MB in the end (delta: -18.6 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,835 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 130.5 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.36 ms. Allocated memory was 130.5 MB in the beginning and 197.7 MB in the end (delta: 67.1 MB). Free memory was 84.9 MB in the beginning and 175.0 MB in the end (delta: -90.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,837 INFO L168 Benchmark]: Boogie Preprocessor took 34.83 ms. Allocated memory is still 197.7 MB. Free memory was 175.0 MB in the beginning and 172.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,838 INFO L168 Benchmark]: RCFGBuilder took 424.54 ms. Allocated memory is still 197.7 MB. Free memory was 172.7 MB in the beginning and 155.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,842 INFO L168 Benchmark]: TraceAbstraction took 3369.62 ms. Allocated memory was 197.7 MB in the beginning and 269.5 MB in the end (delta: 71.8 MB). Free memory was 155.3 MB in the beginning and 103.7 MB in the end (delta: 51.6 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:24,850 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.20 ms. Allocated memory is still 130.5 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.36 ms. Allocated memory was 130.5 MB in the beginning and 197.7 MB in the end (delta: 67.1 MB). Free memory was 84.9 MB in the beginning and 175.0 MB in the end (delta: -90.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.83 ms. Allocated memory is still 197.7 MB. Free memory was 175.0 MB in the beginning and 172.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.54 ms. Allocated memory is still 197.7 MB. Free memory was 172.7 MB in the beginning and 155.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3369.62 ms. Allocated memory was 197.7 MB in the beginning and 269.5 MB in the end (delta: 71.8 MB). Free memory was 155.3 MB in the beginning and 103.7 MB in the end (delta: 51.6 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 38 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...