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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:23,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:23,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:23,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:23,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:23,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:23,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:23,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:23,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:23,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:23,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:23,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:23,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:23,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:23,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:23,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:23,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:23,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:23,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:23,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:23,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:23,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:23,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:23,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:23,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:23,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:23,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:23,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:23,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:23,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:23,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:23,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:23,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:23,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:23,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:23,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:23,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:23,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:23,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:23,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:23,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:23,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:00:23,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:23,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:23,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:23,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:23,809 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:23,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:23,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:23,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:23,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:23,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:23,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:23,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:23,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:23,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:23,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:23,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:23,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:23,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:23,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:23,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:23,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:23,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:23,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:23,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:23,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:23,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:23,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:23,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:23,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:23,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:23,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:23,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:23,899 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:23,899 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:23,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-09-20 13:00:23,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccf35698/4adf13223fac49e084069b0b64cb8ad2/FLAG8da85308a [2019-09-20 13:00:24,464 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:24,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-09-20 13:00:24,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccf35698/4adf13223fac49e084069b0b64cb8ad2/FLAG8da85308a [2019-09-20 13:00:24,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccf35698/4adf13223fac49e084069b0b64cb8ad2 [2019-09-20 13:00:24,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:24,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:24,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:24,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:24,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:24,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3fac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24, skipping insertion in model container [2019-09-20 13:00:24,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,827 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:24,851 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:25,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:25,062 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:25,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:25,193 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:25,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25 WrapperNode [2019-09-20 13:00:25,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:25,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:25,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:25,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:25,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... [2019-09-20 13:00:25,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:25,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:25,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:25,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:25,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:25,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:25,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:25,589 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:25,589 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:25,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:25 BoogieIcfgContainer [2019-09-20 13:00:25,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:25,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:25,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:25,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:25,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:24" (1/3) ... [2019-09-20 13:00:25,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7e3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:25, skipping insertion in model container [2019-09-20 13:00:25,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:25" (2/3) ... [2019-09-20 13:00:25,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb7e3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:25, skipping insertion in model container [2019-09-20 13:00:25,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:25" (3/3) ... [2019-09-20 13:00:25,601 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-09-20 13:00:25,614 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:25,623 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:25,640 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:25,675 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:25,677 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:25,678 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:25,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:25,678 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:25,678 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:25,679 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:25,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:25,679 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-09-20 13:00:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,722 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,724 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-09-20 13:00:25,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,938 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-09-20 13:00:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,019 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-09-20 13:00:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,032 INFO L225 Difference]: With dead ends: 81 [2019-09-20 13:00:26,033 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:00:26,036 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:00:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-20 13:00:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:00:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-09-20 13:00:26,088 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-09-20 13:00:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,089 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-09-20 13:00:26,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-09-20 13:00:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:26,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,091 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,093 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-09-20 13:00:26,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,173 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-09-20 13:00:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,201 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-09-20 13:00:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,204 INFO L225 Difference]: With dead ends: 107 [2019-09-20 13:00:26,204 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:00:26,205 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:00:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-20 13:00:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:00:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-09-20 13:00:26,217 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-09-20 13:00:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,217 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-09-20 13:00:26,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-09-20 13:00:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,219 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,219 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,219 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-09-20 13:00:26,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,294 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-09-20 13:00:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,339 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-09-20 13:00:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,341 INFO L225 Difference]: With dead ends: 99 [2019-09-20 13:00:26,341 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 13:00:26,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 13:00:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-20 13:00:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 13:00:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-09-20 13:00:26,357 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-09-20 13:00:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,357 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-09-20 13:00:26,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-09-20 13:00:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,361 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,362 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-09-20 13:00:26,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,422 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-09-20 13:00:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,462 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-09-20 13:00:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,465 INFO L225 Difference]: With dead ends: 124 [2019-09-20 13:00:26,465 INFO L226 Difference]: Without dead ends: 122 [2019-09-20 13:00:26,466 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-20 13:00:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-09-20 13:00:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:00:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-09-20 13:00:26,477 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-09-20 13:00:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,478 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-09-20 13:00:26,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-09-20 13:00:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,480 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,480 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-09-20 13:00:26,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,520 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-09-20 13:00:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,548 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-09-20 13:00:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,553 INFO L225 Difference]: With dead ends: 204 [2019-09-20 13:00:26,553 INFO L226 Difference]: Without dead ends: 124 [2019-09-20 13:00:26,554 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-20 13:00:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-09-20 13:00:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 13:00:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-09-20 13:00:26,586 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-09-20 13:00:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,586 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-09-20 13:00:26,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-09-20 13:00:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,592 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,593 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-09-20 13:00:26,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,640 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-09-20 13:00:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,658 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-09-20 13:00:26,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,660 INFO L225 Difference]: With dead ends: 183 [2019-09-20 13:00:26,660 INFO L226 Difference]: Without dead ends: 126 [2019-09-20 13:00:26,661 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-20 13:00:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-20 13:00:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-20 13:00:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-09-20 13:00:26,673 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-09-20 13:00:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,673 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-09-20 13:00:26,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-09-20 13:00:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,675 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-09-20 13:00:26,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,717 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-09-20 13:00:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,745 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-09-20 13:00:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,748 INFO L225 Difference]: With dead ends: 228 [2019-09-20 13:00:26,748 INFO L226 Difference]: Without dead ends: 226 [2019-09-20 13:00:26,749 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-20 13:00:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-09-20 13:00:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 13:00:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-09-20 13:00:26,770 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-09-20 13:00:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,770 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-09-20 13:00:26,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-09-20 13:00:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,772 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,773 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,773 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-09-20 13:00:26,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,819 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-09-20 13:00:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,854 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-09-20 13:00:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,856 INFO L225 Difference]: With dead ends: 392 [2019-09-20 13:00:26,857 INFO L226 Difference]: Without dead ends: 234 [2019-09-20 13:00:26,858 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-20 13:00:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-09-20 13:00:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:00:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-09-20 13:00:26,885 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-09-20 13:00:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,886 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-09-20 13:00:26,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-09-20 13:00:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,892 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,892 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,893 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-09-20 13:00:26,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,969 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-09-20 13:00:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,995 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-09-20 13:00:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,997 INFO L225 Difference]: With dead ends: 348 [2019-09-20 13:00:26,997 INFO L226 Difference]: Without dead ends: 238 [2019-09-20 13:00:26,998 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-20 13:00:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-09-20 13:00:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-20 13:00:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-09-20 13:00:27,008 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-09-20 13:00:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,009 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-09-20 13:00:27,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-09-20 13:00:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:27,011 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,011 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,011 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-09-20 13:00:27,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,053 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-09-20 13:00:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,081 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-09-20 13:00:27,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,085 INFO L225 Difference]: With dead ends: 428 [2019-09-20 13:00:27,085 INFO L226 Difference]: Without dead ends: 426 [2019-09-20 13:00:27,086 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-20 13:00:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-09-20 13:00:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-20 13:00:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-09-20 13:00:27,098 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-09-20 13:00:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,099 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-09-20 13:00:27,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-09-20 13:00:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:27,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,101 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,101 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,101 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-09-20 13:00:27,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,147 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-09-20 13:00:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,178 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-09-20 13:00:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,182 INFO L225 Difference]: With dead ends: 764 [2019-09-20 13:00:27,182 INFO L226 Difference]: Without dead ends: 450 [2019-09-20 13:00:27,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-20 13:00:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-20 13:00:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-20 13:00:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-09-20 13:00:27,212 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-09-20 13:00:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,212 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-09-20 13:00:27,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-09-20 13:00:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,214 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,214 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-09-20 13:00:27,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,264 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-09-20 13:00:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,285 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2019-09-20 13:00:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,289 INFO L225 Difference]: With dead ends: 672 [2019-09-20 13:00:27,289 INFO L226 Difference]: Without dead ends: 458 [2019-09-20 13:00:27,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-20 13:00:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-09-20 13:00:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:00:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-09-20 13:00:27,305 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-09-20 13:00:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,305 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-09-20 13:00:27,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-09-20 13:00:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,307 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,307 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-09-20 13:00:27,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,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-09-20 13:00:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,332 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-09-20 13:00:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,356 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-09-20 13:00:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,362 INFO L225 Difference]: With dead ends: 812 [2019-09-20 13:00:27,362 INFO L226 Difference]: Without dead ends: 810 [2019-09-20 13:00:27,363 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-20 13:00:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-09-20 13:00:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-20 13:00:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-09-20 13:00:27,385 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-09-20 13:00:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,385 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-09-20 13:00:27,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-09-20 13:00:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,387 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,387 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-09-20 13:00:27,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,424 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-09-20 13:00:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,451 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-09-20 13:00:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,458 INFO L225 Difference]: With dead ends: 1500 [2019-09-20 13:00:27,458 INFO L226 Difference]: Without dead ends: 874 [2019-09-20 13:00:27,460 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-20 13:00:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-09-20 13:00:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-20 13:00:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-09-20 13:00:27,488 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-09-20 13:00:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,488 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-09-20 13:00:27,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-09-20 13:00:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,490 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,490 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,490 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-09-20 13:00:27,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,512 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-09-20 13:00:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,541 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-09-20 13:00:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,546 INFO L225 Difference]: With dead ends: 1308 [2019-09-20 13:00:27,546 INFO L226 Difference]: Without dead ends: 890 [2019-09-20 13:00:27,549 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-09-20 13:00:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-09-20 13:00:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-20 13:00:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-09-20 13:00:27,578 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-09-20 13:00:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,578 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-09-20 13:00:27,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-09-20 13:00:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,580 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,580 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,580 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-09-20 13:00:27,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,617 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-09-20 13:00:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,657 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-09-20 13:00:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,665 INFO L225 Difference]: With dead ends: 1548 [2019-09-20 13:00:27,665 INFO L226 Difference]: Without dead ends: 1546 [2019-09-20 13:00:27,667 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-20 13:00:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-09-20 13:00:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-20 13:00:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-09-20 13:00:27,714 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-09-20 13:00:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,714 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-09-20 13:00:27,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-09-20 13:00:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,717 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,718 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,718 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-09-20 13:00:27,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,759 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-09-20 13:00:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,804 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-09-20 13:00:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,813 INFO L225 Difference]: With dead ends: 2956 [2019-09-20 13:00:27,813 INFO L226 Difference]: Without dead ends: 1706 [2019-09-20 13:00:27,816 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-09-20 13:00:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-09-20 13:00:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-09-20 13:00:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-09-20 13:00:27,884 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-09-20 13:00:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,885 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-09-20 13:00:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-09-20 13:00:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:27,888 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,888 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,888 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-09-20 13:00:27,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,926 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:00:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,984 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-09-20 13:00:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,994 INFO L225 Difference]: With dead ends: 2556 [2019-09-20 13:00:27,995 INFO L226 Difference]: Without dead ends: 1738 [2019-09-20 13:00:27,997 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-20 13:00:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-09-20 13:00:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-09-20 13:00:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-09-20 13:00:28,076 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-09-20 13:00:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-09-20 13:00:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-09-20 13:00:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:28,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,081 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,081 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-09-20 13:00:28,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,117 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:00:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,182 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-09-20 13:00:28,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,199 INFO L225 Difference]: With dead ends: 2956 [2019-09-20 13:00:28,199 INFO L226 Difference]: Without dead ends: 2954 [2019-09-20 13:00:28,201 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-20 13:00:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-09-20 13:00:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-09-20 13:00:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-09-20 13:00:28,286 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-09-20 13:00:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,287 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-09-20 13:00:28,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-09-20 13:00:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:28,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,292 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,292 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,292 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-09-20 13:00:28,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,324 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-09-20 13:00:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,410 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-09-20 13:00:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,426 INFO L225 Difference]: With dead ends: 5836 [2019-09-20 13:00:28,426 INFO L226 Difference]: Without dead ends: 3338 [2019-09-20 13:00:28,431 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-20 13:00:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-09-20 13:00:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-20 13:00:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-09-20 13:00:28,585 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-09-20 13:00:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,585 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-09-20 13:00:28,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-09-20 13:00:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:28,591 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,591 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,591 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-09-20 13:00:28,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,621 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:00:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,707 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-09-20 13:00:28,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,724 INFO L225 Difference]: With dead ends: 5004 [2019-09-20 13:00:28,724 INFO L226 Difference]: Without dead ends: 3402 [2019-09-20 13:00:28,728 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-09-20 13:00:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-09-20 13:00:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-09-20 13:00:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-09-20 13:00:28,853 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-09-20 13:00:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,853 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-09-20 13:00:28,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-09-20 13:00:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:28,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,859 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,859 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-09-20 13:00:28,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,889 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:00:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:29,003 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-09-20 13:00:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:29,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:29,055 INFO L225 Difference]: With dead ends: 9804 [2019-09-20 13:00:29,056 INFO L226 Difference]: Without dead ends: 6538 [2019-09-20 13:00:29,065 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-20 13:00:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-09-20 13:00:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-20 13:00:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-09-20 13:00:29,306 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-09-20 13:00:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:29,306 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-09-20 13:00:29,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-09-20 13:00:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:29,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:29,315 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:29,316 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-09-20 13:00:29,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:29,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:29,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:29,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,340 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-09-20 13:00:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:29,491 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-09-20 13:00:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:29,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:29,508 INFO L225 Difference]: With dead ends: 7052 [2019-09-20 13:00:29,508 INFO L226 Difference]: Without dead ends: 7050 [2019-09-20 13:00:29,513 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-09-20 13:00:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-09-20 13:00:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-20 13:00:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-09-20 13:00:29,690 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-09-20 13:00:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:29,690 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-09-20 13:00:29,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-09-20 13:00:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:29,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:29,699 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:29,700 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-09-20 13:00:29,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:29,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:29,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:29,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,723 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-09-20 13:00:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:29,905 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-09-20 13:00:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:29,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:29,933 INFO L225 Difference]: With dead ends: 10634 [2019-09-20 13:00:29,933 INFO L226 Difference]: Without dead ends: 10632 [2019-09-20 13:00:29,944 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-09-20 13:00:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-09-20 13:00:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-09-20 13:00:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-09-20 13:00:30,338 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-09-20 13:00:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:30,338 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-09-20 13:00:30,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-09-20 13:00:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:30,355 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:30,355 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:30,355 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-09-20 13:00:30,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:30,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:30,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:30,377 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-09-20 13:00:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:30,580 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-09-20 13:00:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:30,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:30,581 INFO L225 Difference]: With dead ends: 22664 [2019-09-20 13:00:30,582 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:30,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:30,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-09-20 13:00:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:30,617 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:30,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:30,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:30,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:30,641 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:30,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:30,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:30,642 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:30,642 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:30,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:30,642 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,642 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,643 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,644 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-20 13:00:30,645 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,646 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,647 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-09-20 13:00:30,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:30 BoogieIcfgContainer [2019-09-20 13:00:30,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:30,662 INFO L168 Benchmark]: Toolchain (without parser) took 5848.34 ms. Allocated memory was 131.1 MB in the beginning and 354.9 MB in the end (delta: 223.9 MB). Free memory was 86.9 MB in the beginning and 145.4 MB in the end (delta: -58.4 MB). Peak memory consumption was 165.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,663 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.05 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.7 MB in the beginning and 175.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,666 INFO L168 Benchmark]: Boogie Preprocessor took 31.33 ms. Allocated memory is still 198.2 MB. Free memory was 175.2 MB in the beginning and 173.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,669 INFO L168 Benchmark]: RCFGBuilder took 364.80 ms. Allocated memory is still 198.2 MB. Free memory was 173.3 MB in the beginning and 154.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,669 INFO L168 Benchmark]: TraceAbstraction took 5067.12 ms. Allocated memory was 198.2 MB in the beginning and 354.9 MB in the end (delta: 156.8 MB). Free memory was 154.7 MB in the beginning and 145.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 166.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:30,679 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 381.05 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.7 MB in the beginning and 175.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.33 ms. Allocated memory is still 198.2 MB. Free memory was 175.2 MB in the beginning and 173.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.80 ms. Allocated memory is still 198.2 MB. Free memory was 173.3 MB in the beginning and 154.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5067.12 ms. Allocated memory was 198.2 MB in the beginning and 354.9 MB in the end (delta: 156.8 MB). Free memory was 154.7 MB in the beginning and 145.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 166.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, 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: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...