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/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:02:45,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:02:45,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:02:45,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:02:45,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:02:45,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:02:45,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:02:45,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:02:45,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:02:45,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:02:45,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:02:45,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:02:45,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:02:45,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:02:45,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:02:45,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:02:45,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:02:45,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:02:45,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:02:45,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:02:45,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:02:45,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:02:45,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:02:45,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:02:45,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:02:45,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:02:45,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:02:45,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:02:45,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:02:45,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:02:45,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:02:45,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:02:45,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:02:45,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:02:45,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:02:45,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:02:45,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:02:45,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:02:45,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:02:45,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:02:45,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:02:45,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:02:45,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:02:45,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:02:45,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:02:45,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:02:45,542 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:02:45,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:02:45,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:02:45,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:02:45,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:02:45,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:02:45,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:02:45,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:02:45,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:02:45,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:02:45,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:02:45,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:02:45,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:02:45,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:02:45,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:02:45,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:02:45,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:02:45,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:02:45,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:02:45,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:02:45,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:02:45,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:02:45,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:02:45,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:02:45,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:02:45,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:02:45,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:02:45,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:02:45,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:02:45,592 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:02:45,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:02:45,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5235326/d91c63f50654429e891590171530e2a7/FLAGe5673dc16 [2019-09-08 13:02:46,128 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:02:46,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:02:46,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5235326/d91c63f50654429e891590171530e2a7/FLAGe5673dc16 [2019-09-08 13:02:46,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5235326/d91c63f50654429e891590171530e2a7 [2019-09-08 13:02:46,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:02:46,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:02:46,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:02:46,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:02:46,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:02:46,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:02:46" (1/1) ... [2019-09-08 13:02:46,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7106b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:46, skipping insertion in model container [2019-09-08 13:02:46,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:02:46" (1/1) ... [2019-09-08 13:02:46,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:02:46,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:02:46,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:02:46,954 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:02:47,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:02:47,065 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:02:47,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47 WrapperNode [2019-09-08 13:02:47,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:02:47,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:02:47,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:02:47,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:02:47,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... [2019-09-08 13:02:47,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:02:47,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:02:47,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:02:47,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:02:47,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:02:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:02:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:02:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:02:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:02:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:02:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:02:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:02:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:02:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:02:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:02:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:02:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:02:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:02:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:02:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:02:48,250 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:02:48,251 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:02:48,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:02:48 BoogieIcfgContainer [2019-09-08 13:02:48,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:02:48,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:02:48,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:02:48,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:02:48,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:02:46" (1/3) ... [2019-09-08 13:02:48,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764abbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:02:48, skipping insertion in model container [2019-09-08 13:02:48,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:02:47" (2/3) ... [2019-09-08 13:02:48,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764abbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:02:48, skipping insertion in model container [2019-09-08 13:02:48,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:02:48" (3/3) ... [2019-09-08 13:02:48,262 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:02:48,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:02:48,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:02:48,299 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:02:48,333 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:02:48,334 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:02:48,335 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:02:48,335 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:02:48,335 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:02:48,336 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:02:48,336 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:02:48,336 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:02:48,336 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:02:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-08 13:02:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 13:02:48,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:48,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:48,378 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-08 13:02:48,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:48,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:48,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:48,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:48,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:48,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:48,937 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-08 13:02:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:49,124 INFO L93 Difference]: Finished difference Result 336 states and 558 transitions. [2019-09-08 13:02:49,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:49,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 13:02:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:49,151 INFO L225 Difference]: With dead ends: 336 [2019-09-08 13:02:49,151 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 13:02:49,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 13:02:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-09-08 13:02:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 13:02:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 349 transitions. [2019-09-08 13:02:49,234 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 349 transitions. Word has length 66 [2019-09-08 13:02:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:49,235 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 349 transitions. [2019-09-08 13:02:49,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:02:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 349 transitions. [2019-09-08 13:02:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 13:02:49,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:49,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:49,242 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-08 13:02:49,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:49,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:49,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:49,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:49,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:49,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:49,430 INFO L87 Difference]: Start difference. First operand 226 states and 349 transitions. Second operand 3 states. [2019-09-08 13:02:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:49,531 INFO L93 Difference]: Finished difference Result 540 states and 861 transitions. [2019-09-08 13:02:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:49,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 13:02:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:49,535 INFO L225 Difference]: With dead ends: 540 [2019-09-08 13:02:49,536 INFO L226 Difference]: Without dead ends: 375 [2019-09-08 13:02:49,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-08 13:02:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2019-09-08 13:02:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-08 13:02:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 584 transitions. [2019-09-08 13:02:49,578 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 584 transitions. Word has length 68 [2019-09-08 13:02:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:49,579 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 584 transitions. [2019-09-08 13:02:49,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:02:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 584 transitions. [2019-09-08 13:02:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 13:02:49,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:49,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:49,583 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-08 13:02:49,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:49,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:49,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:49,755 INFO L87 Difference]: Start difference. First operand 371 states and 584 transitions. Second operand 3 states. [2019-09-08 13:02:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:49,843 INFO L93 Difference]: Finished difference Result 959 states and 1538 transitions. [2019-09-08 13:02:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:49,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 13:02:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:49,852 INFO L225 Difference]: With dead ends: 959 [2019-09-08 13:02:49,852 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 13:02:49,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 13:02:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-09-08 13:02:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 13:02:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1020 transitions. [2019-09-08 13:02:49,932 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1020 transitions. Word has length 70 [2019-09-08 13:02:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:49,933 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1020 transitions. [2019-09-08 13:02:49,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:02:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1020 transitions. [2019-09-08 13:02:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 13:02:49,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:49,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:49,947 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-08 13:02:49,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:49,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:49,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:49,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:50,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:50,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:02:50,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:02:50,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:02:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:02:50,172 INFO L87 Difference]: Start difference. First operand 643 states and 1020 transitions. Second operand 5 states. [2019-09-08 13:02:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:50,488 INFO L93 Difference]: Finished difference Result 3287 states and 5318 transitions. [2019-09-08 13:02:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:02:50,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 13:02:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:50,507 INFO L225 Difference]: With dead ends: 3287 [2019-09-08 13:02:50,508 INFO L226 Difference]: Without dead ends: 2705 [2019-09-08 13:02:50,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:02:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2019-09-08 13:02:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1207. [2019-09-08 13:02:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-09-08 13:02:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1928 transitions. [2019-09-08 13:02:50,604 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1928 transitions. Word has length 72 [2019-09-08 13:02:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:50,604 INFO L475 AbstractCegarLoop]: Abstraction has 1207 states and 1928 transitions. [2019-09-08 13:02:50,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:02:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1928 transitions. [2019-09-08 13:02:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 13:02:50,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:50,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:50,607 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-08 13:02:50,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:50,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:50,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:50,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:02:50,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:02:50,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:02:50,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:02:50,702 INFO L87 Difference]: Start difference. First operand 1207 states and 1928 transitions. Second operand 4 states. [2019-09-08 13:02:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:50,967 INFO L93 Difference]: Finished difference Result 4399 states and 7083 transitions. [2019-09-08 13:02:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:02:50,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 13:02:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:50,989 INFO L225 Difference]: With dead ends: 4399 [2019-09-08 13:02:50,990 INFO L226 Difference]: Without dead ends: 3253 [2019-09-08 13:02:50,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:02:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-08 13:02:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2221. [2019-09-08 13:02:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-09-08 13:02:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3552 transitions. [2019-09-08 13:02:51,146 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3552 transitions. Word has length 73 [2019-09-08 13:02:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:51,148 INFO L475 AbstractCegarLoop]: Abstraction has 2221 states and 3552 transitions. [2019-09-08 13:02:51,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:02:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3552 transitions. [2019-09-08 13:02:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 13:02:51,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:51,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:51,151 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-08 13:02:51,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:51,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:51,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:02:51,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:02:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:02:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:02:51,307 INFO L87 Difference]: Start difference. First operand 2221 states and 3552 transitions. Second operand 7 states. [2019-09-08 13:02:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:51,983 INFO L93 Difference]: Finished difference Result 10162 states and 16311 transitions. [2019-09-08 13:02:51,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 13:02:51,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 13:02:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:52,041 INFO L225 Difference]: With dead ends: 10162 [2019-09-08 13:02:52,041 INFO L226 Difference]: Without dead ends: 8002 [2019-09-08 13:02:52,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:02:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2019-09-08 13:02:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 7843. [2019-09-08 13:02:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7843 states. [2019-09-08 13:02:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7843 states to 7843 states and 12533 transitions. [2019-09-08 13:02:52,774 INFO L78 Accepts]: Start accepts. Automaton has 7843 states and 12533 transitions. Word has length 74 [2019-09-08 13:02:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:52,775 INFO L475 AbstractCegarLoop]: Abstraction has 7843 states and 12533 transitions. [2019-09-08 13:02:52,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:02:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7843 states and 12533 transitions. [2019-09-08 13:02:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 13:02:52,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:52,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:52,778 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-08 13:02:52,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:52,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:02:52,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:02:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:02:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:02:52,925 INFO L87 Difference]: Start difference. First operand 7843 states and 12533 transitions. Second operand 4 states. [2019-09-08 13:02:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:53,885 INFO L93 Difference]: Finished difference Result 22990 states and 36900 transitions. [2019-09-08 13:02:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:02:53,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 13:02:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:53,960 INFO L225 Difference]: With dead ends: 22990 [2019-09-08 13:02:53,960 INFO L226 Difference]: Without dead ends: 15873 [2019-09-08 13:02:53,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:02:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2019-09-08 13:02:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 11256. [2019-09-08 13:02:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11256 states. [2019-09-08 13:02:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11256 states to 11256 states and 17984 transitions. [2019-09-08 13:02:54,732 INFO L78 Accepts]: Start accepts. Automaton has 11256 states and 17984 transitions. Word has length 75 [2019-09-08 13:02:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:54,733 INFO L475 AbstractCegarLoop]: Abstraction has 11256 states and 17984 transitions. [2019-09-08 13:02:54,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:02:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 11256 states and 17984 transitions. [2019-09-08 13:02:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 13:02:54,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:54,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:54,736 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911695, now seen corresponding path program 1 times [2019-09-08 13:02:54,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:54,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:54,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:54,790 INFO L87 Difference]: Start difference. First operand 11256 states and 17984 transitions. Second operand 3 states. [2019-09-08 13:02:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:55,562 INFO L93 Difference]: Finished difference Result 26534 states and 42527 transitions. [2019-09-08 13:02:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:55,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 13:02:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:55,600 INFO L225 Difference]: With dead ends: 26534 [2019-09-08 13:02:55,600 INFO L226 Difference]: Without dead ends: 15402 [2019-09-08 13:02:55,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15402 states. [2019-09-08 13:02:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15402 to 15400. [2019-09-08 13:02:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15400 states. [2019-09-08 13:02:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 24645 transitions. [2019-09-08 13:02:56,463 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 24645 transitions. Word has length 76 [2019-09-08 13:02:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 15400 states and 24645 transitions. [2019-09-08 13:02:56,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:02:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 24645 transitions. [2019-09-08 13:02:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 13:02:56,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:56,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:56,466 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-08 13:02:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:56,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:56,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:56,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:56,535 INFO L87 Difference]: Start difference. First operand 15400 states and 24645 transitions. Second operand 3 states. [2019-09-08 13:02:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:57,801 INFO L93 Difference]: Finished difference Result 33986 states and 54353 transitions. [2019-09-08 13:02:57,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:57,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 13:02:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:57,853 INFO L225 Difference]: With dead ends: 33986 [2019-09-08 13:02:57,853 INFO L226 Difference]: Without dead ends: 22765 [2019-09-08 13:02:57,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22765 states. [2019-09-08 13:02:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22765 to 22763. [2019-09-08 13:02:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22763 states. [2019-09-08 13:02:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22763 states to 22763 states and 36135 transitions. [2019-09-08 13:02:58,738 INFO L78 Accepts]: Start accepts. Automaton has 22763 states and 36135 transitions. Word has length 76 [2019-09-08 13:02:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:58,738 INFO L475 AbstractCegarLoop]: Abstraction has 22763 states and 36135 transitions. [2019-09-08 13:02:58,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:02:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 22763 states and 36135 transitions. [2019-09-08 13:02:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 13:02:58,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:58,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:58,740 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-08 13:02:58,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:58,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:58,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:58,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:58,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:58,797 INFO L87 Difference]: Start difference. First operand 22763 states and 36135 transitions. Second operand 3 states. [2019-09-08 13:02:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:59,824 INFO L93 Difference]: Finished difference Result 48353 states and 76799 transitions. [2019-09-08 13:02:59,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:59,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 13:02:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:59,908 INFO L225 Difference]: With dead ends: 48353 [2019-09-08 13:02:59,908 INFO L226 Difference]: Without dead ends: 31974 [2019-09-08 13:02:59,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31974 states. [2019-09-08 13:03:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31974 to 31972. [2019-09-08 13:03:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31972 states. [2019-09-08 13:03:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31972 states to 31972 states and 50293 transitions. [2019-09-08 13:03:01,908 INFO L78 Accepts]: Start accepts. Automaton has 31972 states and 50293 transitions. Word has length 76 [2019-09-08 13:03:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:01,909 INFO L475 AbstractCegarLoop]: Abstraction has 31972 states and 50293 transitions. [2019-09-08 13:03:01,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31972 states and 50293 transitions. [2019-09-08 13:03:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 13:03:01,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:01,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:01,910 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-08 13:03:01,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:01,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:01,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:01,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:01,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:02,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:02,042 INFO L87 Difference]: Start difference. First operand 31972 states and 50293 transitions. Second operand 5 states. [2019-09-08 13:03:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:03,676 INFO L93 Difference]: Finished difference Result 76519 states and 120360 transitions. [2019-09-08 13:03:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:03,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 13:03:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:03,803 INFO L225 Difference]: With dead ends: 76519 [2019-09-08 13:03:03,803 INFO L226 Difference]: Without dead ends: 44642 [2019-09-08 13:03:03,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44642 states. [2019-09-08 13:03:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44642 to 44636. [2019-09-08 13:03:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44636 states. [2019-09-08 13:03:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44636 states to 44636 states and 70031 transitions. [2019-09-08 13:03:05,554 INFO L78 Accepts]: Start accepts. Automaton has 44636 states and 70031 transitions. Word has length 77 [2019-09-08 13:03:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:05,555 INFO L475 AbstractCegarLoop]: Abstraction has 44636 states and 70031 transitions. [2019-09-08 13:03:05,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44636 states and 70031 transitions. [2019-09-08 13:03:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 13:03:05,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:05,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:05,556 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-08 13:03:05,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:05,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:06,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:06,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:06,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:06,732 INFO L87 Difference]: Start difference. First operand 44636 states and 70031 transitions. Second operand 5 states. [2019-09-08 13:03:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:09,892 INFO L93 Difference]: Finished difference Result 143122 states and 224955 transitions. [2019-09-08 13:03:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:09,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 13:03:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:10,094 INFO L225 Difference]: With dead ends: 143122 [2019-09-08 13:03:10,094 INFO L226 Difference]: Without dead ends: 98581 [2019-09-08 13:03:10,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98581 states. [2019-09-08 13:03:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98581 to 60991. [2019-09-08 13:03:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60991 states. [2019-09-08 13:03:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60991 states to 60991 states and 95413 transitions. [2019-09-08 13:03:12,888 INFO L78 Accepts]: Start accepts. Automaton has 60991 states and 95413 transitions. Word has length 80 [2019-09-08 13:03:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:12,889 INFO L475 AbstractCegarLoop]: Abstraction has 60991 states and 95413 transitions. [2019-09-08 13:03:12,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 60991 states and 95413 transitions. [2019-09-08 13:03:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 13:03:12,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:12,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:12,890 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-08 13:03:12,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:13,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:13,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:13,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:13,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:13,018 INFO L87 Difference]: Start difference. First operand 60991 states and 95413 transitions. Second operand 5 states. [2019-09-08 13:03:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:17,758 INFO L93 Difference]: Finished difference Result 109004 states and 169623 transitions. [2019-09-08 13:03:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:03:17,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 13:03:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:17,948 INFO L225 Difference]: With dead ends: 109004 [2019-09-08 13:03:17,948 INFO L226 Difference]: Without dead ends: 109002 [2019-09-08 13:03:17,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:03:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109002 states. [2019-09-08 13:03:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109002 to 62353. [2019-09-08 13:03:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62353 states. [2019-09-08 13:03:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62353 states to 62353 states and 96766 transitions. [2019-09-08 13:03:21,016 INFO L78 Accepts]: Start accepts. Automaton has 62353 states and 96766 transitions. Word has length 81 [2019-09-08 13:03:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:21,016 INFO L475 AbstractCegarLoop]: Abstraction has 62353 states and 96766 transitions. [2019-09-08 13:03:21,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 62353 states and 96766 transitions. [2019-09-08 13:03:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:03:21,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:21,019 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:21,019 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 477987945, now seen corresponding path program 1 times [2019-09-08 13:03:21,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:21,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:21,103 INFO L87 Difference]: Start difference. First operand 62353 states and 96766 transitions. Second operand 3 states. [2019-09-08 13:03:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:24,153 INFO L93 Difference]: Finished difference Result 114160 states and 177394 transitions. [2019-09-08 13:03:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:24,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:03:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:24,244 INFO L225 Difference]: With dead ends: 114160 [2019-09-08 13:03:24,245 INFO L226 Difference]: Without dead ends: 51902 [2019-09-08 13:03:24,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51902 states. [2019-09-08 13:03:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51902 to 51900. [2019-09-08 13:03:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51900 states. [2019-09-08 13:03:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51900 states to 51900 states and 80236 transitions. [2019-09-08 13:03:28,290 INFO L78 Accepts]: Start accepts. Automaton has 51900 states and 80236 transitions. Word has length 107 [2019-09-08 13:03:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:28,291 INFO L475 AbstractCegarLoop]: Abstraction has 51900 states and 80236 transitions. [2019-09-08 13:03:28,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51900 states and 80236 transitions. [2019-09-08 13:03:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:03:28,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:28,292 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:28,293 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-08 13:03:28,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:28,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:28,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:28,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:28,375 INFO L87 Difference]: Start difference. First operand 51900 states and 80236 transitions. Second operand 3 states. [2019-09-08 13:03:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:29,868 INFO L93 Difference]: Finished difference Result 77899 states and 120544 transitions. [2019-09-08 13:03:29,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:29,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:03:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:29,901 INFO L225 Difference]: With dead ends: 77899 [2019-09-08 13:03:29,902 INFO L226 Difference]: Without dead ends: 26255 [2019-09-08 13:03:29,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26255 states. [2019-09-08 13:03:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26255 to 26253. [2019-09-08 13:03:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26253 states. [2019-09-08 13:03:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26253 states to 26253 states and 40320 transitions. [2019-09-08 13:03:30,969 INFO L78 Accepts]: Start accepts. Automaton has 26253 states and 40320 transitions. Word has length 107 [2019-09-08 13:03:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:30,970 INFO L475 AbstractCegarLoop]: Abstraction has 26253 states and 40320 transitions. [2019-09-08 13:03:30,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26253 states and 40320 transitions. [2019-09-08 13:03:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:03:30,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:30,972 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:30,972 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 723995340, now seen corresponding path program 1 times [2019-09-08 13:03:30,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:30,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:30,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:03:31,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:31,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:31,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:31,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:31,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:31,108 INFO L87 Difference]: Start difference. First operand 26253 states and 40320 transitions. Second operand 5 states. [2019-09-08 13:03:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:32,722 INFO L93 Difference]: Finished difference Result 39321 states and 60503 transitions. [2019-09-08 13:03:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:32,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 13:03:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:32,762 INFO L225 Difference]: With dead ends: 39321 [2019-09-08 13:03:32,762 INFO L226 Difference]: Without dead ends: 33715 [2019-09-08 13:03:32,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33715 states. [2019-09-08 13:03:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33715 to 31859. [2019-09-08 13:03:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31859 states. [2019-09-08 13:03:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31859 states to 31859 states and 48914 transitions. [2019-09-08 13:03:34,083 INFO L78 Accepts]: Start accepts. Automaton has 31859 states and 48914 transitions. Word has length 110 [2019-09-08 13:03:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:34,083 INFO L475 AbstractCegarLoop]: Abstraction has 31859 states and 48914 transitions. [2019-09-08 13:03:34,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 31859 states and 48914 transitions. [2019-09-08 13:03:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:03:34,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:34,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:34,085 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1552059104, now seen corresponding path program 1 times [2019-09-08 13:03:34,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:34,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:34,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:03:34,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:34,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:34,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:34,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:34,201 INFO L87 Difference]: Start difference. First operand 31859 states and 48914 transitions. Second operand 5 states. [2019-09-08 13:03:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:36,079 INFO L93 Difference]: Finished difference Result 44198 states and 68080 transitions. [2019-09-08 13:03:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:36,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 13:03:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:36,114 INFO L225 Difference]: With dead ends: 44198 [2019-09-08 13:03:36,114 INFO L226 Difference]: Without dead ends: 28275 [2019-09-08 13:03:36,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28275 states. [2019-09-08 13:03:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28275 to 28251. [2019-09-08 13:03:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28251 states. [2019-09-08 13:03:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28251 states to 28251 states and 43332 transitions. [2019-09-08 13:03:37,259 INFO L78 Accepts]: Start accepts. Automaton has 28251 states and 43332 transitions. Word has length 110 [2019-09-08 13:03:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:37,260 INFO L475 AbstractCegarLoop]: Abstraction has 28251 states and 43332 transitions. [2019-09-08 13:03:37,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 28251 states and 43332 transitions. [2019-09-08 13:03:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 13:03:37,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:37,262 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:37,262 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1672529094, now seen corresponding path program 1 times [2019-09-08 13:03:37,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:37,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:37,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:03:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:37,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:37,330 INFO L87 Difference]: Start difference. First operand 28251 states and 43332 transitions. Second operand 3 states. [2019-09-08 13:03:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:39,365 INFO L93 Difference]: Finished difference Result 62178 states and 95523 transitions. [2019-09-08 13:03:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:39,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 13:03:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:39,444 INFO L225 Difference]: With dead ends: 62178 [2019-09-08 13:03:39,444 INFO L226 Difference]: Without dead ends: 48673 [2019-09-08 13:03:39,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48673 states. [2019-09-08 13:03:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48673 to 48570. [2019-09-08 13:03:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48570 states. [2019-09-08 13:03:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48570 states to 48570 states and 74389 transitions. [2019-09-08 13:03:41,805 INFO L78 Accepts]: Start accepts. Automaton has 48570 states and 74389 transitions. Word has length 111 [2019-09-08 13:03:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:41,806 INFO L475 AbstractCegarLoop]: Abstraction has 48570 states and 74389 transitions. [2019-09-08 13:03:41,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 48570 states and 74389 transitions. [2019-09-08 13:03:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 13:03:41,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:41,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:41,807 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2104094732, now seen corresponding path program 1 times [2019-09-08 13:03:41,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:41,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:41,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:41,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:41,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:41,890 INFO L87 Difference]: Start difference. First operand 48570 states and 74389 transitions. Second operand 3 states. [2019-09-08 13:03:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:42,958 INFO L93 Difference]: Finished difference Result 69920 states and 107110 transitions. [2019-09-08 13:03:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:42,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 13:03:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:42,989 INFO L225 Difference]: With dead ends: 69920 [2019-09-08 13:03:42,989 INFO L226 Difference]: Without dead ends: 21584 [2019-09-08 13:03:43,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21584 states. [2019-09-08 13:03:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21584 to 21582. [2019-09-08 13:03:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21582 states. [2019-09-08 13:03:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21582 states to 21582 states and 32890 transitions. [2019-09-08 13:03:43,936 INFO L78 Accepts]: Start accepts. Automaton has 21582 states and 32890 transitions. Word has length 111 [2019-09-08 13:03:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:43,936 INFO L475 AbstractCegarLoop]: Abstraction has 21582 states and 32890 transitions. [2019-09-08 13:03:43,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 21582 states and 32890 transitions. [2019-09-08 13:03:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 13:03:43,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:43,938 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:43,938 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash 767705507, now seen corresponding path program 1 times [2019-09-08 13:03:43,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:03:44,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:44,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:44,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:44,041 INFO L87 Difference]: Start difference. First operand 21582 states and 32890 transitions. Second operand 5 states. [2019-09-08 13:03:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:45,838 INFO L93 Difference]: Finished difference Result 37300 states and 56993 transitions. [2019-09-08 13:03:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:03:45,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 13:03:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:45,877 INFO L225 Difference]: With dead ends: 37300 [2019-09-08 13:03:45,877 INFO L226 Difference]: Without dead ends: 23878 [2019-09-08 13:03:45,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23878 states. [2019-09-08 13:03:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23878 to 23834. [2019-09-08 13:03:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23834 states. [2019-09-08 13:03:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23834 states to 23834 states and 36313 transitions. [2019-09-08 13:03:46,918 INFO L78 Accepts]: Start accepts. Automaton has 23834 states and 36313 transitions. Word has length 113 [2019-09-08 13:03:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:46,918 INFO L475 AbstractCegarLoop]: Abstraction has 23834 states and 36313 transitions. [2019-09-08 13:03:46,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:03:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 23834 states and 36313 transitions. [2019-09-08 13:03:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 13:03:46,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:46,920 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:46,920 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1430128237, now seen corresponding path program 1 times [2019-09-08 13:03:46,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:46,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:46,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:03:47,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:47,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:47,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:47,067 INFO L87 Difference]: Start difference. First operand 23834 states and 36313 transitions. Second operand 4 states. [2019-09-08 13:03:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:49,184 INFO L93 Difference]: Finished difference Result 70558 states and 107370 transitions. [2019-09-08 13:03:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:49,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 13:03:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:49,243 INFO L225 Difference]: With dead ends: 70558 [2019-09-08 13:03:49,243 INFO L226 Difference]: Without dead ends: 46737 [2019-09-08 13:03:49,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46737 states. [2019-09-08 13:03:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46737 to 46735. [2019-09-08 13:03:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46735 states. [2019-09-08 13:03:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46735 states to 46735 states and 70764 transitions. [2019-09-08 13:03:51,604 INFO L78 Accepts]: Start accepts. Automaton has 46735 states and 70764 transitions. Word has length 114 [2019-09-08 13:03:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:51,604 INFO L475 AbstractCegarLoop]: Abstraction has 46735 states and 70764 transitions. [2019-09-08 13:03:51,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46735 states and 70764 transitions. [2019-09-08 13:03:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 13:03:51,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:51,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:51,607 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 710230287, now seen corresponding path program 1 times [2019-09-08 13:03:51,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:51,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:51,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:03:51,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:51,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:51,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:51,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:51,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:51,647 INFO L87 Difference]: Start difference. First operand 46735 states and 70764 transitions. Second operand 3 states. [2019-09-08 13:03:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:57,277 INFO L93 Difference]: Finished difference Result 140159 states and 212222 transitions. [2019-09-08 13:03:57,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:03:57,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 13:03:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:57,395 INFO L225 Difference]: With dead ends: 140159 [2019-09-08 13:03:57,395 INFO L226 Difference]: Without dead ends: 93456 [2019-09-08 13:03:57,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93456 states. [2019-09-08 13:04:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93456 to 46737. [2019-09-08 13:04:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46737 states. [2019-09-08 13:04:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46737 states to 46737 states and 70766 transitions. [2019-09-08 13:04:00,261 INFO L78 Accepts]: Start accepts. Automaton has 46737 states and 70766 transitions. Word has length 115 [2019-09-08 13:04:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:00,261 INFO L475 AbstractCegarLoop]: Abstraction has 46737 states and 70766 transitions. [2019-09-08 13:04:00,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 46737 states and 70766 transitions. [2019-09-08 13:04:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:04:00,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:00,263 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:00,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:00,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1524060780, now seen corresponding path program 1 times [2019-09-08 13:04:00,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:00,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:04:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:00,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:00,350 INFO L87 Difference]: Start difference. First operand 46737 states and 70766 transitions. Second operand 3 states. [2019-09-08 13:04:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:05,110 INFO L93 Difference]: Finished difference Result 136632 states and 206499 transitions. [2019-09-08 13:04:05,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:05,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 13:04:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:05,242 INFO L225 Difference]: With dead ends: 136632 [2019-09-08 13:04:05,242 INFO L226 Difference]: Without dead ends: 90098 [2019-09-08 13:04:05,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90098 states. [2019-09-08 13:04:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90098 to 90096. [2019-09-08 13:04:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90096 states. [2019-09-08 13:04:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90096 states to 90096 states and 135087 transitions. [2019-09-08 13:04:12,295 INFO L78 Accepts]: Start accepts. Automaton has 90096 states and 135087 transitions. Word has length 116 [2019-09-08 13:04:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:12,296 INFO L475 AbstractCegarLoop]: Abstraction has 90096 states and 135087 transitions. [2019-09-08 13:04:12,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 90096 states and 135087 transitions. [2019-09-08 13:04:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:04:12,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:12,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:12,299 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1435687287, now seen corresponding path program 1 times [2019-09-08 13:04:12,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:04:12,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:12,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:12,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:12,408 INFO L87 Difference]: Start difference. First operand 90096 states and 135087 transitions. Second operand 4 states. [2019-09-08 13:04:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:16,678 INFO L93 Difference]: Finished difference Result 158779 states and 237905 transitions. [2019-09-08 13:04:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:16,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 13:04:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:16,791 INFO L225 Difference]: With dead ends: 158779 [2019-09-08 13:04:16,791 INFO L226 Difference]: Without dead ends: 68874 [2019-09-08 13:04:16,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-09-08 13:04:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-09-08 13:04:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-09-08 13:04:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 103073 transitions. [2019-09-08 13:04:20,953 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 103073 transitions. Word has length 116 [2019-09-08 13:04:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:20,953 INFO L475 AbstractCegarLoop]: Abstraction has 68874 states and 103073 transitions. [2019-09-08 13:04:20,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 103073 transitions. [2019-09-08 13:04:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:04:20,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:20,956 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:20,956 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash -562858339, now seen corresponding path program 1 times [2019-09-08 13:04:20,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:04:21,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:21,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:21,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:21,006 INFO L87 Difference]: Start difference. First operand 68874 states and 103073 transitions. Second operand 3 states. [2019-09-08 13:04:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:27,236 INFO L93 Difference]: Finished difference Result 161037 states and 240709 transitions. [2019-09-08 13:04:27,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:27,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 13:04:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:27,376 INFO L225 Difference]: With dead ends: 161037 [2019-09-08 13:04:27,376 INFO L226 Difference]: Without dead ends: 92352 [2019-09-08 13:04:27,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92352 states. [2019-09-08 13:04:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92352 to 69482. [2019-09-08 13:04:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69482 states. [2019-09-08 13:04:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69482 states to 69482 states and 103980 transitions. [2019-09-08 13:04:31,801 INFO L78 Accepts]: Start accepts. Automaton has 69482 states and 103980 transitions. Word has length 116 [2019-09-08 13:04:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:31,801 INFO L475 AbstractCegarLoop]: Abstraction has 69482 states and 103980 transitions. [2019-09-08 13:04:31,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 69482 states and 103980 transitions. [2019-09-08 13:04:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 13:04:31,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:31,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:31,804 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 366781120, now seen corresponding path program 1 times [2019-09-08 13:04:31,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:31,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:31,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:04:31,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:31,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:04:31,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:04:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:04:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:31,862 INFO L87 Difference]: Start difference. First operand 69482 states and 103980 transitions. Second operand 3 states. [2019-09-08 13:04:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:39,112 INFO L93 Difference]: Finished difference Result 167482 states and 249230 transitions. [2019-09-08 13:04:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:39,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 13:04:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:39,253 INFO L225 Difference]: With dead ends: 167482 [2019-09-08 13:04:39,253 INFO L226 Difference]: Without dead ends: 98279 [2019-09-08 13:04:39,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98279 states. [2019-09-08 13:04:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98279 to 71002. [2019-09-08 13:04:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71002 states. [2019-09-08 13:04:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71002 states to 71002 states and 105799 transitions. [2019-09-08 13:04:43,699 INFO L78 Accepts]: Start accepts. Automaton has 71002 states and 105799 transitions. Word has length 118 [2019-09-08 13:04:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:43,700 INFO L475 AbstractCegarLoop]: Abstraction has 71002 states and 105799 transitions. [2019-09-08 13:04:43,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71002 states and 105799 transitions. [2019-09-08 13:04:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 13:04:43,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:43,704 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:43,704 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1646607505, now seen corresponding path program 1 times [2019-09-08 13:04:43,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:43,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:04:44,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:44,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:44,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:44,126 INFO L87 Difference]: Start difference. First operand 71002 states and 105799 transitions. Second operand 4 states. [2019-09-08 13:04:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:51,388 INFO L93 Difference]: Finished difference Result 187203 states and 278909 transitions. [2019-09-08 13:04:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:51,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-08 13:04:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:51,580 INFO L225 Difference]: With dead ends: 187203 [2019-09-08 13:04:51,580 INFO L226 Difference]: Without dead ends: 116224 [2019-09-08 13:04:51,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116224 states. [2019-09-08 13:05:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116224 to 116222. [2019-09-08 13:05:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116222 states. [2019-09-08 13:05:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116222 states to 116222 states and 171896 transitions. [2019-09-08 13:05:01,422 INFO L78 Accepts]: Start accepts. Automaton has 116222 states and 171896 transitions. Word has length 119 [2019-09-08 13:05:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:01,422 INFO L475 AbstractCegarLoop]: Abstraction has 116222 states and 171896 transitions. [2019-09-08 13:05:01,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 116222 states and 171896 transitions. [2019-09-08 13:05:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 13:05:01,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:01,426 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:01,426 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 790055070, now seen corresponding path program 1 times [2019-09-08 13:05:01,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:01,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:01,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:05:01,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:01,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:01,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:01,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:01,495 INFO L87 Difference]: Start difference. First operand 116222 states and 171896 transitions. Second operand 3 states. [2019-09-08 13:05:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:19,040 INFO L93 Difference]: Finished difference Result 339642 states and 501142 transitions. [2019-09-08 13:05:19,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:19,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 13:05:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:19,453 INFO L225 Difference]: With dead ends: 339642 [2019-09-08 13:05:19,454 INFO L226 Difference]: Without dead ends: 223874 [2019-09-08 13:05:19,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223874 states. [2019-09-08 13:05:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223874 to 223872. [2019-09-08 13:05:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223872 states. [2019-09-08 13:05:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223872 states to 223872 states and 327491 transitions. [2019-09-08 13:05:39,661 INFO L78 Accepts]: Start accepts. Automaton has 223872 states and 327491 transitions. Word has length 121 [2019-09-08 13:05:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:39,662 INFO L475 AbstractCegarLoop]: Abstraction has 223872 states and 327491 transitions. [2019-09-08 13:05:39,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 223872 states and 327491 transitions. [2019-09-08 13:05:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 13:05:39,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:39,668 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:39,668 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1680989343, now seen corresponding path program 1 times [2019-09-08 13:05:39,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:39,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:05:39,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:39,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:39,766 INFO L87 Difference]: Start difference. First operand 223872 states and 327491 transitions. Second operand 4 states. [2019-09-08 13:05:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:52,873 INFO L93 Difference]: Finished difference Result 360370 states and 526958 transitions. [2019-09-08 13:05:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:52,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-08 13:05:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:53,171 INFO L225 Difference]: With dead ends: 360370 [2019-09-08 13:05:53,171 INFO L226 Difference]: Without dead ends: 181999 [2019-09-08 13:05:53,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181999 states. [2019-09-08 13:06:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181999 to 181999. [2019-09-08 13:06:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181999 states. [2019-09-08 13:06:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181999 states to 181999 states and 265628 transitions. [2019-09-08 13:06:10,197 INFO L78 Accepts]: Start accepts. Automaton has 181999 states and 265628 transitions. Word has length 121 [2019-09-08 13:06:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:10,198 INFO L475 AbstractCegarLoop]: Abstraction has 181999 states and 265628 transitions. [2019-09-08 13:06:10,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 181999 states and 265628 transitions. [2019-09-08 13:06:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 13:06:10,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:10,204 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:10,204 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1189508418, now seen corresponding path program 1 times [2019-09-08 13:06:10,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:10,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:06:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:10,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:10,261 INFO L87 Difference]: Start difference. First operand 181999 states and 265628 transitions. Second operand 3 states. [2019-09-08 13:06:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:34,061 INFO L93 Difference]: Finished difference Result 463894 states and 675466 transitions. [2019-09-08 13:06:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:34,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 13:06:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:34,525 INFO L225 Difference]: With dead ends: 463894 [2019-09-08 13:06:34,525 INFO L226 Difference]: Without dead ends: 282241 [2019-09-08 13:06:34,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282241 states. [2019-09-08 13:06:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282241 to 185951. [2019-09-08 13:06:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185951 states. [2019-09-08 13:06:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185951 states to 185951 states and 270483 transitions. [2019-09-08 13:06:50,211 INFO L78 Accepts]: Start accepts. Automaton has 185951 states and 270483 transitions. Word has length 123 [2019-09-08 13:06:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:50,211 INFO L475 AbstractCegarLoop]: Abstraction has 185951 states and 270483 transitions. [2019-09-08 13:06:50,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 185951 states and 270483 transitions. [2019-09-08 13:06:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:06:50,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:50,217 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:50,217 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1176955519, now seen corresponding path program 1 times [2019-09-08 13:06:50,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:50,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:06:50,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:50,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:50,358 INFO L87 Difference]: Start difference. First operand 185951 states and 270483 transitions. Second operand 4 states. [2019-09-08 13:07:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:19,569 INFO L93 Difference]: Finished difference Result 540353 states and 784451 transitions. [2019-09-08 13:07:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:19,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 13:07:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:20,144 INFO L225 Difference]: With dead ends: 540353 [2019-09-08 13:07:20,145 INFO L226 Difference]: Without dead ends: 354445 [2019-09-08 13:07:20,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354445 states. [2019-09-08 13:07:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354445 to 354443. [2019-09-08 13:07:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354443 states. [2019-09-08 13:07:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354443 states to 354443 states and 510363 transitions. [2019-09-08 13:07:53,795 INFO L78 Accepts]: Start accepts. Automaton has 354443 states and 510363 transitions. Word has length 124 [2019-09-08 13:07:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:53,795 INFO L475 AbstractCegarLoop]: Abstraction has 354443 states and 510363 transitions. [2019-09-08 13:07:53,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 354443 states and 510363 transitions. [2019-09-08 13:07:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:07:53,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:53,806 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:53,806 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1229350557, now seen corresponding path program 1 times [2019-09-08 13:07:53,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:53,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:53,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:07:53,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:53,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:53,846 INFO L87 Difference]: Start difference. First operand 354443 states and 510363 transitions. Second operand 3 states. [2019-09-08 13:08:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:52,964 INFO L93 Difference]: Finished difference Result 1063127 states and 1530830 transitions. [2019-09-08 13:08:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:52,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:08:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:54,314 INFO L225 Difference]: With dead ends: 1063127 [2019-09-08 13:08:54,314 INFO L226 Difference]: Without dead ends: 708794 [2019-09-08 13:08:54,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708794 states. [2019-09-08 13:09:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708794 to 354449. [2019-09-08 13:09:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354449 states. [2019-09-08 13:09:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354449 states to 354449 states and 510369 transitions. [2019-09-08 13:09:38,780 INFO L78 Accepts]: Start accepts. Automaton has 354449 states and 510369 transitions. Word has length 125 [2019-09-08 13:09:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:38,781 INFO L475 AbstractCegarLoop]: Abstraction has 354449 states and 510369 transitions. [2019-09-08 13:09:38,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 354449 states and 510369 transitions. [2019-09-08 13:09:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:38,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:38,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:38,791 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -441572160, now seen corresponding path program 1 times [2019-09-08 13:09:38,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:38,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 13:09:38,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:38,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:38,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:38,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:38,891 INFO L87 Difference]: Start difference. First operand 354449 states and 510369 transitions. Second operand 4 states. [2019-09-08 13:10:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:14,575 INFO L93 Difference]: Finished difference Result 708856 states and 1020682 transitions. [2019-09-08 13:10:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:14,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-08 13:10:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:15,197 INFO L225 Difference]: With dead ends: 708856 [2019-09-08 13:10:15,197 INFO L226 Difference]: Without dead ends: 354443 [2019-09-08 13:10:15,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354443 states. [2019-09-08 13:10:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354443 to 354443. [2019-09-08 13:10:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354443 states. [2019-09-08 13:10:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354443 states to 354443 states and 510357 transitions. [2019-09-08 13:10:52,479 INFO L78 Accepts]: Start accepts. Automaton has 354443 states and 510357 transitions. Word has length 126 [2019-09-08 13:10:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:52,480 INFO L475 AbstractCegarLoop]: Abstraction has 354443 states and 510357 transitions. [2019-09-08 13:10:52,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 354443 states and 510357 transitions. [2019-09-08 13:10:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:10:52,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:52,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:10:52,491 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -488324446, now seen corresponding path program 1 times [2019-09-08 13:10:52,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:52,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:52,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:10:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:52,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:52,566 INFO L87 Difference]: Start difference. First operand 354443 states and 510357 transitions. Second operand 3 states. [2019-09-08 13:11:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:45,148 INFO L93 Difference]: Finished difference Result 876645 states and 1259708 transitions. [2019-09-08 13:11:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:11:45,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 13:11:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:46,031 INFO L225 Difference]: With dead ends: 876645 [2019-09-08 13:11:46,031 INFO L226 Difference]: Without dead ends: 522979 [2019-09-08 13:11:46,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:11:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522979 states. [2019-09-08 13:12:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522979 to 522977. [2019-09-08 13:12:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522977 states. [2019-09-08 13:12:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522977 states to 522977 states and 742954 transitions. [2019-09-08 13:12:44,395 INFO L78 Accepts]: Start accepts. Automaton has 522977 states and 742954 transitions. Word has length 126 [2019-09-08 13:12:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:44,395 INFO L475 AbstractCegarLoop]: Abstraction has 522977 states and 742954 transitions. [2019-09-08 13:12:44,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:12:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 522977 states and 742954 transitions. [2019-09-08 13:12:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 13:12:44,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:44,412 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:12:44,413 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash -21553747, now seen corresponding path program 1 times [2019-09-08 13:12:44,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:44,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:44,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:44,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:12:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:12:44,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:12:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:12:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:12:44,504 INFO L87 Difference]: Start difference. First operand 522977 states and 742954 transitions. Second operand 5 states. [2019-09-08 13:13:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:42,555 INFO L93 Difference]: Finished difference Result 984374 states and 1398485 transitions. [2019-09-08 13:13:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:13:42,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-08 13:13:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:43,582 INFO L225 Difference]: With dead ends: 984374 [2019-09-08 13:13:43,582 INFO L226 Difference]: Without dead ends: 522977 [2019-09-08 13:13:43,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:13:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522977 states.