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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:44,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:44,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:44,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:44,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:44,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:44,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:44,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:44,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:44,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:44,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:44,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:44,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:44,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:44,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:44,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:44,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:44,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:44,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:44,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:44,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:44,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:44,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:44,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:44,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:44,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:44,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:44,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:44,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:44,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:44,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:44,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:44,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:44,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:44,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:44,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:44,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:44,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:44,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:44,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:44,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:44,625 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-13 19:14:44,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:44,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:44,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:44,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:44,645 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:44,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:44,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:44,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:44,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:44,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:44,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:44,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:44,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:44,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:44,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:44,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:44,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:44,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:44,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:44,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:44,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:44,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:44,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:44,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:44,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:44,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:44,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:44,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:44,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:44,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:44,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:44,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:44,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:44,981 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:44,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-13 19:14:45,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36890af76/bd5e033f8835453d8fe17ecad9e92c20/FLAGfdc04f9da [2019-10-13 19:14:45,494 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:45,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-13 19:14:45,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36890af76/bd5e033f8835453d8fe17ecad9e92c20/FLAGfdc04f9da [2019-10-13 19:14:45,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36890af76/bd5e033f8835453d8fe17ecad9e92c20 [2019-10-13 19:14:45,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:45,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:45,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:45,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:45,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:45,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:45" (1/1) ... [2019-10-13 19:14:45,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:45, skipping insertion in model container [2019-10-13 19:14:45,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:45" (1/1) ... [2019-10-13 19:14:45,905 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:45,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:46,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:46,182 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:46,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:46,324 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:46,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46 WrapperNode [2019-10-13 19:14:46,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:46,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:46,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:46,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:46,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (1/1) ... [2019-10-13 19:14:46,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:46,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:46,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:46,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:46,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (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-13 19:14:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:46,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:46,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:46,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:46,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:46,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:46,866 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:46,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:46 BoogieIcfgContainer [2019-10-13 19:14:46,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:46,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:46,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:46,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:46,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:45" (1/3) ... [2019-10-13 19:14:46,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1018852f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:46, skipping insertion in model container [2019-10-13 19:14:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:46" (2/3) ... [2019-10-13 19:14:46,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1018852f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:46, skipping insertion in model container [2019-10-13 19:14:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:46" (3/3) ... [2019-10-13 19:14:46,875 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-10-13 19:14:46,885 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:46,893 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:46,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:46,929 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:46,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:46,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:46,930 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:46,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:46,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:46,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:46,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-10-13 19:14:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:46,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:46,956 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-13 19:14:46,958 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-10-13 19:14:46,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:46,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181410373] [2019-10-13 19:14:46,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:46,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:46,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:47,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181410373] [2019-10-13 19:14:47,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805667584] [2019-10-13 19:14:47,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,217 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-10-13 19:14:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:47,313 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-10-13 19:14:47,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:47,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:47,340 INFO L225 Difference]: With dead ends: 111 [2019-10-13 19:14:47,340 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 19:14:47,346 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-13 19:14:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 19:14:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-10-13 19:14:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:14:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-10-13 19:14:47,442 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-10-13 19:14:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,443 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-10-13 19:14:47,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-10-13 19:14:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:47,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,448 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-13 19:14:47,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-10-13 19:14:47,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854197561] [2019-10-13 19:14:47,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,592 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-13 19:14:47,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854197561] [2019-10-13 19:14:47,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256877328] [2019-10-13 19:14:47,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,599 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-10-13 19:14:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:47,655 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-10-13 19:14:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:47,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:47,659 INFO L225 Difference]: With dead ends: 157 [2019-10-13 19:14:47,659 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 19:14:47,663 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-13 19:14:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 19:14:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-13 19:14:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-13 19:14:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-10-13 19:14:47,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-10-13 19:14:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,689 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-10-13 19:14:47,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-10-13 19:14:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:47,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,692 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-13 19:14:47,693 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-10-13 19:14:47,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794674725] [2019-10-13 19:14:47,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,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-13 19:14:47,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794674725] [2019-10-13 19:14:47,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585736052] [2019-10-13 19:14:47,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,751 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-10-13 19:14:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:47,777 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-10-13 19:14:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:47,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:47,781 INFO L225 Difference]: With dead ends: 144 [2019-10-13 19:14:47,781 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 19:14:47,782 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-13 19:14:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 19:14:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-13 19:14:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-13 19:14:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-10-13 19:14:47,805 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-10-13 19:14:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,807 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-10-13 19:14:47,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-10-13 19:14:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:47,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,809 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-13 19:14:47,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-10-13 19:14:47,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871243224] [2019-10-13 19:14:47,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:47,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871243224] [2019-10-13 19:14:47,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314782110] [2019-10-13 19:14:47,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,892 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-10-13 19:14:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:47,927 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-10-13 19:14:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:47,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:47,930 INFO L225 Difference]: With dead ends: 184 [2019-10-13 19:14:47,930 INFO L226 Difference]: Without dead ends: 182 [2019-10-13 19:14:47,931 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-13 19:14:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-13 19:14:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-10-13 19:14:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-13 19:14:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-10-13 19:14:47,956 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-10-13 19:14:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,957 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-10-13 19:14:47,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-10-13 19:14:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:47,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,959 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-13 19:14:47,959 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-10-13 19:14:47,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714881096] [2019-10-13 19:14:47,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,055 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-13 19:14:48,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714881096] [2019-10-13 19:14:48,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254099307] [2019-10-13 19:14:48,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,059 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-10-13 19:14:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,089 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-10-13 19:14:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,092 INFO L225 Difference]: With dead ends: 304 [2019-10-13 19:14:48,092 INFO L226 Difference]: Without dead ends: 184 [2019-10-13 19:14:48,093 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-13 19:14:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-13 19:14:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-13 19:14:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 19:14:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-10-13 19:14:48,111 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-10-13 19:14:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,111 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-10-13 19:14:48,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-10-13 19:14:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:48,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,113 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-13 19:14:48,114 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-10-13 19:14:48,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804297016] [2019-10-13 19:14:48,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,190 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-13 19:14:48,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804297016] [2019-10-13 19:14:48,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291375203] [2019-10-13 19:14:48,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,194 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-10-13 19:14:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,213 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-10-13 19:14:48,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,217 INFO L225 Difference]: With dead ends: 273 [2019-10-13 19:14:48,218 INFO L226 Difference]: Without dead ends: 186 [2019-10-13 19:14:48,219 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-13 19:14:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-13 19:14:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-13 19:14:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-13 19:14:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-10-13 19:14:48,228 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-10-13 19:14:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,229 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-10-13 19:14:48,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-10-13 19:14:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:48,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,238 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-13 19:14:48,238 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-10-13 19:14:48,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174382782] [2019-10-13 19:14:48,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,284 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-13 19:14:48,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174382782] [2019-10-13 19:14:48,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126234126] [2019-10-13 19:14:48,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,286 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-10-13 19:14:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,324 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-10-13 19:14:48,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,329 INFO L225 Difference]: With dead ends: 348 [2019-10-13 19:14:48,329 INFO L226 Difference]: Without dead ends: 346 [2019-10-13 19:14:48,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-13 19:14:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-13 19:14:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-10-13 19:14:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 19:14:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-10-13 19:14:48,343 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-10-13 19:14:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,344 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-10-13 19:14:48,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-10-13 19:14:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:48,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,347 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-13 19:14:48,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-10-13 19:14:48,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758951916] [2019-10-13 19:14:48,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,374 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-13 19:14:48,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758951916] [2019-10-13 19:14:48,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51870852] [2019-10-13 19:14:48,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,376 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-10-13 19:14:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,400 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-10-13 19:14:48,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,403 INFO L225 Difference]: With dead ends: 592 [2019-10-13 19:14:48,403 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 19:14:48,404 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-13 19:14:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 19:14:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-13 19:14:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 19:14:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-10-13 19:14:48,428 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-10-13 19:14:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,428 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-10-13 19:14:48,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-10-13 19:14:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:48,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,430 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-13 19:14:48,430 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-10-13 19:14:48,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229387420] [2019-10-13 19:14:48,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,472 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-13 19:14:48,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229387420] [2019-10-13 19:14:48,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377287563] [2019-10-13 19:14:48,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,477 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-10-13 19:14:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,507 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-10-13 19:14:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,510 INFO L225 Difference]: With dead ends: 528 [2019-10-13 19:14:48,511 INFO L226 Difference]: Without dead ends: 358 [2019-10-13 19:14:48,512 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-13 19:14:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-13 19:14:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-13 19:14:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-13 19:14:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-10-13 19:14:48,527 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-10-13 19:14:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,529 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-10-13 19:14:48,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-10-13 19:14:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:48,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,534 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-13 19:14:48,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-10-13 19:14:48,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867006218] [2019-10-13 19:14:48,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,583 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-13 19:14:48,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867006218] [2019-10-13 19:14:48,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718367644] [2019-10-13 19:14:48,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,587 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-10-13 19:14:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,615 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-10-13 19:14:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,623 INFO L225 Difference]: With dead ends: 668 [2019-10-13 19:14:48,623 INFO L226 Difference]: Without dead ends: 666 [2019-10-13 19:14:48,624 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-13 19:14:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-13 19:14:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-10-13 19:14:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-13 19:14:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-10-13 19:14:48,641 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-10-13 19:14:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,641 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-10-13 19:14:48,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-10-13 19:14:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:48,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,643 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-13 19:14:48,643 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-10-13 19:14:48,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018193394] [2019-10-13 19:14:48,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,670 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-13 19:14:48,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018193394] [2019-10-13 19:14:48,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599234068] [2019-10-13 19:14:48,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,673 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-10-13 19:14:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,700 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-10-13 19:14:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,706 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 19:14:48,706 INFO L226 Difference]: Without dead ends: 690 [2019-10-13 19:14:48,708 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-13 19:14:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-13 19:14:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-10-13 19:14:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-13 19:14:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-10-13 19:14:48,733 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-10-13 19:14:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,734 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-10-13 19:14:48,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-10-13 19:14:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:48,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,736 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-13 19:14:48,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-10-13 19:14:48,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830750614] [2019-10-13 19:14:48,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,769 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-13 19:14:48,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830750614] [2019-10-13 19:14:48,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831361555] [2019-10-13 19:14:48,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,772 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-10-13 19:14:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,801 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-10-13 19:14:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,806 INFO L225 Difference]: With dead ends: 1032 [2019-10-13 19:14:48,806 INFO L226 Difference]: Without dead ends: 698 [2019-10-13 19:14:48,807 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-13 19:14:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-13 19:14:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-13 19:14:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-13 19:14:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-10-13 19:14:48,829 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-10-13 19:14:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,829 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-10-13 19:14:48,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-10-13 19:14:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:48,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,831 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-13 19:14:48,831 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-10-13 19:14:48,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997193057] [2019-10-13 19:14:48,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,874 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-13 19:14:48,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997193057] [2019-10-13 19:14:48,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012901821] [2019-10-13 19:14:48,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,880 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-10-13 19:14:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,914 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-10-13 19:14:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,923 INFO L225 Difference]: With dead ends: 1292 [2019-10-13 19:14:48,923 INFO L226 Difference]: Without dead ends: 1290 [2019-10-13 19:14:48,924 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-13 19:14:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-13 19:14:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-10-13 19:14:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-13 19:14:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-10-13 19:14:48,964 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-10-13 19:14:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,965 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-10-13 19:14:48,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-10-13 19:14:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:48,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,968 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-13 19:14:48,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-10-13 19:14:48,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100628186] [2019-10-13 19:14:48,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,003 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-13 19:14:49,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100628186] [2019-10-13 19:14:49,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863315063] [2019-10-13 19:14:49,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,006 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-10-13 19:14:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,042 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-10-13 19:14:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,063 INFO L225 Difference]: With dead ends: 2300 [2019-10-13 19:14:49,063 INFO L226 Difference]: Without dead ends: 1354 [2019-10-13 19:14:49,065 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-13 19:14:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-13 19:14:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-13 19:14:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-13 19:14:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-10-13 19:14:49,106 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-10-13 19:14:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,106 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-10-13 19:14:49,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-10-13 19:14:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:49,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,109 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-13 19:14:49,110 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-10-13 19:14:49,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47514823] [2019-10-13 19:14:49,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,139 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-13 19:14:49,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47514823] [2019-10-13 19:14:49,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318248615] [2019-10-13 19:14:49,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,141 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-10-13 19:14:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,177 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-10-13 19:14:49,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,186 INFO L225 Difference]: With dead ends: 2028 [2019-10-13 19:14:49,186 INFO L226 Difference]: Without dead ends: 1370 [2019-10-13 19:14:49,190 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-13 19:14:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-10-13 19:14:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-10-13 19:14:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-10-13 19:14:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-10-13 19:14:49,229 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-10-13 19:14:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,229 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-10-13 19:14:49,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-10-13 19:14:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:49,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,232 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-13 19:14:49,232 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-10-13 19:14:49,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124018305] [2019-10-13 19:14:49,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,258 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-13 19:14:49,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124018305] [2019-10-13 19:14:49,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976378425] [2019-10-13 19:14:49,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,261 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-10-13 19:14:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,309 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-10-13 19:14:49,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,322 INFO L225 Difference]: With dead ends: 2508 [2019-10-13 19:14:49,322 INFO L226 Difference]: Without dead ends: 2506 [2019-10-13 19:14:49,324 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-13 19:14:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-13 19:14:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-10-13 19:14:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-13 19:14:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-10-13 19:14:49,382 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-10-13 19:14:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,383 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-10-13 19:14:49,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-10-13 19:14:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:49,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,386 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-13 19:14:49,386 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-10-13 19:14:49,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575106610] [2019-10-13 19:14:49,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,413 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-13 19:14:49,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575106610] [2019-10-13 19:14:49,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757874800] [2019-10-13 19:14:49,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,415 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-10-13 19:14:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,464 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-10-13 19:14:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,478 INFO L225 Difference]: With dead ends: 4556 [2019-10-13 19:14:49,478 INFO L226 Difference]: Without dead ends: 2666 [2019-10-13 19:14:49,482 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-13 19:14:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-10-13 19:14:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-10-13 19:14:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-10-13 19:14:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-10-13 19:14:49,553 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-10-13 19:14:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,553 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-10-13 19:14:49,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-10-13 19:14:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:49,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,557 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-13 19:14:49,558 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-10-13 19:14:49,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595268310] [2019-10-13 19:14:49,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,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-13 19:14:49,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595268310] [2019-10-13 19:14:49,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836074181] [2019-10-13 19:14:49,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,583 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-10-13 19:14:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,648 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-10-13 19:14:49,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,660 INFO L225 Difference]: With dead ends: 3996 [2019-10-13 19:14:49,660 INFO L226 Difference]: Without dead ends: 2698 [2019-10-13 19:14:49,663 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-13 19:14:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-13 19:14:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-10-13 19:14:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-10-13 19:14:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-10-13 19:14:49,726 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-10-13 19:14:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,727 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-10-13 19:14:49,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-10-13 19:14:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:49,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,730 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-13 19:14:49,731 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-10-13 19:14:49,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872909822] [2019-10-13 19:14:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,755 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-13 19:14:49,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872909822] [2019-10-13 19:14:49,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325462975] [2019-10-13 19:14:49,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,757 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-10-13 19:14:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,811 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-10-13 19:14:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:49,835 INFO L225 Difference]: With dead ends: 4876 [2019-10-13 19:14:49,835 INFO L226 Difference]: Without dead ends: 4874 [2019-10-13 19:14:49,837 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-13 19:14:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-13 19:14:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-10-13 19:14:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-10-13 19:14:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-10-13 19:14:49,937 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-10-13 19:14:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,938 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-10-13 19:14:49,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-10-13 19:14:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:49,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,945 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-13 19:14:49,945 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-10-13 19:14:49,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73070589] [2019-10-13 19:14:49,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,971 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-13 19:14:49,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73070589] [2019-10-13 19:14:49,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47490947] [2019-10-13 19:14:49,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,974 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-10-13 19:14:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:50,054 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-10-13 19:14:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:50,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:50,092 INFO L225 Difference]: With dead ends: 9036 [2019-10-13 19:14:50,092 INFO L226 Difference]: Without dead ends: 5258 [2019-10-13 19:14:50,137 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-13 19:14:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-13 19:14:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-10-13 19:14:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-10-13 19:14:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-10-13 19:14:50,266 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-10-13 19:14:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:50,267 INFO L462 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-10-13 19:14:50,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-10-13 19:14:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:50,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:50,273 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-13 19:14:50,274 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-10-13 19:14:50,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:50,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328916452] [2019-10-13 19:14:50,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,305 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-13 19:14:50,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328916452] [2019-10-13 19:14:50,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:50,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:50,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979212104] [2019-10-13 19:14:50,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:50,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:50,311 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-10-13 19:14:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:50,380 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-10-13 19:14:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:50,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:50,393 INFO L225 Difference]: With dead ends: 7884 [2019-10-13 19:14:50,394 INFO L226 Difference]: Without dead ends: 5322 [2019-10-13 19:14:50,400 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-13 19:14:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-10-13 19:14:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-10-13 19:14:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-10-13 19:14:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-10-13 19:14:50,513 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-10-13 19:14:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:50,514 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-10-13 19:14:50,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-10-13 19:14:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:50,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:50,521 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-13 19:14:50,521 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-10-13 19:14:50,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:50,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291094208] [2019-10-13 19:14:50,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,550 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-13 19:14:50,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291094208] [2019-10-13 19:14:50,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:50,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:50,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254714103] [2019-10-13 19:14:50,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:50,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:50,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:50,553 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-10-13 19:14:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:50,740 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-10-13 19:14:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:50,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:50,763 INFO L225 Difference]: With dead ends: 15564 [2019-10-13 19:14:50,763 INFO L226 Difference]: Without dead ends: 10378 [2019-10-13 19:14:50,774 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-13 19:14:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-13 19:14:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-10-13 19:14:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-13 19:14:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-10-13 19:14:50,978 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-10-13 19:14:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:50,978 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-10-13 19:14:50,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-10-13 19:14:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:50,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:50,990 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-13 19:14:50,991 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-10-13 19:14:50,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:50,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077714030] [2019-10-13 19:14:50,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:51,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077714030] [2019-10-13 19:14:51,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:51,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:51,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627584552] [2019-10-13 19:14:51,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:51,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:51,014 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-10-13 19:14:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:51,147 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-10-13 19:14:51,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:51,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:51,252 INFO L225 Difference]: With dead ends: 12172 [2019-10-13 19:14:51,253 INFO L226 Difference]: Without dead ends: 12170 [2019-10-13 19:14:51,256 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-13 19:14:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-13 19:14:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-10-13 19:14:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-13 19:14:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-10-13 19:14:51,561 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-10-13 19:14:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:51,562 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-10-13 19:14:51,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-10-13 19:14:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:51,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:51,577 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, 1] [2019-10-13 19:14:51,578 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-10-13 19:14:51,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:51,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047511928] [2019-10-13 19:14:51,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:51,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:51,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:51,602 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-13 19:14:51,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047511928] [2019-10-13 19:14:51,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:51,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:51,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474557103] [2019-10-13 19:14:51,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:51,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:51,604 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-10-13 19:14:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:51,787 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-10-13 19:14:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:51,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:51,826 INFO L225 Difference]: With dead ends: 18316 [2019-10-13 19:14:51,826 INFO L226 Difference]: Without dead ends: 18314 [2019-10-13 19:14:51,836 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-13 19:14:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-10-13 19:14:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-10-13 19:14:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-10-13 19:14:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-10-13 19:14:52,301 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-10-13 19:14:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,302 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-10-13 19:14:52,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-10-13 19:14:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:52,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,333 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, 1] [2019-10-13 19:14:52,333 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-10-13 19:14:52,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686782223] [2019-10-13 19:14:52,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,361 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-13 19:14:52,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686782223] [2019-10-13 19:14:52,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954076920] [2019-10-13 19:14:52,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,364 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-10-13 19:14:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,665 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-10-13 19:14:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,227 INFO L225 Difference]: With dead ends: 35468 [2019-10-13 19:14:53,227 INFO L226 Difference]: Without dead ends: 20362 [2019-10-13 19:14:53,249 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-13 19:14:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-10-13 19:14:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-10-13 19:14:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-10-13 19:14:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-10-13 19:14:53,754 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-10-13 19:14:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,755 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-10-13 19:14:53,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-10-13 19:14:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:53,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,791 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, 1, 1] [2019-10-13 19:14:53,791 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-10-13 19:14:53,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672907606] [2019-10-13 19:14:53,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,827 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-13 19:14:53,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672907606] [2019-10-13 19:14:53,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460629558] [2019-10-13 19:14:53,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,832 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-10-13 19:14:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,302 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-10-13 19:14:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,340 INFO L225 Difference]: With dead ends: 30732 [2019-10-13 19:14:54,341 INFO L226 Difference]: Without dead ends: 20746 [2019-10-13 19:14:54,358 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-13 19:14:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-10-13 19:14:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-10-13 19:14:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-10-13 19:14:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-10-13 19:14:54,730 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-10-13 19:14:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,731 INFO L462 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-10-13 19:14:54,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-10-13 19:14:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:54,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,755 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, 1, 1] [2019-10-13 19:14:54,755 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-10-13 19:14:54,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499745004] [2019-10-13 19:14:54,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,780 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-13 19:14:54,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499745004] [2019-10-13 19:14:54,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641194650] [2019-10-13 19:14:54,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,781 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-10-13 19:14:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,181 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-10-13 19:14:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,250 INFO L225 Difference]: With dead ends: 35852 [2019-10-13 19:14:55,250 INFO L226 Difference]: Without dead ends: 35850 [2019-10-13 19:14:55,258 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-13 19:14:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-10-13 19:14:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-10-13 19:14:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-10-13 19:14:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-10-13 19:14:55,791 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-10-13 19:14:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,791 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-10-13 19:14:55,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-10-13 19:14:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:55,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,968 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, 1, 1] [2019-10-13 19:14:55,968 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-10-13 19:14:55,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730109718] [2019-10-13 19:14:55,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,999 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-13 19:14:55,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730109718] [2019-10-13 19:14:56,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555190691] [2019-10-13 19:14:56,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,001 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-10-13 19:14:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,451 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-10-13 19:14:56,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,536 INFO L225 Difference]: With dead ends: 70668 [2019-10-13 19:14:56,537 INFO L226 Difference]: Without dead ends: 40458 [2019-10-13 19:14:56,591 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-13 19:14:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-10-13 19:14:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-10-13 19:14:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-10-13 19:14:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-10-13 19:14:57,418 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-10-13 19:14:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,418 INFO L462 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-10-13 19:14:57,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-10-13 19:14:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:57,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,460 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, 1, 1, 1] [2019-10-13 19:14:57,460 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-10-13 19:14:57,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56241965] [2019-10-13 19:14:57,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,491 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-13 19:14:57,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56241965] [2019-10-13 19:14:57,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373380046] [2019-10-13 19:14:57,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,494 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-10-13 19:14:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,993 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-10-13 19:14:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:14:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:58,073 INFO L225 Difference]: With dead ends: 60684 [2019-10-13 19:14:58,073 INFO L226 Difference]: Without dead ends: 40970 [2019-10-13 19:14:58,110 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-13 19:14:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-10-13 19:14:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-10-13 19:14:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-10-13 19:14:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-10-13 19:14:59,025 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-10-13 19:14:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:59,025 INFO L462 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-10-13 19:14:59,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-10-13 19:14:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:59,058 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:59,058 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, 1, 1, 1] [2019-10-13 19:14:59,058 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-10-13 19:14:59,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:59,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113236016] [2019-10-13 19:14:59,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,080 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-13 19:14:59,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113236016] [2019-10-13 19:14:59,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:59,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:59,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863065812] [2019-10-13 19:14:59,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:59,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:59,082 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-10-13 19:14:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:59,625 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-10-13 19:14:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:59,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:14:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:00,675 INFO L225 Difference]: With dead ends: 69644 [2019-10-13 19:15:00,676 INFO L226 Difference]: Without dead ends: 69642 [2019-10-13 19:15:00,689 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-13 19:15:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-10-13 19:15:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-10-13 19:15:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-10-13 19:15:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-10-13 19:15:01,674 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-10-13 19:15:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:01,674 INFO L462 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-10-13 19:15:01,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-10-13 19:15:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:15:01,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:01,715 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, 1, 1, 1] [2019-10-13 19:15:01,716 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-10-13 19:15:01,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:01,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574623212] [2019-10-13 19:15:01,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:01,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:01,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:01,737 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-13 19:15:01,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574623212] [2019-10-13 19:15:01,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:01,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:01,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633433565] [2019-10-13 19:15:01,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:01,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:01,739 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-10-13 19:15:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:02,501 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-10-13 19:15:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:02,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:15:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:02,586 INFO L225 Difference]: With dead ends: 140300 [2019-10-13 19:15:02,586 INFO L226 Difference]: Without dead ends: 79882 [2019-10-13 19:15:02,649 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-13 19:15:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-10-13 19:15:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-10-13 19:15:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-10-13 19:15:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-10-13 19:15:05,012 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-10-13 19:15:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:05,012 INFO L462 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-10-13 19:15:05,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-10-13 19:15:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:05,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:05,048 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, 1, 1, 1, 1] [2019-10-13 19:15:05,048 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-10-13 19:15:05,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:05,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320639710] [2019-10-13 19:15:05,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:05,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:15:05,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320639710] [2019-10-13 19:15:05,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:05,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:05,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341101056] [2019-10-13 19:15:05,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:05,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:05,085 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-10-13 19:15:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:05,543 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-10-13 19:15:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:05,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:05,624 INFO L225 Difference]: With dead ends: 119820 [2019-10-13 19:15:05,625 INFO L226 Difference]: Without dead ends: 80906 [2019-10-13 19:15:05,680 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-13 19:15:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-10-13 19:15:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-10-13 19:15:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-10-13 19:15:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-10-13 19:15:06,929 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-10-13 19:15:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:06,929 INFO L462 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-10-13 19:15:06,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-10-13 19:15:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:06,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:06,960 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, 1, 1, 1, 1] [2019-10-13 19:15:06,960 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-10-13 19:15:06,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:06,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870714610] [2019-10-13 19:15:06,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:06,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:06,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:06,978 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-13 19:15:06,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870714610] [2019-10-13 19:15:06,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:06,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:06,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746214778] [2019-10-13 19:15:06,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:06,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:06,980 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-10-13 19:15:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:09,319 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-10-13 19:15:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:09,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:09,429 INFO L225 Difference]: With dead ends: 135180 [2019-10-13 19:15:09,429 INFO L226 Difference]: Without dead ends: 135178 [2019-10-13 19:15:09,447 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-13 19:15:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-10-13 19:15:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-10-13 19:15:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-10-13 19:15:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-10-13 19:15:10,854 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-10-13 19:15:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:10,854 INFO L462 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-10-13 19:15:10,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-10-13 19:15:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:10,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:10,901 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, 1, 1, 1, 1] [2019-10-13 19:15:10,901 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-10-13 19:15:10,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:10,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802469888] [2019-10-13 19:15:10,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:10,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:10,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:10,917 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-13 19:15:10,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802469888] [2019-10-13 19:15:10,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:10,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:10,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966074418] [2019-10-13 19:15:10,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:10,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:10,919 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-10-13 19:15:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:12,469 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-10-13 19:15:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:12,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:12,608 INFO L225 Difference]: With dead ends: 278540 [2019-10-13 19:15:12,608 INFO L226 Difference]: Without dead ends: 157706 [2019-10-13 19:15:12,670 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-13 19:15:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-10-13 19:15:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-10-13 19:15:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-10-13 19:15:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-10-13 19:15:17,444 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-10-13 19:15:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-10-13 19:15:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-10-13 19:15:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:15:17,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:17,517 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, 1, 1, 1, 1, 1] [2019-10-13 19:15:17,517 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-10-13 19:15:17,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:17,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171940779] [2019-10-13 19:15:17,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:17,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:17,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:17,544 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-13 19:15:17,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171940779] [2019-10-13 19:15:17,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:17,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:17,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784427678] [2019-10-13 19:15:17,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:17,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:17,546 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states.