/usr/bin/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-fb55353 [2019-11-06 21:19:43,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:19:43,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:19:43,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:19:43,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:19:43,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:19:43,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:19:43,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:19:43,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:19:43,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:19:43,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:19:43,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:19:43,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:19:43,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:19:43,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:19:43,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:19:43,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:19:43,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:19:43,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:19:43,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:19:43,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:19:43,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:19:43,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:19:43,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:19:43,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:19:43,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:19:43,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:19:43,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:19:43,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:19:43,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:19:43,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:19:43,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:19:43,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:19:43,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:19:43,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:19:43,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:19:43,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:19:43,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:19:43,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:19:43,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:19:43,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:19:43,619 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-11-06 21:19:43,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:19:43,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:19:43,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:19:43,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:19:43,648 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:19:43,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:19:43,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:19:43,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:19:43,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:19:43,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:19:43,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:19:43,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:19:43,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:19:43,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:19:43,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:19:43,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:19:43,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:19:43,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:19:43,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:19:43,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:19:43,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:19:43,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:19:43,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:19:43,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:19:43,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:19:43,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:19:43,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:19:43,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:19:43,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:19:43,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:19:43,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:19:43,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:19:43,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:19:43,968 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:19:43,969 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-11-06 21:19:44,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0bebeec/f5332c80de024d81a6df259dfa8d79da/FLAGf57f40eeb [2019-11-06 21:19:44,533 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:19:44,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-06 21:19:44,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0bebeec/f5332c80de024d81a6df259dfa8d79da/FLAGf57f40eeb [2019-11-06 21:19:44,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0bebeec/f5332c80de024d81a6df259dfa8d79da [2019-11-06 21:19:44,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:19:44,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:19:44,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:44,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:19:44,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:19:44,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:44" (1/1) ... [2019-11-06 21:19:44,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ce2aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:44, skipping insertion in model container [2019-11-06 21:19:44,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:44" (1/1) ... [2019-11-06 21:19:44,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:19:45,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:19:45,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:45,296 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:19:45,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:45,442 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:19:45,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45 WrapperNode [2019-11-06 21:19:45,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:45,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:19:45,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:19:45,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:19:45,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (1/1) ... [2019-11-06 21:19:45,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:19:45,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:19:45,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:19:45,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:19:45,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (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-11-06 21:19:45,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:19:45,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:19:45,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:19:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:19:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:19:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:19:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:19:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:19:45,973 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:19:45,973 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:19:45,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:45 BoogieIcfgContainer [2019-11-06 21:19:45,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:19:45,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:19:45,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:19:45,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:19:45,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:19:44" (1/3) ... [2019-11-06 21:19:45,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a4e6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:45, skipping insertion in model container [2019-11-06 21:19:45,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:45" (2/3) ... [2019-11-06 21:19:45,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a4e6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:45, skipping insertion in model container [2019-11-06 21:19:45,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:45" (3/3) ... [2019-11-06 21:19:45,984 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-06 21:19:45,994 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:19:46,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:19:46,014 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:19:46,040 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:19:46,040 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:19:46,040 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:19:46,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:19:46,041 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:19:46,041 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:19:46,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:19:46,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:19:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-11-06 21:19:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:46,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,069 INFO L410 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-11-06 21:19:46,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-11-06 21:19:46,086 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,086 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528999061] [2019-11-06 21:19:46,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:46,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528999061] [2019-11-06 21:19:46,318 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,318 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828037877] [2019-11-06 21:19:46,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,324 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,341 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-11-06 21:19:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,413 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-11-06 21:19:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,428 INFO L225 Difference]: With dead ends: 111 [2019-11-06 21:19:46,429 INFO L226 Difference]: Without dead ends: 96 [2019-11-06 21:19:46,432 INFO L630 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-11-06 21:19:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-06 21:19:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-11-06 21:19:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 21:19:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-06 21:19:46,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-11-06 21:19:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,483 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-06 21:19:46,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-06 21:19:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:46,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,485 INFO L410 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-11-06 21:19:46,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-11-06 21:19:46,486 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,486 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684600274] [2019-11-06 21:19:46,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:46,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684600274] [2019-11-06 21:19:46,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332768348] [2019-11-06 21:19:46,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,581 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,582 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-06 21:19:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,622 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-11-06 21:19:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,625 INFO L225 Difference]: With dead ends: 157 [2019-11-06 21:19:46,625 INFO L226 Difference]: Without dead ends: 96 [2019-11-06 21:19:46,627 INFO L630 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-11-06 21:19:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-06 21:19:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-06 21:19:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 21:19:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-11-06 21:19:46,641 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-11-06 21:19:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,642 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-11-06 21:19:46,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-11-06 21:19:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:46,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,643 INFO L410 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-11-06 21:19:46,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-11-06 21:19:46,644 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,645 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927682098] [2019-11-06 21:19:46,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:46,703 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927682098] [2019-11-06 21:19:46,703 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,703 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501117623] [2019-11-06 21:19:46,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,705 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,706 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-11-06 21:19:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,753 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-11-06 21:19:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,755 INFO L225 Difference]: With dead ends: 144 [2019-11-06 21:19:46,755 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 21:19:46,761 INFO L630 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-11-06 21:19:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 21:19:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-06 21:19:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-06 21:19:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-11-06 21:19:46,780 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-11-06 21:19:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,781 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-11-06 21:19:46,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-11-06 21:19:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:46,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,782 INFO L410 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-11-06 21:19:46,783 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-11-06 21:19:46,786 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839080129] [2019-11-06 21:19:46,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:46,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839080129] [2019-11-06 21:19:46,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583318755] [2019-11-06 21:19:46,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,851 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-11-06 21:19:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,883 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-11-06 21:19:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,886 INFO L225 Difference]: With dead ends: 184 [2019-11-06 21:19:46,886 INFO L226 Difference]: Without dead ends: 182 [2019-11-06 21:19:46,887 INFO L630 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-11-06 21:19:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-06 21:19:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-11-06 21:19:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-06 21:19:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-11-06 21:19:46,902 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-11-06 21:19:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,903 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-11-06 21:19:46,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-11-06 21:19:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:46,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,905 INFO L410 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-11-06 21:19:46,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-11-06 21:19:46,906 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,906 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099205959] [2019-11-06 21:19:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:46,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099205959] [2019-11-06 21:19:46,954 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,954 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503885376] [2019-11-06 21:19:46,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,955 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,956 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-11-06 21:19:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,993 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-11-06 21:19:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,995 INFO L225 Difference]: With dead ends: 304 [2019-11-06 21:19:46,995 INFO L226 Difference]: Without dead ends: 184 [2019-11-06 21:19:46,997 INFO L630 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-11-06 21:19:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-06 21:19:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-11-06 21:19:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-06 21:19:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-11-06 21:19:47,010 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-11-06 21:19:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,011 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-11-06 21:19:47,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-11-06 21:19:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:47,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,013 INFO L410 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-11-06 21:19:47,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-11-06 21:19:47,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028687407] [2019-11-06 21:19:47,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,093 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028687407] [2019-11-06 21:19:47,093 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576465948] [2019-11-06 21:19:47,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,095 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-11-06 21:19:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,112 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-11-06 21:19:47,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,114 INFO L225 Difference]: With dead ends: 273 [2019-11-06 21:19:47,114 INFO L226 Difference]: Without dead ends: 186 [2019-11-06 21:19:47,115 INFO L630 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-11-06 21:19:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-06 21:19:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-11-06 21:19:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-06 21:19:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-11-06 21:19:47,126 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-11-06 21:19:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,126 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-11-06 21:19:47,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-11-06 21:19:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:47,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,128 INFO L410 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-11-06 21:19:47,128 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-11-06 21:19:47,129 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,129 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433741759] [2019-11-06 21:19:47,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433741759] [2019-11-06 21:19:47,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843013873] [2019-11-06 21:19:47,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,172 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,173 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-11-06 21:19:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,223 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-11-06 21:19:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,226 INFO L225 Difference]: With dead ends: 348 [2019-11-06 21:19:47,226 INFO L226 Difference]: Without dead ends: 346 [2019-11-06 21:19:47,227 INFO L630 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-11-06 21:19:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-06 21:19:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-11-06 21:19:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-06 21:19:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-11-06 21:19:47,248 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-11-06 21:19:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,248 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-11-06 21:19:47,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-11-06 21:19:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:47,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,258 INFO L410 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-11-06 21:19:47,260 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,260 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-11-06 21:19:47,260 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,261 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122599145] [2019-11-06 21:19:47,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,307 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122599145] [2019-11-06 21:19:47,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133382725] [2019-11-06 21:19:47,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,312 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-11-06 21:19:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,348 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-11-06 21:19:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,352 INFO L225 Difference]: With dead ends: 592 [2019-11-06 21:19:47,352 INFO L226 Difference]: Without dead ends: 354 [2019-11-06 21:19:47,356 INFO L630 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-11-06 21:19:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-06 21:19:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-11-06 21:19:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-06 21:19:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-11-06 21:19:47,382 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-11-06 21:19:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-11-06 21:19:47,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-11-06 21:19:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:47,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,384 INFO L410 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-11-06 21:19:47,385 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-11-06 21:19:47,385 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,386 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364623591] [2019-11-06 21:19:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364623591] [2019-11-06 21:19:47,441 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,441 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754417532] [2019-11-06 21:19:47,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,445 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-11-06 21:19:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,472 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-11-06 21:19:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,476 INFO L225 Difference]: With dead ends: 528 [2019-11-06 21:19:47,476 INFO L226 Difference]: Without dead ends: 358 [2019-11-06 21:19:47,477 INFO L630 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-11-06 21:19:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-06 21:19:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-06 21:19:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-06 21:19:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-11-06 21:19:47,492 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-11-06 21:19:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,494 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-11-06 21:19:47,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-11-06 21:19:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:47,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,498 INFO L410 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-11-06 21:19:47,498 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-11-06 21:19:47,499 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,499 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366014111] [2019-11-06 21:19:47,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,538 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366014111] [2019-11-06 21:19:47,541 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920645536] [2019-11-06 21:19:47,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,542 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,543 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-11-06 21:19:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,579 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-11-06 21:19:47,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,586 INFO L225 Difference]: With dead ends: 668 [2019-11-06 21:19:47,586 INFO L226 Difference]: Without dead ends: 666 [2019-11-06 21:19:47,589 INFO L630 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-11-06 21:19:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-06 21:19:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-11-06 21:19:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-06 21:19:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-11-06 21:19:47,608 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-11-06 21:19:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,609 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-11-06 21:19:47,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-11-06 21:19:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:47,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,612 INFO L410 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-11-06 21:19:47,613 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-11-06 21:19:47,614 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,614 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561190926] [2019-11-06 21:19:47,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561190926] [2019-11-06 21:19:47,659 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185522248] [2019-11-06 21:19:47,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,662 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,663 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-11-06 21:19:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,705 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-11-06 21:19:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,711 INFO L225 Difference]: With dead ends: 1164 [2019-11-06 21:19:47,711 INFO L226 Difference]: Without dead ends: 690 [2019-11-06 21:19:47,713 INFO L630 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-11-06 21:19:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-06 21:19:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-11-06 21:19:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-11-06 21:19:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-11-06 21:19:47,741 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-11-06 21:19:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,741 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-11-06 21:19:47,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-11-06 21:19:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:47,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,743 INFO L410 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-11-06 21:19:47,743 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-11-06 21:19:47,744 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28589852] [2019-11-06 21:19:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,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-11-06 21:19:47,781 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28589852] [2019-11-06 21:19:47,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,781 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182779276] [2019-11-06 21:19:47,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,783 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-11-06 21:19:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,808 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-11-06 21:19:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,812 INFO L225 Difference]: With dead ends: 1032 [2019-11-06 21:19:47,812 INFO L226 Difference]: Without dead ends: 698 [2019-11-06 21:19:47,814 INFO L630 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-11-06 21:19:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-06 21:19:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-11-06 21:19:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-06 21:19:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-11-06 21:19:47,834 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-11-06 21:19:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,835 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-11-06 21:19:47,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-11-06 21:19:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:47,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,837 INFO L410 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-11-06 21:19:47,837 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-11-06 21:19:47,838 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,838 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37053883] [2019-11-06 21:19:47,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,870 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37053883] [2019-11-06 21:19:47,870 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,870 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919346723] [2019-11-06 21:19:47,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,871 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:47,872 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-11-06 21:19:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,906 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-11-06 21:19:47,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,913 INFO L225 Difference]: With dead ends: 1292 [2019-11-06 21:19:47,914 INFO L226 Difference]: Without dead ends: 1290 [2019-11-06 21:19:47,915 INFO L630 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-11-06 21:19:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-06 21:19:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-11-06 21:19:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-06 21:19:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-11-06 21:19:47,952 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-11-06 21:19:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,955 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-11-06 21:19:47,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-11-06 21:19:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:47,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:47,960 INFO L410 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-11-06 21:19:47,961 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-11-06 21:19:47,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:47,962 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175988106] [2019-11-06 21:19:47,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:47,998 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175988106] [2019-11-06 21:19:47,998 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:47,998 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:47,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989691853] [2019-11-06 21:19:47,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:47,999 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,000 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-11-06 21:19:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,042 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-11-06 21:19:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,075 INFO L225 Difference]: With dead ends: 2300 [2019-11-06 21:19:48,076 INFO L226 Difference]: Without dead ends: 1354 [2019-11-06 21:19:48,080 INFO L630 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-11-06 21:19:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-06 21:19:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-11-06 21:19:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-06 21:19:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-11-06 21:19:48,125 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-11-06 21:19:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,125 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-11-06 21:19:48,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-11-06 21:19:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:48,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,129 INFO L410 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-11-06 21:19:48,130 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-11-06 21:19:48,130 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383844115] [2019-11-06 21:19:48,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:48,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383844115] [2019-11-06 21:19:48,161 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,161 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886583192] [2019-11-06 21:19:48,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,162 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,163 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-11-06 21:19:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,201 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-11-06 21:19:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,209 INFO L225 Difference]: With dead ends: 2028 [2019-11-06 21:19:48,209 INFO L226 Difference]: Without dead ends: 1370 [2019-11-06 21:19:48,213 INFO L630 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-11-06 21:19:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-11-06 21:19:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-11-06 21:19:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-11-06 21:19:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-11-06 21:19:48,254 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-11-06 21:19:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,255 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-11-06 21:19:48,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-11-06 21:19:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:48,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,257 INFO L410 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-11-06 21:19:48,257 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-11-06 21:19:48,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,258 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183017091] [2019-11-06 21:19:48,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:48,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183017091] [2019-11-06 21:19:48,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588636186] [2019-11-06 21:19:48,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,281 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,283 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-11-06 21:19:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,323 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-11-06 21:19:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,338 INFO L225 Difference]: With dead ends: 2508 [2019-11-06 21:19:48,339 INFO L226 Difference]: Without dead ends: 2506 [2019-11-06 21:19:48,340 INFO L630 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-11-06 21:19:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-06 21:19:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-11-06 21:19:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-11-06 21:19:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-11-06 21:19:48,403 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-11-06 21:19:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,403 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-11-06 21:19:48,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-11-06 21:19:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:48,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,407 INFO L410 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-11-06 21:19:48,407 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-11-06 21:19:48,408 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,408 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344772149] [2019-11-06 21:19:48,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:48,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344772149] [2019-11-06 21:19:48,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,443 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832248293] [2019-11-06 21:19:48,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,443 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,445 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-11-06 21:19:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,498 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-11-06 21:19:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,512 INFO L225 Difference]: With dead ends: 4556 [2019-11-06 21:19:48,512 INFO L226 Difference]: Without dead ends: 2666 [2019-11-06 21:19:48,517 INFO L630 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-11-06 21:19:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-11-06 21:19:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-11-06 21:19:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-11-06 21:19:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-11-06 21:19:48,597 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-11-06 21:19:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,597 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-11-06 21:19:48,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-11-06 21:19:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:48,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,601 INFO L410 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-11-06 21:19:48,602 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-11-06 21:19:48,603 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,603 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358361526] [2019-11-06 21:19:48,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:48,626 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358361526] [2019-11-06 21:19:48,626 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,626 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765415040] [2019-11-06 21:19:48,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,627 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,628 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-11-06 21:19:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,698 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-11-06 21:19:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,712 INFO L225 Difference]: With dead ends: 3996 [2019-11-06 21:19:48,712 INFO L226 Difference]: Without dead ends: 2698 [2019-11-06 21:19:48,715 INFO L630 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-11-06 21:19:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-11-06 21:19:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-11-06 21:19:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-11-06 21:19:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-11-06 21:19:48,783 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-11-06 21:19:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,784 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-11-06 21:19:48,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-11-06 21:19:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:48,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,788 INFO L410 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-11-06 21:19:48,788 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-11-06 21:19:48,789 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,789 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621320258] [2019-11-06 21:19:48,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:48,809 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621320258] [2019-11-06 21:19:48,809 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,809 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438291043] [2019-11-06 21:19:48,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,810 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,810 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-11-06 21:19:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,866 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-11-06 21:19:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,890 INFO L225 Difference]: With dead ends: 4876 [2019-11-06 21:19:48,891 INFO L226 Difference]: Without dead ends: 4874 [2019-11-06 21:19:48,893 INFO L630 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-11-06 21:19:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-11-06 21:19:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-11-06 21:19:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-11-06 21:19:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-11-06 21:19:48,997 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-11-06 21:19:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,998 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-11-06 21:19:48,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-11-06 21:19:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:49,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:49,004 INFO L410 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-11-06 21:19:49,005 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-11-06 21:19:49,005 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:49,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734809182] [2019-11-06 21:19:49,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:49,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734809182] [2019-11-06 21:19:49,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:49,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:49,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036066048] [2019-11-06 21:19:49,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:49,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:49,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:49,033 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-11-06 21:19:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:49,141 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-11-06 21:19:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:49,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:49,166 INFO L225 Difference]: With dead ends: 9036 [2019-11-06 21:19:49,166 INFO L226 Difference]: Without dead ends: 5258 [2019-11-06 21:19:49,173 INFO L630 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-11-06 21:19:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-06 21:19:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-11-06 21:19:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-11-06 21:19:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-11-06 21:19:49,345 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-11-06 21:19:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:49,345 INFO L462 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-11-06 21:19:49,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-11-06 21:19:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:49,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:49,352 INFO L410 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-11-06 21:19:49,353 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-11-06 21:19:49,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:49,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932012692] [2019-11-06 21:19:49,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:49,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932012692] [2019-11-06 21:19:49,374 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:49,374 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:49,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241316966] [2019-11-06 21:19:49,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:49,375 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:49,375 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-11-06 21:19:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:49,442 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-11-06 21:19:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:49,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:49,454 INFO L225 Difference]: With dead ends: 7884 [2019-11-06 21:19:49,455 INFO L226 Difference]: Without dead ends: 5322 [2019-11-06 21:19:49,461 INFO L630 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-11-06 21:19:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-11-06 21:19:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-11-06 21:19:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-11-06 21:19:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-11-06 21:19:49,585 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-11-06 21:19:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:49,585 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-11-06 21:19:49,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-11-06 21:19:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:49,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:49,593 INFO L410 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-11-06 21:19:49,593 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-11-06 21:19:49,594 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:49,594 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019061328] [2019-11-06 21:19:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:49,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019061328] [2019-11-06 21:19:49,619 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:49,619 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:49,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514768076] [2019-11-06 21:19:49,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:49,620 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:49,621 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-11-06 21:19:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:49,812 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-11-06 21:19:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:49,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:49,833 INFO L225 Difference]: With dead ends: 15564 [2019-11-06 21:19:49,833 INFO L226 Difference]: Without dead ends: 10378 [2019-11-06 21:19:49,843 INFO L630 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-11-06 21:19:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-11-06 21:19:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-11-06 21:19:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-11-06 21:19:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-11-06 21:19:50,115 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-11-06 21:19:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:50,116 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-11-06 21:19:50,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-11-06 21:19:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:50,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:50,127 INFO L410 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-11-06 21:19:50,128 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:50,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-11-06 21:19:50,129 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:50,129 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649217542] [2019-11-06 21:19:50,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:50,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649217542] [2019-11-06 21:19:50,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:50,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:50,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325346404] [2019-11-06 21:19:50,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:50,153 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:50,153 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-11-06 21:19:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:50,289 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-11-06 21:19:50,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:50,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:50,319 INFO L225 Difference]: With dead ends: 12172 [2019-11-06 21:19:50,319 INFO L226 Difference]: Without dead ends: 12170 [2019-11-06 21:19:50,324 INFO L630 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-11-06 21:19:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-11-06 21:19:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-11-06 21:19:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-11-06 21:19:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-11-06 21:19:50,612 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-11-06 21:19:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:50,612 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-11-06 21:19:50,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-11-06 21:19:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:19:50,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:50,625 INFO L410 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-11-06 21:19:50,625 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-11-06 21:19:50,626 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:50,626 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762927564] [2019-11-06 21:19:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:50,645 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762927564] [2019-11-06 21:19:50,645 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:50,645 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:50,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681241895] [2019-11-06 21:19:50,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:50,646 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:50,647 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-11-06 21:19:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:50,820 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-11-06 21:19:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:50,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 21:19:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:50,856 INFO L225 Difference]: With dead ends: 18316 [2019-11-06 21:19:50,856 INFO L226 Difference]: Without dead ends: 18314 [2019-11-06 21:19:50,864 INFO L630 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-11-06 21:19:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-11-06 21:19:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-11-06 21:19:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-11-06 21:19:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-11-06 21:19:51,265 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-11-06 21:19:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:51,265 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-11-06 21:19:51,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-11-06 21:19:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:19:51,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:51,288 INFO L410 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-11-06 21:19:51,288 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-11-06 21:19:51,289 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:51,289 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288178150] [2019-11-06 21:19:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:51,313 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288178150] [2019-11-06 21:19:51,313 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:51,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:51,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996655088] [2019-11-06 21:19:51,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:51,314 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:51,316 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-11-06 21:19:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:51,525 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-11-06 21:19:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:51,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 21:19:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:51,560 INFO L225 Difference]: With dead ends: 35468 [2019-11-06 21:19:51,561 INFO L226 Difference]: Without dead ends: 20362 [2019-11-06 21:19:51,590 INFO L630 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-11-06 21:19:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-06 21:19:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-11-06 21:19:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-06 21:19:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-11-06 21:19:52,446 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-11-06 21:19:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:52,447 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-11-06 21:19:52,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-11-06 21:19:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:52,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:52,471 INFO L410 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-11-06 21:19:52,471 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-11-06 21:19:52,472 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:52,472 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431008354] [2019-11-06 21:19:52,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:52,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431008354] [2019-11-06 21:19:52,498 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:52,498 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:52,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796088401] [2019-11-06 21:19:52,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:52,499 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:52,500 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-11-06 21:19:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:52,696 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-11-06 21:19:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:19:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:52,738 INFO L225 Difference]: With dead ends: 30732 [2019-11-06 21:19:52,738 INFO L226 Difference]: Without dead ends: 20746 [2019-11-06 21:19:52,762 INFO L630 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-11-06 21:19:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-11-06 21:19:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-11-06 21:19:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-11-06 21:19:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-11-06 21:19:53,218 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-11-06 21:19:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:53,219 INFO L462 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-11-06 21:19:53,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-11-06 21:19:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:53,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:53,244 INFO L410 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-11-06 21:19:53,245 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-11-06 21:19:53,246 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:53,247 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177439618] [2019-11-06 21:19:53,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:53,267 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177439618] [2019-11-06 21:19:53,267 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:53,267 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:53,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608091202] [2019-11-06 21:19:53,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:53,268 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:53,269 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-11-06 21:19:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:53,670 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-11-06 21:19:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:53,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:19:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:53,736 INFO L225 Difference]: With dead ends: 35852 [2019-11-06 21:19:53,736 INFO L226 Difference]: Without dead ends: 35850 [2019-11-06 21:19:53,741 INFO L630 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-11-06 21:19:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-11-06 21:19:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-11-06 21:19:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-11-06 21:19:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-11-06 21:19:54,268 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-11-06 21:19:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:54,268 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-11-06 21:19:54,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-11-06 21:19:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:54,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:54,311 INFO L410 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-11-06 21:19:54,312 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-11-06 21:19:54,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:54,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128473429] [2019-11-06 21:19:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:54,337 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128473429] [2019-11-06 21:19:54,337 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:54,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:54,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083835178] [2019-11-06 21:19:54,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:54,338 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:54,339 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-11-06 21:19:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:54,845 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-11-06 21:19:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:54,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:19:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:54,915 INFO L225 Difference]: With dead ends: 70668 [2019-11-06 21:19:54,915 INFO L226 Difference]: Without dead ends: 40458 [2019-11-06 21:19:54,960 INFO L630 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-11-06 21:19:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-11-06 21:19:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-11-06 21:19:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-11-06 21:19:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-11-06 21:19:56,490 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-11-06 21:19:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:56,490 INFO L462 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-11-06 21:19:56,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-11-06 21:19:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:19:56,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:56,511 INFO L410 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-11-06 21:19:56,512 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-11-06 21:19:56,512 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:56,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823082208] [2019-11-06 21:19:56,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:56,532 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823082208] [2019-11-06 21:19:56,532 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:56,532 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430474828] [2019-11-06 21:19:56,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:56,533 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:56,533 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-11-06 21:19:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:56,862 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-11-06 21:19:56,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:56,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-06 21:19:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:56,950 INFO L225 Difference]: With dead ends: 60684 [2019-11-06 21:19:56,951 INFO L226 Difference]: Without dead ends: 40970 [2019-11-06 21:19:56,975 INFO L630 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-11-06 21:19:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-11-06 21:19:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-11-06 21:19:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-11-06 21:19:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-11-06 21:19:57,789 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-11-06 21:19:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:57,789 INFO L462 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-11-06 21:19:57,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-11-06 21:19:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:19:57,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:57,806 INFO L410 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-11-06 21:19:57,807 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-11-06 21:19:57,807 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:57,807 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711264550] [2019-11-06 21:19:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:19:57,826 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711264550] [2019-11-06 21:19:57,826 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:57,826 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:57,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816241050] [2019-11-06 21:19:57,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:57,827 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:57,827 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-11-06 21:19:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:58,222 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-11-06 21:19:58,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:58,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-06 21:19:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:58,354 INFO L225 Difference]: With dead ends: 69644 [2019-11-06 21:19:58,354 INFO L226 Difference]: Without dead ends: 69642 [2019-11-06 21:19:58,373 INFO L630 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-11-06 21:19:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-11-06 21:19:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-11-06 21:19:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-11-06 21:20:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-11-06 21:20:00,055 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-11-06 21:20:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,056 INFO L462 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-11-06 21:20:00,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-11-06 21:20:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:20:00,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:00,098 INFO L410 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-11-06 21:20:00,099 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-11-06 21:20:00,099 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:00,099 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17987726] [2019-11-06 21:20:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:00,130 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17987726] [2019-11-06 21:20:00,130 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:00,130 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:00,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881995888] [2019-11-06 21:20:00,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:00,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:00,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:00,132 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-11-06 21:20:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,722 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-11-06 21:20:00,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-06 21:20:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,808 INFO L225 Difference]: With dead ends: 140300 [2019-11-06 21:20:00,808 INFO L226 Difference]: Without dead ends: 79882 [2019-11-06 21:20:01,208 INFO L630 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-11-06 21:20:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-11-06 21:20:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-11-06 21:20:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-11-06 21:20:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-11-06 21:20:04,115 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-11-06 21:20:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,115 INFO L462 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-11-06 21:20:04,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-11-06 21:20:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:20:04,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,146 INFO L410 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-11-06 21:20:04,146 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-11-06 21:20:04,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364379249] [2019-11-06 21:20:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364379249] [2019-11-06 21:20:04,172 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,172 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943209864] [2019-11-06 21:20:04,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,172 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,173 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-11-06 21:20:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,752 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-11-06 21:20:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-06 21:20:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,849 INFO L225 Difference]: With dead ends: 119820 [2019-11-06 21:20:04,850 INFO L226 Difference]: Without dead ends: 80906 [2019-11-06 21:20:04,890 INFO L630 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-11-06 21:20:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-11-06 21:20:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-11-06 21:20:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-11-06 21:20:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-11-06 21:20:05,965 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-11-06 21:20:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,965 INFO L462 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-11-06 21:20:05,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-11-06 21:20:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:20:05,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,994 INFO L410 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-11-06 21:20:05,994 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-11-06 21:20:05,995 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,995 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441713546] [2019-11-06 21:20:05,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441713546] [2019-11-06 21:20:06,011 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,012 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186663783] [2019-11-06 21:20:06,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,012 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,013 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-11-06 21:20:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,719 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-11-06 21:20:06,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-06 21:20:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,283 INFO L225 Difference]: With dead ends: 135180 [2019-11-06 21:20:07,283 INFO L226 Difference]: Without dead ends: 135178 [2019-11-06 21:20:07,294 INFO L630 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-11-06 21:20:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-11-06 21:20:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-11-06 21:20:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-11-06 21:20:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-11-06 21:20:11,102 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-11-06 21:20:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:11,103 INFO L462 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-11-06 21:20:11,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-11-06 21:20:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:20:11,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:11,163 INFO L410 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-11-06 21:20:11,163 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-11-06 21:20:11,163 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:11,163 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780478753] [2019-11-06 21:20:11,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:11,180 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780478753] [2019-11-06 21:20:11,180 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:11,180 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:11,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135464611] [2019-11-06 21:20:11,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:11,181 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:11,181 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-11-06 21:20:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:12,229 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-11-06 21:20:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:12,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-06 21:20:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:12,392 INFO L225 Difference]: With dead ends: 278540 [2019-11-06 21:20:12,393 INFO L226 Difference]: Without dead ends: 157706 [2019-11-06 21:20:12,476 INFO L630 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-11-06 21:20:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-11-06 21:20:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-11-06 21:20:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states.