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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:33,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:33,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:33,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:33,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:33,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:33,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:33,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:33,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:33,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:33,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:33,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:33,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:33,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:33,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:33,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:33,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:33,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:33,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:33,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:33,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:33,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:33,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:33,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:33,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:33,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:33,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:33,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:33,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:33,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:33,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:33,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:33,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:33,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:33,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:33,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:33,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:33,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:33,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:33,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:33,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:33,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:33,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:33,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:33,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:33,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:33,073 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:33,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:33,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:33,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:33,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:33,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:33,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:33,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:33,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:33,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:33,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:33,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:33,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:33,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:33,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:33,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:33,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:33,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:33,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:33,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:33,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:33,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:33,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:33,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:33,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:33,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:33,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:33,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:33,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:33,367 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:33,368 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-14 23:13:33,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca0b451/de00129ca7ec4e89b45bd61709802390/FLAG05e848bcb [2019-10-14 23:13:33,869 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:33,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-14 23:13:33,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca0b451/de00129ca7ec4e89b45bd61709802390/FLAG05e848bcb [2019-10-14 23:13:34,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daca0b451/de00129ca7ec4e89b45bd61709802390 [2019-10-14 23:13:34,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:34,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:34,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:34,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:34,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:34,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3a515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34, skipping insertion in model container [2019-10-14 23:13:34,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,279 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:34,312 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:34,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:34,507 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:34,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:34,546 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:34,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34 WrapperNode [2019-10-14 23:13:34,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:34,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:34,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:34,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:34,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:34,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:34,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:34,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:34,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:35,048 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:35,049 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:35,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:35 BoogieIcfgContainer [2019-10-14 23:13:35,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:35,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:35,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:35,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:35,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:34" (1/3) ... [2019-10-14 23:13:35,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6340b16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:35, skipping insertion in model container [2019-10-14 23:13:35,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (2/3) ... [2019-10-14 23:13:35,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6340b16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:35, skipping insertion in model container [2019-10-14 23:13:35,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:35" (3/3) ... [2019-10-14 23:13:35,074 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-14 23:13:35,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:35,096 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:35,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:35,132 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:35,132 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:35,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:35,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:35,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:35,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:35,133 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:35,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-14 23:13:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:35,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-10-14 23:13:35,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064853579] [2019-10-14 23:13:35,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064853579] [2019-10-14 23:13:35,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996416097] [2019-10-14 23:13:35,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,394 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-10-14 23:13:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,497 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-10-14 23:13:35,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,522 INFO L225 Difference]: With dead ends: 93 [2019-10-14 23:13:35,522 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:13:35,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:13:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-10-14 23:13:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:13:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-10-14 23:13:35,610 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-10-14 23:13:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,611 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-10-14 23:13:35,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-10-14 23:13:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:35,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,615 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-10-14 23:13:35,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692290987] [2019-10-14 23:13:35,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692290987] [2019-10-14 23:13:35,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345660892] [2019-10-14 23:13:35,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,753 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-10-14 23:13:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,790 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-10-14 23:13:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,792 INFO L225 Difference]: With dead ends: 127 [2019-10-14 23:13:35,793 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:13:35,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:13:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-14 23:13:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 23:13:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-10-14 23:13:35,805 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-10-14 23:13:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,806 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-10-14 23:13:35,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-10-14 23:13:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:35,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-10-14 23:13:35,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962299466] [2019-10-14 23:13:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962299466] [2019-10-14 23:13:35,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360404036] [2019-10-14 23:13:35,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,877 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-10-14 23:13:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,917 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-10-14 23:13:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,919 INFO L225 Difference]: With dead ends: 117 [2019-10-14 23:13:35,919 INFO L226 Difference]: Without dead ends: 81 [2019-10-14 23:13:35,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-14 23:13:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-14 23:13:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 23:13:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-10-14 23:13:35,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-10-14 23:13:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-10-14 23:13:35,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-10-14 23:13:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:35,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,948 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-10-14 23:13:35,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609774933] [2019-10-14 23:13:35,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609774933] [2019-10-14 23:13:36,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378397444] [2019-10-14 23:13:36,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,013 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-10-14 23:13:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,042 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-10-14 23:13:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,044 INFO L225 Difference]: With dead ends: 148 [2019-10-14 23:13:36,045 INFO L226 Difference]: Without dead ends: 146 [2019-10-14 23:13:36,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-14 23:13:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-10-14 23:13:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:13:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-10-14 23:13:36,057 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-10-14 23:13:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,058 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-10-14 23:13:36,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-10-14 23:13:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:36,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,059 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-10-14 23:13:36,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088737116] [2019-10-14 23:13:36,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088737116] [2019-10-14 23:13:36,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810966047] [2019-10-14 23:13:36,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,109 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-10-14 23:13:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,130 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-10-14 23:13:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,132 INFO L225 Difference]: With dead ends: 244 [2019-10-14 23:13:36,132 INFO L226 Difference]: Without dead ends: 148 [2019-10-14 23:13:36,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-14 23:13:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-10-14 23:13:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-14 23:13:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-10-14 23:13:36,147 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-10-14 23:13:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,148 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-10-14 23:13:36,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-10-14 23:13:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,150 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-10-14 23:13:36,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437975820] [2019-10-14 23:13:36,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437975820] [2019-10-14 23:13:36,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630444786] [2019-10-14 23:13:36,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,220 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-10-14 23:13:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,241 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-10-14 23:13:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,243 INFO L225 Difference]: With dead ends: 219 [2019-10-14 23:13:36,243 INFO L226 Difference]: Without dead ends: 150 [2019-10-14 23:13:36,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-14 23:13:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-10-14 23:13:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-14 23:13:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-10-14 23:13:36,257 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-10-14 23:13:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,257 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-10-14 23:13:36,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-10-14 23:13:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-10-14 23:13:36,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779233834] [2019-10-14 23:13:36,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779233834] [2019-10-14 23:13:36,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900735815] [2019-10-14 23:13:36,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,310 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-10-14 23:13:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,328 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-10-14 23:13:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,330 INFO L225 Difference]: With dead ends: 276 [2019-10-14 23:13:36,331 INFO L226 Difference]: Without dead ends: 274 [2019-10-14 23:13:36,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-14 23:13:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-10-14 23:13:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-14 23:13:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-10-14 23:13:36,351 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-10-14 23:13:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,351 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-10-14 23:13:36,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-10-14 23:13:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,357 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-10-14 23:13:36,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352248137] [2019-10-14 23:13:36,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352248137] [2019-10-14 23:13:36,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3172063] [2019-10-14 23:13:36,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,425 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-10-14 23:13:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,471 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-10-14 23:13:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,474 INFO L225 Difference]: With dead ends: 472 [2019-10-14 23:13:36,474 INFO L226 Difference]: Without dead ends: 282 [2019-10-14 23:13:36,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-14 23:13:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-10-14 23:13:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-14 23:13:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-10-14 23:13:36,500 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-10-14 23:13:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,500 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-10-14 23:13:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-10-14 23:13:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-10-14 23:13:36,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393349060] [2019-10-14 23:13:36,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393349060] [2019-10-14 23:13:36,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702400461] [2019-10-14 23:13:36,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,567 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-10-14 23:13:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,596 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-10-14 23:13:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,598 INFO L225 Difference]: With dead ends: 420 [2019-10-14 23:13:36,598 INFO L226 Difference]: Without dead ends: 286 [2019-10-14 23:13:36,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-14 23:13:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-10-14 23:13:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-14 23:13:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-10-14 23:13:36,615 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-10-14 23:13:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,615 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-10-14 23:13:36,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-10-14 23:13:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,621 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-10-14 23:13:36,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319614078] [2019-10-14 23:13:36,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319614078] [2019-10-14 23:13:36,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051416474] [2019-10-14 23:13:36,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,655 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-10-14 23:13:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,675 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-10-14 23:13:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,679 INFO L225 Difference]: With dead ends: 524 [2019-10-14 23:13:36,679 INFO L226 Difference]: Without dead ends: 522 [2019-10-14 23:13:36,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-14 23:13:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-10-14 23:13:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-14 23:13:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-10-14 23:13:36,695 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-10-14 23:13:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,695 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-10-14 23:13:36,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-10-14 23:13:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-10-14 23:13:36,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129844889] [2019-10-14 23:13:36,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129844889] [2019-10-14 23:13:36,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274764324] [2019-10-14 23:13:36,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,747 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-10-14 23:13:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,785 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-10-14 23:13:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,789 INFO L225 Difference]: With dead ends: 924 [2019-10-14 23:13:36,789 INFO L226 Difference]: Without dead ends: 546 [2019-10-14 23:13:36,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-14 23:13:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-14 23:13:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-14 23:13:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-10-14 23:13:36,811 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-10-14 23:13:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,812 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-10-14 23:13:36,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-10-14 23:13:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:36,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,816 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-10-14 23:13:36,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825169698] [2019-10-14 23:13:36,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825169698] [2019-10-14 23:13:36,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593265391] [2019-10-14 23:13:36,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,857 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-10-14 23:13:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,884 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-10-14 23:13:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,889 INFO L225 Difference]: With dead ends: 816 [2019-10-14 23:13:36,889 INFO L226 Difference]: Without dead ends: 554 [2019-10-14 23:13:36,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-14 23:13:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-10-14 23:13:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-14 23:13:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-10-14 23:13:36,909 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-10-14 23:13:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,909 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-10-14 23:13:36,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-10-14 23:13:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:36,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,911 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-10-14 23:13:36,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757704450] [2019-10-14 23:13:36,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757704450] [2019-10-14 23:13:36,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610108513] [2019-10-14 23:13:36,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,966 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-10-14 23:13:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,992 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-10-14 23:13:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,999 INFO L225 Difference]: With dead ends: 1004 [2019-10-14 23:13:36,999 INFO L226 Difference]: Without dead ends: 1002 [2019-10-14 23:13:36,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-10-14 23:13:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-10-14 23:13:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-14 23:13:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-10-14 23:13:37,024 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-10-14 23:13:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,024 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-10-14 23:13:37,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-10-14 23:13:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:37,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,026 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-10-14 23:13:37,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735897237] [2019-10-14 23:13:37,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735897237] [2019-10-14 23:13:37,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888793434] [2019-10-14 23:13:37,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,049 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-10-14 23:13:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,083 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-10-14 23:13:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,089 INFO L225 Difference]: With dead ends: 1820 [2019-10-14 23:13:37,090 INFO L226 Difference]: Without dead ends: 1066 [2019-10-14 23:13:37,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-10-14 23:13:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-10-14 23:13:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-10-14 23:13:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-10-14 23:13:37,129 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-10-14 23:13:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,129 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-10-14 23:13:37,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-10-14 23:13:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,132 INFO L380 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-10-14 23:13:37,132 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-10-14 23:13:37,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681668373] [2019-10-14 23:13:37,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681668373] [2019-10-14 23:13:37,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670505531] [2019-10-14 23:13:37,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,156 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-10-14 23:13:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,191 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-10-14 23:13:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,200 INFO L225 Difference]: With dead ends: 1596 [2019-10-14 23:13:37,200 INFO L226 Difference]: Without dead ends: 1082 [2019-10-14 23:13:37,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-10-14 23:13:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-10-14 23:13:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-10-14 23:13:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-10-14 23:13:37,266 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-10-14 23:13:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,267 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-10-14 23:13:37,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-10-14 23:13:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,269 INFO L380 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-10-14 23:13:37,269 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-10-14 23:13:37,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056653403] [2019-10-14 23:13:37,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056653403] [2019-10-14 23:13:37,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79915180] [2019-10-14 23:13:37,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,292 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-10-14 23:13:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,336 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-10-14 23:13:37,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,347 INFO L225 Difference]: With dead ends: 1932 [2019-10-14 23:13:37,348 INFO L226 Difference]: Without dead ends: 1930 [2019-10-14 23:13:37,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-14 23:13:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-10-14 23:13:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-14 23:13:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-10-14 23:13:37,400 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-10-14 23:13:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,400 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-10-14 23:13:37,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-10-14 23:13:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,404 INFO L380 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-10-14 23:13:37,404 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-10-14 23:13:37,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835207293] [2019-10-14 23:13:37,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835207293] [2019-10-14 23:13:37,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619324499] [2019-10-14 23:13:37,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,427 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-10-14 23:13:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,477 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-10-14 23:13:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,488 INFO L225 Difference]: With dead ends: 3596 [2019-10-14 23:13:37,488 INFO L226 Difference]: Without dead ends: 2090 [2019-10-14 23:13:37,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-10-14 23:13:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-10-14 23:13:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-10-14 23:13:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-10-14 23:13:37,551 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-10-14 23:13:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,552 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-10-14 23:13:37,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-10-14 23:13:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:37,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,555 INFO L380 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-10-14 23:13:37,555 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-10-14 23:13:37,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004823656] [2019-10-14 23:13:37,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004823656] [2019-10-14 23:13:37,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554645391] [2019-10-14 23:13:37,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,583 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-10-14 23:13:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,629 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-10-14 23:13:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,640 INFO L225 Difference]: With dead ends: 3132 [2019-10-14 23:13:37,641 INFO L226 Difference]: Without dead ends: 2122 [2019-10-14 23:13:37,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-14 23:13:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-10-14 23:13:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-10-14 23:13:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-10-14 23:13:37,704 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-10-14 23:13:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,704 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-10-14 23:13:37,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-10-14 23:13:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:37,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,707 INFO L380 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-10-14 23:13:37,708 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-10-14 23:13:37,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51037787] [2019-10-14 23:13:37,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51037787] [2019-10-14 23:13:37,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245189826] [2019-10-14 23:13:37,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,732 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-10-14 23:13:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,811 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-10-14 23:13:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,829 INFO L225 Difference]: With dead ends: 3724 [2019-10-14 23:13:37,829 INFO L226 Difference]: Without dead ends: 3722 [2019-10-14 23:13:37,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-14 23:13:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-10-14 23:13:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-14 23:13:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-10-14 23:13:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-10-14 23:13:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,911 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-10-14 23:13:37,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-10-14 23:13:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:37,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,918 INFO L380 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-10-14 23:13:37,918 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-10-14 23:13:37,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225363722] [2019-10-14 23:13:37,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225363722] [2019-10-14 23:13:37,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541179319] [2019-10-14 23:13:37,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,940 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-10-14 23:13:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,003 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-10-14 23:13:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,022 INFO L225 Difference]: With dead ends: 7116 [2019-10-14 23:13:38,022 INFO L226 Difference]: Without dead ends: 4106 [2019-10-14 23:13:38,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-14 23:13:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-10-14 23:13:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-14 23:13:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-10-14 23:13:38,138 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-10-14 23:13:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,139 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-10-14 23:13:38,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-10-14 23:13:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,145 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-10-14 23:13:38,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65173437] [2019-10-14 23:13:38,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65173437] [2019-10-14 23:13:38,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822061394] [2019-10-14 23:13:38,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,166 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-10-14 23:13:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,261 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-10-14 23:13:38,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,280 INFO L225 Difference]: With dead ends: 6156 [2019-10-14 23:13:38,280 INFO L226 Difference]: Without dead ends: 4170 [2019-10-14 23:13:38,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-10-14 23:13:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-10-14 23:13:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-10-14 23:13:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-10-14 23:13:38,390 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-10-14 23:13:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,390 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-10-14 23:13:38,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-10-14 23:13:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,395 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,395 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-10-14 23:13:38,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577395755] [2019-10-14 23:13:38,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577395755] [2019-10-14 23:13:38,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231477307] [2019-10-14 23:13:38,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,416 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-10-14 23:13:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,513 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-10-14 23:13:38,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,533 INFO L225 Difference]: With dead ends: 12108 [2019-10-14 23:13:38,533 INFO L226 Difference]: Without dead ends: 8074 [2019-10-14 23:13:38,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-14 23:13:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-10-14 23:13:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-14 23:13:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-10-14 23:13:38,914 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-10-14 23:13:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,914 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-10-14 23:13:38,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-10-14 23:13:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,922 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,922 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-10-14 23:13:38,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26965046] [2019-10-14 23:13:38,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26965046] [2019-10-14 23:13:38,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532713640] [2019-10-14 23:13:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,946 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-10-14 23:13:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,050 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-10-14 23:13:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,069 INFO L225 Difference]: With dead ends: 9100 [2019-10-14 23:13:39,070 INFO L226 Difference]: Without dead ends: 9098 [2019-10-14 23:13:39,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-10-14 23:13:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-10-14 23:13:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-14 23:13:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-10-14 23:13:39,283 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-10-14 23:13:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,284 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-10-14 23:13:39,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-10-14 23:13:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:39,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:39,294 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-10-14 23:13:39,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942551770] [2019-10-14 23:13:39,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942551770] [2019-10-14 23:13:39,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305382] [2019-10-14 23:13:39,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,321 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-10-14 23:13:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,562 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-10-14 23:13:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,590 INFO L225 Difference]: With dead ends: 13708 [2019-10-14 23:13:39,591 INFO L226 Difference]: Without dead ends: 13706 [2019-10-14 23:13:39,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-10-14 23:13:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-10-14 23:13:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-10-14 23:13:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-10-14 23:13:39,832 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-10-14 23:13:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,832 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-10-14 23:13:39,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-10-14 23:13:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:39,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:39,847 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-10-14 23:13:39,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730123184] [2019-10-14 23:13:39,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730123184] [2019-10-14 23:13:39,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676438107] [2019-10-14 23:13:39,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,870 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-10-14 23:13:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,186 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-10-14 23:13:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,213 INFO L225 Difference]: With dead ends: 27788 [2019-10-14 23:13:40,213 INFO L226 Difference]: Without dead ends: 15754 [2019-10-14 23:13:40,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-10-14 23:13:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-10-14 23:13:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-10-14 23:13:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-10-14 23:13:40,539 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-10-14 23:13:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,539 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-10-14 23:13:40,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-10-14 23:13:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:40,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:40,556 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-10-14 23:13:40,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462077936] [2019-10-14 23:13:40,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462077936] [2019-10-14 23:13:40,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946951631] [2019-10-14 23:13:40,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,578 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-10-14 23:13:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,122 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-10-14 23:13:41,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,153 INFO L225 Difference]: With dead ends: 23820 [2019-10-14 23:13:41,154 INFO L226 Difference]: Without dead ends: 16138 [2019-10-14 23:13:41,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-10-14 23:13:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-10-14 23:13:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-10-14 23:13:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-10-14 23:13:41,439 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-10-14 23:13:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,439 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-10-14 23:13:41,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-10-14 23:13:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:41,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:41,457 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-10-14 23:13:41,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158898387] [2019-10-14 23:13:41,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158898387] [2019-10-14 23:13:41,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324661150] [2019-10-14 23:13:41,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,481 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-10-14 23:13:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,869 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-10-14 23:13:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,915 INFO L225 Difference]: With dead ends: 26636 [2019-10-14 23:13:41,915 INFO L226 Difference]: Without dead ends: 26634 [2019-10-14 23:13:41,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-10-14 23:13:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-10-14 23:13:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-10-14 23:13:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-10-14 23:13:42,453 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-10-14 23:13:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:42,453 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-10-14 23:13:42,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-10-14 23:13:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:42,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:42,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:42,491 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-10-14 23:13:42,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:42,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690433437] [2019-10-14 23:13:42,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:42,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690433437] [2019-10-14 23:13:42,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:42,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:42,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626312192] [2019-10-14 23:13:42,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:42,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,518 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-10-14 23:13:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:42,989 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-10-14 23:13:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:42,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:43,044 INFO L225 Difference]: With dead ends: 55308 [2019-10-14 23:13:43,045 INFO L226 Difference]: Without dead ends: 31242 [2019-10-14 23:13:43,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-10-14 23:13:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-10-14 23:13:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-10-14 23:13:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-10-14 23:13:43,669 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-10-14 23:13:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:43,669 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-10-14 23:13:43,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-10-14 23:13:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:43,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:43,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:43,720 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-10-14 23:13:43,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:43,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24306684] [2019-10-14 23:13:43,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:43,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24306684] [2019-10-14 23:13:43,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:43,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:43,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245160535] [2019-10-14 23:13:43,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:43,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,770 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-10-14 23:13:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:44,237 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-10-14 23:13:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:44,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:44,291 INFO L225 Difference]: With dead ends: 46860 [2019-10-14 23:13:44,291 INFO L226 Difference]: Without dead ends: 31754 [2019-10-14 23:13:44,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-10-14 23:13:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-10-14 23:13:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-10-14 23:13:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-10-14 23:13:45,075 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-10-14 23:13:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:45,076 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-10-14 23:13:45,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-10-14 23:13:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:45,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:45,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:45,100 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-10-14 23:13:45,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:45,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460749453] [2019-10-14 23:13:45,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:45,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460749453] [2019-10-14 23:13:45,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:45,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:45,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472075149] [2019-10-14 23:13:45,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:45,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,126 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-10-14 23:13:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:45,714 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-10-14 23:13:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:45,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:45,771 INFO L225 Difference]: With dead ends: 51210 [2019-10-14 23:13:45,771 INFO L226 Difference]: Without dead ends: 51208 [2019-10-14 23:13:45,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-10-14 23:13:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-10-14 23:13:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-10-14 23:13:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-10-14 23:13:47,616 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-10-14 23:13:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:47,616 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-10-14 23:13:47,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-10-14 23:13:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:47,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:47,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:47,653 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-10-14 23:13:47,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:47,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059060471] [2019-10-14 23:13:47,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:47,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059060471] [2019-10-14 23:13:47,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:47,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:47,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086686147] [2019-10-14 23:13:47,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:47,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:47,672 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-10-14 23:13:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,340 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-10-14 23:13:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,341 INFO L225 Difference]: With dead ends: 109576 [2019-10-14 23:13:48,341 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:48,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:48,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-14 23:13:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:48,430 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:48,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:48,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:48,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:48,458 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:48,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:48,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:48,458 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:48,458 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:48,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:48,458 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-14 23:13:48,459 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-14 23:13:48,459 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-14 23:13:48,459 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-14 23:13:48,459 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-14 23:13:48,460 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-14 23:13:48,460 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,460 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-14 23:13:48,461 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,462 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-14 23:13:48,462 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-14 23:13:48,462 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,462 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-14 23:13:48,464 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-14 23:13:48,465 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-14 23:13:48,466 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,466 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-14 23:13:48,466 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-14 23:13:48,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:48 BoogieIcfgContainer [2019-10-14 23:13:48,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:48,484 INFO L168 Benchmark]: Toolchain (without parser) took 14217.18 ms. Allocated memory was 138.4 MB in the beginning and 1.1 GB in the end (delta: 923.3 MB). Free memory was 103.4 MB in the beginning and 429.1 MB in the end (delta: -325.7 MB). Peak memory consumption was 597.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,485 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.76 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 92.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,486 INFO L168 Benchmark]: Boogie Preprocessor took 116.88 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 180.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,486 INFO L168 Benchmark]: RCFGBuilder took 387.89 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 160.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,487 INFO L168 Benchmark]: TraceAbstraction took 13422.81 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 859.3 MB). Free memory was 159.8 MB in the beginning and 429.1 MB in the end (delta: -269.3 MB). Peak memory consumption was 590.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:48,491 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.76 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 92.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.88 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.3 MB in the beginning and 180.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 387.89 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 160.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13422.81 ms. Allocated memory was 202.4 MB in the beginning and 1.1 GB in the end (delta: 859.3 MB). Free memory was 159.8 MB in the beginning and 429.1 MB in the end (delta: -269.3 MB). Peak memory consumption was 590.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 13.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...