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_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:39:07,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:39:07,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:39:07,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:39:07,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:39:07,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:39:07,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:39:07,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:39:07,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:39:07,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:39:07,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:39:07,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:39:07,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:39:07,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:39:07,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:39:07,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:39:07,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:39:07,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:39:07,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:39:07,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:39:07,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:39:07,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:39:07,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:39:07,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:39:07,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:39:07,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:39:07,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:39:07,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:39:07,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:39:07,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:39:07,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:39:07,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:39:07,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:39:07,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:39:07,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:39:07,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:39:07,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:39:07,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:39:07,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:39:07,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:39:07,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:39:07,590 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 09:39:07,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:39:07,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:39:07,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:39:07,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:39:07,625 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:39:07,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:39:07,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:39:07,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:39:07,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:39:07,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:39:07,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:39:07,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:39:07,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:39:07,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:39:07,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:39:07,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:39:07,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:39:07,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:39:07,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:39:07,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:39:07,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:39:07,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:39:07,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:39:07,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:39:07,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:39:07,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:39:07,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:39:07,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:39:07,689 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:39:07,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:39:07,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7db8321/63667e47f18440cf9ef29df233feabf5/FLAGc406ff63a [2019-09-08 09:39:08,280 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:39:08,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:39:08,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7db8321/63667e47f18440cf9ef29df233feabf5/FLAGc406ff63a [2019-09-08 09:39:08,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7db8321/63667e47f18440cf9ef29df233feabf5 [2019-09-08 09:39:08,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:39:08,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:39:08,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:39:08,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:39:08,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:39:08,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:08" (1/1) ... [2019-09-08 09:39:08,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f59ac88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:08, skipping insertion in model container [2019-09-08 09:39:08,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:08" (1/1) ... [2019-09-08 09:39:08,615 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:39:08,692 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:39:09,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:39:09,292 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:39:09,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:39:09,727 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:39:09,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09 WrapperNode [2019-09-08 09:39:09,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:39:09,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:39:09,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:39:09,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:39:09,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (1/1) ... [2019-09-08 09:39:09,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:39:09,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:39:09,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:39:09,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:39:09,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (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 09:39:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:39:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:39:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:39:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:39:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:39:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:39:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:39:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:39:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:39:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:39:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:39:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:39:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:39:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:39:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:39:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:39:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:39:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:39:11,346 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:39:11,347 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:39:11,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:11 BoogieIcfgContainer [2019-09-08 09:39:11,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:39:11,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:39:11,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:39:11,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:39:11,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:39:08" (1/3) ... [2019-09-08 09:39:11,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b13975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:11, skipping insertion in model container [2019-09-08 09:39:11,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:09" (2/3) ... [2019-09-08 09:39:11,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b13975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:11, skipping insertion in model container [2019-09-08 09:39:11,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:11" (3/3) ... [2019-09-08 09:39:11,363 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 09:39:11,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:39:11,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:39:11,404 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:39:11,436 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:39:11,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:39:11,437 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:39:11,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:39:11,438 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:39:11,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:39:11,438 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:39:11,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:39:11,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:39:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-09-08 09:39:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 09:39:11,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:11,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:11,503 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-09-08 09:39:11,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:11,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:12,174 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 09:39:12,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:12,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:12,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:12,200 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-09-08 09:39:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:12,429 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-09-08 09:39:12,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:12,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 09:39:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:12,449 INFO L225 Difference]: With dead ends: 605 [2019-09-08 09:39:12,449 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 09:39:12,454 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 09:39:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 09:39:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-09-08 09:39:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-08 09:39:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-09-08 09:39:12,542 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-09-08 09:39:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:12,543 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-09-08 09:39:12,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-09-08 09:39:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 09:39:12,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:12,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:12,548 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-09-08 09:39:12,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:12,959 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 09:39:12,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:12,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:12,964 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-09-08 09:39:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:13,119 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-09-08 09:39:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:13,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-08 09:39:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:13,127 INFO L225 Difference]: With dead ends: 1423 [2019-09-08 09:39:13,127 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 09:39:13,132 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 09:39:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 09:39:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-09-08 09:39:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-08 09:39:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-09-08 09:39:13,196 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-09-08 09:39:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:13,198 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-09-08 09:39:13,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-09-08 09:39:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 09:39:13,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:13,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:13,209 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-09-08 09:39:13,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:13,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:13,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:13,339 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 09:39:13,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:13,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:13,341 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-09-08 09:39:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:13,429 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-09-08 09:39:13,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:13,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 09:39:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:13,441 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 09:39:13,441 INFO L226 Difference]: Without dead ends: 1872 [2019-09-08 09:39:13,444 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 09:39:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-09-08 09:39:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-09-08 09:39:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-08 09:39:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-09-08 09:39:13,509 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-09-08 09:39:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:13,510 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-09-08 09:39:13,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-09-08 09:39:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:39:13,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:13,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:13,514 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-09-08 09:39:13,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:13,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:13,690 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 09:39:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:13,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:13,692 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-09-08 09:39:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:13,767 INFO L93 Difference]: Finished difference Result 1872 states and 2757 transitions. [2019-09-08 09:39:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:13,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 09:39:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:13,773 INFO L225 Difference]: With dead ends: 1872 [2019-09-08 09:39:13,773 INFO L226 Difference]: Without dead ends: 945 [2019-09-08 09:39:13,775 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 09:39:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-08 09:39:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 944. [2019-09-08 09:39:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-08 09:39:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1388 transitions. [2019-09-08 09:39:13,823 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1388 transitions. Word has length 150 [2019-09-08 09:39:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:13,823 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1388 transitions. [2019-09-08 09:39:13,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1388 transitions. [2019-09-08 09:39:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:39:13,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:13,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:13,827 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -192101545, now seen corresponding path program 1 times [2019-09-08 09:39:13,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:13,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:14,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:14,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:14,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:14,094 INFO L87 Difference]: Start difference. First operand 944 states and 1388 transitions. Second operand 4 states. [2019-09-08 09:39:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:14,188 INFO L93 Difference]: Finished difference Result 1875 states and 2759 transitions. [2019-09-08 09:39:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:14,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 09:39:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:14,197 INFO L225 Difference]: With dead ends: 1875 [2019-09-08 09:39:14,197 INFO L226 Difference]: Without dead ends: 942 [2019-09-08 09:39:14,200 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 09:39:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-08 09:39:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2019-09-08 09:39:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-09-08 09:39:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1384 transitions. [2019-09-08 09:39:14,261 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1384 transitions. Word has length 150 [2019-09-08 09:39:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:14,262 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1384 transitions. [2019-09-08 09:39:14,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1384 transitions. [2019-09-08 09:39:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:39:14,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:14,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:14,268 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-09-08 09:39:14,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:14,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:14,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:14,427 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 09:39:14,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:14,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:14,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:14,429 INFO L87 Difference]: Start difference. First operand 942 states and 1384 transitions. Second operand 3 states. [2019-09-08 09:39:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:14,580 INFO L93 Difference]: Finished difference Result 2159 states and 3190 transitions. [2019-09-08 09:39:14,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:14,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:39:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:14,589 INFO L225 Difference]: With dead ends: 2159 [2019-09-08 09:39:14,589 INFO L226 Difference]: Without dead ends: 1396 [2019-09-08 09:39:14,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 09:39:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-08 09:39:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-08 09:39:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-08 09:39:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2022 transitions. [2019-09-08 09:39:14,682 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2022 transitions. Word has length 150 [2019-09-08 09:39:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:14,683 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2022 transitions. [2019-09-08 09:39:14,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2022 transitions. [2019-09-08 09:39:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:39:14,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:14,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:14,688 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-09-08 09:39:14,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:14,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:14,866 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 09:39:14,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:14,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:14,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:14,869 INFO L87 Difference]: Start difference. First operand 1394 states and 2022 transitions. Second operand 3 states. [2019-09-08 09:39:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:15,298 INFO L93 Difference]: Finished difference Result 3707 states and 5440 transitions. [2019-09-08 09:39:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:15,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 09:39:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:15,314 INFO L225 Difference]: With dead ends: 3707 [2019-09-08 09:39:15,314 INFO L226 Difference]: Without dead ends: 2595 [2019-09-08 09:39:15,320 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 09:39:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-09-08 09:39:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-09-08 09:39:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-09-08 09:39:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3761 transitions. [2019-09-08 09:39:15,468 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3761 transitions. Word has length 156 [2019-09-08 09:39:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:15,469 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 3761 transitions. [2019-09-08 09:39:15,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3761 transitions. [2019-09-08 09:39:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:39:15,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:15,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:15,476 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-09-08 09:39:15,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:15,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:16,234 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 09:39:16,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:16,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:39:16,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:39:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:39:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:39:16,237 INFO L87 Difference]: Start difference. First operand 2593 states and 3761 transitions. Second operand 17 states. [2019-09-08 09:39:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:18,745 INFO L93 Difference]: Finished difference Result 8173 states and 12271 transitions. [2019-09-08 09:39:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:39:18,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 156 [2019-09-08 09:39:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:18,778 INFO L225 Difference]: With dead ends: 8173 [2019-09-08 09:39:18,779 INFO L226 Difference]: Without dead ends: 6957 [2019-09-08 09:39:18,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 09:39:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-08 09:39:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 5028. [2019-09-08 09:39:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-09-08 09:39:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7307 transitions. [2019-09-08 09:39:19,183 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7307 transitions. Word has length 156 [2019-09-08 09:39:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:19,183 INFO L475 AbstractCegarLoop]: Abstraction has 5028 states and 7307 transitions. [2019-09-08 09:39:19,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:39:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7307 transitions. [2019-09-08 09:39:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 09:39:19,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:19,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:19,193 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-09-08 09:39:19,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:19,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:19,390 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 09:39:19,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:19,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:19,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:19,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:19,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:19,392 INFO L87 Difference]: Start difference. First operand 5028 states and 7307 transitions. Second operand 4 states. [2019-09-08 09:39:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:19,834 INFO L93 Difference]: Finished difference Result 13206 states and 19167 transitions. [2019-09-08 09:39:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:19,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 09:39:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:19,876 INFO L225 Difference]: With dead ends: 13206 [2019-09-08 09:39:19,876 INFO L226 Difference]: Without dead ends: 8209 [2019-09-08 09:39:19,888 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 09:39:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8209 states. [2019-09-08 09:39:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8209 to 8207. [2019-09-08 09:39:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8207 states. [2019-09-08 09:39:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 11775 transitions. [2019-09-08 09:39:20,416 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 11775 transitions. Word has length 156 [2019-09-08 09:39:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:20,417 INFO L475 AbstractCegarLoop]: Abstraction has 8207 states and 11775 transitions. [2019-09-08 09:39:20,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 11775 transitions. [2019-09-08 09:39:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:39:20,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:20,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:20,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-09-08 09:39:20,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:20,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:20,532 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 09:39:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:20,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:20,534 INFO L87 Difference]: Start difference. First operand 8207 states and 11775 transitions. Second operand 3 states. [2019-09-08 09:39:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:21,383 INFO L93 Difference]: Finished difference Result 20397 states and 29264 transitions. [2019-09-08 09:39:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:21,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 09:39:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:21,418 INFO L225 Difference]: With dead ends: 20397 [2019-09-08 09:39:21,419 INFO L226 Difference]: Without dead ends: 12729 [2019-09-08 09:39:21,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 09:39:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2019-09-08 09:39:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 12727. [2019-09-08 09:39:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12727 states. [2019-09-08 09:39:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12727 states to 12727 states and 17986 transitions. [2019-09-08 09:39:22,245 INFO L78 Accepts]: Start accepts. Automaton has 12727 states and 17986 transitions. Word has length 158 [2019-09-08 09:39:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:22,246 INFO L475 AbstractCegarLoop]: Abstraction has 12727 states and 17986 transitions. [2019-09-08 09:39:22,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 12727 states and 17986 transitions. [2019-09-08 09:39:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 09:39:22,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:22,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:22,267 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-09-08 09:39:22,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:22,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:22,459 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 09:39:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:22,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:22,461 INFO L87 Difference]: Start difference. First operand 12727 states and 17986 transitions. Second operand 4 states. [2019-09-08 09:39:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:23,950 INFO L93 Difference]: Finished difference Result 37239 states and 52466 transitions. [2019-09-08 09:39:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:23,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 09:39:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:24,006 INFO L225 Difference]: With dead ends: 37239 [2019-09-08 09:39:24,007 INFO L226 Difference]: Without dead ends: 24555 [2019-09-08 09:39:24,032 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 09:39:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24555 states. [2019-09-08 09:39:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24555 to 24553. [2019-09-08 09:39:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24553 states. [2019-09-08 09:39:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24553 states to 24553 states and 34220 transitions. [2019-09-08 09:39:25,461 INFO L78 Accepts]: Start accepts. Automaton has 24553 states and 34220 transitions. Word has length 164 [2019-09-08 09:39:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:25,461 INFO L475 AbstractCegarLoop]: Abstraction has 24553 states and 34220 transitions. [2019-09-08 09:39:25,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 24553 states and 34220 transitions. [2019-09-08 09:39:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 09:39:25,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:25,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:25,501 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-09-08 09:39:25,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:25,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:25,562 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 09:39:25,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:25,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:25,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:25,564 INFO L87 Difference]: Start difference. First operand 24553 states and 34220 transitions. Second operand 3 states. [2019-09-08 09:39:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:27,111 INFO L93 Difference]: Finished difference Result 73455 states and 102399 transitions. [2019-09-08 09:39:27,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:27,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 09:39:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:27,221 INFO L225 Difference]: With dead ends: 73455 [2019-09-08 09:39:27,221 INFO L226 Difference]: Without dead ends: 49013 [2019-09-08 09:39:27,265 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 09:39:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49013 states. [2019-09-08 09:39:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49013 to 24559. [2019-09-08 09:39:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24559 states. [2019-09-08 09:39:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24559 states to 24559 states and 34226 transitions. [2019-09-08 09:39:29,240 INFO L78 Accepts]: Start accepts. Automaton has 24559 states and 34226 transitions. Word has length 165 [2019-09-08 09:39:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:29,240 INFO L475 AbstractCegarLoop]: Abstraction has 24559 states and 34226 transitions. [2019-09-08 09:39:29,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24559 states and 34226 transitions. [2019-09-08 09:39:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:39:29,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:29,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:29,280 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-09-08 09:39:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:29,402 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 09:39:29,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:29,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:29,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:29,405 INFO L87 Difference]: Start difference. First operand 24559 states and 34226 transitions. Second operand 3 states. [2019-09-08 09:39:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:31,134 INFO L93 Difference]: Finished difference Result 66364 states and 92091 transitions. [2019-09-08 09:39:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:31,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 09:39:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:31,201 INFO L225 Difference]: With dead ends: 66364 [2019-09-08 09:39:31,201 INFO L226 Difference]: Without dead ends: 42950 [2019-09-08 09:39:31,237 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 09:39:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42950 states. [2019-09-08 09:39:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42950 to 42948. [2019-09-08 09:39:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42948 states. [2019-09-08 09:39:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42948 states to 42948 states and 58661 transitions. [2019-09-08 09:39:33,999 INFO L78 Accepts]: Start accepts. Automaton has 42948 states and 58661 transitions. Word has length 166 [2019-09-08 09:39:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:33,999 INFO L475 AbstractCegarLoop]: Abstraction has 42948 states and 58661 transitions. [2019-09-08 09:39:33,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 42948 states and 58661 transitions. [2019-09-08 09:39:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:39:34,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:34,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:34,033 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-09-08 09:39:34,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:34,174 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 09:39:34,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:34,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:34,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:34,176 INFO L87 Difference]: Start difference. First operand 42948 states and 58661 transitions. Second operand 4 states. [2019-09-08 09:39:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:35,868 INFO L93 Difference]: Finished difference Result 78385 states and 107326 transitions. [2019-09-08 09:39:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:35,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 09:39:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:35,913 INFO L225 Difference]: With dead ends: 78385 [2019-09-08 09:39:35,914 INFO L226 Difference]: Without dead ends: 36424 [2019-09-08 09:39:35,955 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 09:39:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36424 states. [2019-09-08 09:39:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36424 to 36424. [2019-09-08 09:39:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36424 states. [2019-09-08 09:39:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36424 states to 36424 states and 49846 transitions. [2019-09-08 09:39:37,699 INFO L78 Accepts]: Start accepts. Automaton has 36424 states and 49846 transitions. Word has length 166 [2019-09-08 09:39:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:37,699 INFO L475 AbstractCegarLoop]: Abstraction has 36424 states and 49846 transitions. [2019-09-08 09:39:37,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 36424 states and 49846 transitions. [2019-09-08 09:39:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:39:37,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:37,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:37,721 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1043597530, now seen corresponding path program 1 times [2019-09-08 09:39:37,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:37,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:37,797 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 09:39:37,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:37,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:37,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:37,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:37,799 INFO L87 Difference]: Start difference. First operand 36424 states and 49846 transitions. Second operand 3 states. [2019-09-08 09:39:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:40,579 INFO L93 Difference]: Finished difference Result 59984 states and 84196 transitions. [2019-09-08 09:39:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:40,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 09:39:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:40,621 INFO L225 Difference]: With dead ends: 59984 [2019-09-08 09:39:40,622 INFO L226 Difference]: Without dead ends: 40862 [2019-09-08 09:39:40,645 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 09:39:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40862 states. [2019-09-08 09:39:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40862 to 40860. [2019-09-08 09:39:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40860 states. [2019-09-08 09:39:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40860 states to 40860 states and 56505 transitions. [2019-09-08 09:39:42,364 INFO L78 Accepts]: Start accepts. Automaton has 40860 states and 56505 transitions. Word has length 172 [2019-09-08 09:39:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:42,364 INFO L475 AbstractCegarLoop]: Abstraction has 40860 states and 56505 transitions. [2019-09-08 09:39:42,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 40860 states and 56505 transitions. [2019-09-08 09:39:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:39:42,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:42,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:42,392 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash -668932181, now seen corresponding path program 1 times [2019-09-08 09:39:42,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:42,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:42,489 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 09:39:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:42,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:42,491 INFO L87 Difference]: Start difference. First operand 40860 states and 56505 transitions. Second operand 3 states. [2019-09-08 09:39:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:45,343 INFO L93 Difference]: Finished difference Result 101205 states and 141529 transitions. [2019-09-08 09:39:45,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:45,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 09:39:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:45,450 INFO L225 Difference]: With dead ends: 101205 [2019-09-08 09:39:45,450 INFO L226 Difference]: Without dead ends: 72424 [2019-09-08 09:39:45,499 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 09:39:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72424 states. [2019-09-08 09:39:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72424 to 72422. [2019-09-08 09:39:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72422 states. [2019-09-08 09:39:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72422 states to 72422 states and 99984 transitions. [2019-09-08 09:39:50,286 INFO L78 Accepts]: Start accepts. Automaton has 72422 states and 99984 transitions. Word has length 172 [2019-09-08 09:39:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:50,286 INFO L475 AbstractCegarLoop]: Abstraction has 72422 states and 99984 transitions. [2019-09-08 09:39:50,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 72422 states and 99984 transitions. [2019-09-08 09:39:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:39:50,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:50,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:50,337 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -801167312, now seen corresponding path program 1 times [2019-09-08 09:39:50,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:50,566 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 09:39:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:39:50,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:39:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:39:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:39:50,567 INFO L87 Difference]: Start difference. First operand 72422 states and 99984 transitions. Second operand 10 states. [2019-09-08 09:39:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:52,828 INFO L93 Difference]: Finished difference Result 94938 states and 132677 transitions. [2019-09-08 09:39:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:52,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2019-09-08 09:39:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:52,882 INFO L225 Difference]: With dead ends: 94938 [2019-09-08 09:39:52,882 INFO L226 Difference]: Without dead ends: 44896 [2019-09-08 09:39:52,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:39:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44896 states. [2019-09-08 09:39:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44896 to 36606. [2019-09-08 09:39:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36606 states. [2019-09-08 09:39:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36606 states to 36606 states and 49074 transitions. [2019-09-08 09:39:55,082 INFO L78 Accepts]: Start accepts. Automaton has 36606 states and 49074 transitions. Word has length 172 [2019-09-08 09:39:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:55,083 INFO L475 AbstractCegarLoop]: Abstraction has 36606 states and 49074 transitions. [2019-09-08 09:39:55,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:39:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36606 states and 49074 transitions. [2019-09-08 09:39:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:39:55,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:55,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:55,104 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1602307110, now seen corresponding path program 1 times [2019-09-08 09:39:55,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:55,330 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 09:39:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:39:55,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:39:55,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:39:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:39:55,332 INFO L87 Difference]: Start difference. First operand 36606 states and 49074 transitions. Second operand 9 states. [2019-09-08 09:39:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:58,262 INFO L93 Difference]: Finished difference Result 45410 states and 62310 transitions. [2019-09-08 09:39:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:58,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-09-08 09:39:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:58,297 INFO L225 Difference]: With dead ends: 45410 [2019-09-08 09:39:58,297 INFO L226 Difference]: Without dead ends: 36608 [2019-09-08 09:39:58,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:39:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36608 states. [2019-09-08 09:39:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36608 to 36606. [2019-09-08 09:39:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36606 states. [2019-09-08 09:39:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36606 states to 36606 states and 48826 transitions. [2019-09-08 09:39:59,936 INFO L78 Accepts]: Start accepts. Automaton has 36606 states and 48826 transitions. Word has length 172 [2019-09-08 09:39:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:59,936 INFO L475 AbstractCegarLoop]: Abstraction has 36606 states and 48826 transitions. [2019-09-08 09:39:59,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:39:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36606 states and 48826 transitions. [2019-09-08 09:39:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:39:59,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:59,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:59,960 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1518935673, now seen corresponding path program 1 times [2019-09-08 09:39:59,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:00,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:40:00,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:40:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:40:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:40:00,181 INFO L87 Difference]: Start difference. First operand 36606 states and 48826 transitions. Second operand 6 states. [2019-09-08 09:40:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:04,490 INFO L93 Difference]: Finished difference Result 85468 states and 124426 transitions. [2019-09-08 09:40:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:40:04,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-08 09:40:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:04,576 INFO L225 Difference]: With dead ends: 85468 [2019-09-08 09:40:04,576 INFO L226 Difference]: Without dead ends: 73185 [2019-09-08 09:40:04,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:40:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73185 states. [2019-09-08 09:40:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73185 to 72639. [2019-09-08 09:40:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72639 states. [2019-09-08 09:40:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72639 states to 72639 states and 103408 transitions. [2019-09-08 09:40:10,532 INFO L78 Accepts]: Start accepts. Automaton has 72639 states and 103408 transitions. Word has length 172 [2019-09-08 09:40:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:10,533 INFO L475 AbstractCegarLoop]: Abstraction has 72639 states and 103408 transitions. [2019-09-08 09:40:10,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:40:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72639 states and 103408 transitions. [2019-09-08 09:40:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:40:10,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:10,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:10,555 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash -134187673, now seen corresponding path program 1 times [2019-09-08 09:40:10,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:10,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:10,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:10,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:10,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:40:10,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:40:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:40:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:40:10,771 INFO L87 Difference]: Start difference. First operand 72639 states and 103408 transitions. Second operand 8 states. [2019-09-08 09:40:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:15,011 INFO L93 Difference]: Finished difference Result 122163 states and 178952 transitions. [2019-09-08 09:40:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:15,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-09-08 09:40:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:15,112 INFO L225 Difference]: With dead ends: 122163 [2019-09-08 09:40:15,112 INFO L226 Difference]: Without dead ends: 72641 [2019-09-08 09:40:15,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:40:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72641 states. [2019-09-08 09:40:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72641 to 72639. [2019-09-08 09:40:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72639 states. [2019-09-08 09:40:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72639 states to 72639 states and 102958 transitions. [2019-09-08 09:40:19,942 INFO L78 Accepts]: Start accepts. Automaton has 72639 states and 102958 transitions. Word has length 172 [2019-09-08 09:40:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:19,943 INFO L475 AbstractCegarLoop]: Abstraction has 72639 states and 102958 transitions. [2019-09-08 09:40:19,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:40:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 72639 states and 102958 transitions. [2019-09-08 09:40:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:40:19,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:19,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:19,963 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash 323129642, now seen corresponding path program 1 times [2019-09-08 09:40:19,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:19,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:19,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:19,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:19,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:20,483 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 09:40:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:40:20,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:40:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:40:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:40:20,485 INFO L87 Difference]: Start difference. First operand 72639 states and 102958 transitions. Second operand 16 states. [2019-09-08 09:40:22,305 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-09-08 09:40:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:30,860 INFO L93 Difference]: Finished difference Result 130509 states and 187435 transitions. [2019-09-08 09:40:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 09:40:30,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 172 [2019-09-08 09:40:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:31,036 INFO L225 Difference]: With dead ends: 130509 [2019-09-08 09:40:31,036 INFO L226 Difference]: Without dead ends: 116535 [2019-09-08 09:40:31,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 09:40:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116535 states. [2019-09-08 09:40:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116535 to 74551. [2019-09-08 09:40:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74551 states. [2019-09-08 09:40:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74551 states to 74551 states and 105196 transitions. [2019-09-08 09:40:36,981 INFO L78 Accepts]: Start accepts. Automaton has 74551 states and 105196 transitions. Word has length 172 [2019-09-08 09:40:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:36,982 INFO L475 AbstractCegarLoop]: Abstraction has 74551 states and 105196 transitions. [2019-09-08 09:40:36,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:40:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74551 states and 105196 transitions. [2019-09-08 09:40:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 09:40:37,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:37,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:37,005 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1983572546, now seen corresponding path program 1 times [2019-09-08 09:40:37,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:37,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:37,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:37,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:37,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:37,181 INFO L87 Difference]: Start difference. First operand 74551 states and 105196 transitions. Second operand 4 states. [2019-09-08 09:40:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:44,052 INFO L93 Difference]: Finished difference Result 144045 states and 203212 transitions. [2019-09-08 09:40:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:44,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-08 09:40:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:44,148 INFO L225 Difference]: With dead ends: 144045 [2019-09-08 09:40:44,149 INFO L226 Difference]: Without dead ends: 69960 [2019-09-08 09:40:44,208 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 09:40:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69960 states. [2019-09-08 09:40:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69960 to 69868. [2019-09-08 09:40:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69868 states. [2019-09-08 09:40:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69868 states to 69868 states and 98438 transitions. [2019-09-08 09:40:49,143 INFO L78 Accepts]: Start accepts. Automaton has 69868 states and 98438 transitions. Word has length 172 [2019-09-08 09:40:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:49,144 INFO L475 AbstractCegarLoop]: Abstraction has 69868 states and 98438 transitions. [2019-09-08 09:40:49,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 69868 states and 98438 transitions. [2019-09-08 09:40:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:40:49,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:49,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:49,163 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash 920545503, now seen corresponding path program 1 times [2019-09-08 09:40:49,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:49,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:49,359 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 09:40:49,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:49,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:49,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:49,361 INFO L87 Difference]: Start difference. First operand 69868 states and 98438 transitions. Second operand 4 states. [2019-09-08 09:40:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:54,606 INFO L93 Difference]: Finished difference Result 140009 states and 197217 transitions. [2019-09-08 09:40:54,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:54,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-08 09:40:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:54,692 INFO L225 Difference]: With dead ends: 140009 [2019-09-08 09:40:54,692 INFO L226 Difference]: Without dead ends: 70296 [2019-09-08 09:40:54,738 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 09:40:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70296 states. [2019-09-08 09:41:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70296 to 70063. [2019-09-08 09:41:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70063 states. [2019-09-08 09:41:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70063 states to 70063 states and 98652 transitions. [2019-09-08 09:41:01,554 INFO L78 Accepts]: Start accepts. Automaton has 70063 states and 98652 transitions. Word has length 174 [2019-09-08 09:41:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:01,554 INFO L475 AbstractCegarLoop]: Abstraction has 70063 states and 98652 transitions. [2019-09-08 09:41:01,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 70063 states and 98652 transitions. [2019-09-08 09:41:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 09:41:01,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:01,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:01,574 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1952765221, now seen corresponding path program 1 times [2019-09-08 09:41:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:01,630 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 09:41:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:01,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:01,634 INFO L87 Difference]: Start difference. First operand 70063 states and 98652 transitions. Second operand 3 states. [2019-09-08 09:41:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:12,247 INFO L93 Difference]: Finished difference Result 193124 states and 271965 transitions. [2019-09-08 09:41:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:12,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 09:41:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:12,423 INFO L225 Difference]: With dead ends: 193124 [2019-09-08 09:41:12,423 INFO L226 Difference]: Without dead ends: 139921 [2019-09-08 09:41:12,479 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 09:41:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139921 states. [2019-09-08 09:41:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139921 to 70073. [2019-09-08 09:41:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70073 states. [2019-09-08 09:41:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70073 states to 70073 states and 98662 transitions. [2019-09-08 09:41:21,422 INFO L78 Accepts]: Start accepts. Automaton has 70073 states and 98662 transitions. Word has length 175 [2019-09-08 09:41:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:21,422 INFO L475 AbstractCegarLoop]: Abstraction has 70073 states and 98662 transitions. [2019-09-08 09:41:21,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 70073 states and 98662 transitions. [2019-09-08 09:41:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:41:21,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:21,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:21,443 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 246843552, now seen corresponding path program 1 times [2019-09-08 09:41:21,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:21,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:21,556 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 09:41:21,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:21,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:21,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:21,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:21,558 INFO L87 Difference]: Start difference. First operand 70073 states and 98662 transitions. Second operand 4 states. [2019-09-08 09:41:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:27,159 INFO L93 Difference]: Finished difference Result 123983 states and 174354 transitions. [2019-09-08 09:41:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:27,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 09:41:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:27,242 INFO L225 Difference]: With dead ends: 123983 [2019-09-08 09:41:27,242 INFO L226 Difference]: Without dead ends: 70063 [2019-09-08 09:41:27,283 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 09:41:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2019-09-08 09:41:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 70063. [2019-09-08 09:41:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70063 states. [2019-09-08 09:41:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70063 states to 70063 states and 98647 transitions. [2019-09-08 09:41:32,920 INFO L78 Accepts]: Start accepts. Automaton has 70063 states and 98647 transitions. Word has length 176 [2019-09-08 09:41:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:32,920 INFO L475 AbstractCegarLoop]: Abstraction has 70063 states and 98647 transitions. [2019-09-08 09:41:32,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 70063 states and 98647 transitions. [2019-09-08 09:41:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 09:41:32,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:32,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:32,941 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1598358574, now seen corresponding path program 1 times [2019-09-08 09:41:32,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:32,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:32,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:33,075 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 09:41:33,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:33,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:33,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:33,077 INFO L87 Difference]: Start difference. First operand 70063 states and 98647 transitions. Second operand 4 states. [2019-09-08 09:41:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:38,417 INFO L93 Difference]: Finished difference Result 130835 states and 184140 transitions. [2019-09-08 09:41:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:38,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 09:41:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:38,488 INFO L225 Difference]: With dead ends: 130835 [2019-09-08 09:41:38,488 INFO L226 Difference]: Without dead ends: 61195 [2019-09-08 09:41:38,535 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 09:41:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61195 states. [2019-09-08 09:41:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61195 to 60736. [2019-09-08 09:41:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60736 states. [2019-09-08 09:41:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60736 states to 60736 states and 85390 transitions. [2019-09-08 09:41:45,418 INFO L78 Accepts]: Start accepts. Automaton has 60736 states and 85390 transitions. Word has length 176 [2019-09-08 09:41:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:45,418 INFO L475 AbstractCegarLoop]: Abstraction has 60736 states and 85390 transitions. [2019-09-08 09:41:45,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 60736 states and 85390 transitions. [2019-09-08 09:41:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:41:45,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:45,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:45,434 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1729659236, now seen corresponding path program 1 times [2019-09-08 09:41:45,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:45,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:45,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:45,520 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 09:41:45,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:45,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:45,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:45,521 INFO L87 Difference]: Start difference. First operand 60736 states and 85390 transitions. Second operand 3 states. [2019-09-08 09:41:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:52,208 INFO L93 Difference]: Finished difference Result 108301 states and 155111 transitions. [2019-09-08 09:41:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:52,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:41:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:52,295 INFO L225 Difference]: With dead ends: 108301 [2019-09-08 09:41:52,295 INFO L226 Difference]: Without dead ends: 70792 [2019-09-08 09:41:52,330 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 09:41:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70792 states. [2019-09-08 09:41:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70792 to 70790. [2019-09-08 09:41:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70790 states. [2019-09-08 09:41:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70790 states to 70790 states and 100145 transitions. [2019-09-08 09:41:58,715 INFO L78 Accepts]: Start accepts. Automaton has 70790 states and 100145 transitions. Word has length 178 [2019-09-08 09:41:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:58,716 INFO L475 AbstractCegarLoop]: Abstraction has 70790 states and 100145 transitions. [2019-09-08 09:41:58,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 70790 states and 100145 transitions. [2019-09-08 09:41:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:41:58,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:58,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:58,740 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash 629623711, now seen corresponding path program 1 times [2019-09-08 09:41:58,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:59,149 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 09:41:59,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:59,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:59,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:59,151 INFO L87 Difference]: Start difference. First operand 70790 states and 100145 transitions. Second operand 3 states. [2019-09-08 09:42:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:11,419 INFO L93 Difference]: Finished difference Result 201048 states and 285780 transitions. [2019-09-08 09:42:11,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:11,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:42:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:11,619 INFO L225 Difference]: With dead ends: 201048 [2019-09-08 09:42:11,619 INFO L226 Difference]: Without dead ends: 138240 [2019-09-08 09:42:11,693 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 09:42:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138240 states. [2019-09-08 09:42:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138240 to 138238. [2019-09-08 09:42:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138238 states. [2019-09-08 09:42:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138238 states to 138238 states and 193824 transitions. [2019-09-08 09:42:23,633 INFO L78 Accepts]: Start accepts. Automaton has 138238 states and 193824 transitions. Word has length 178 [2019-09-08 09:42:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:23,634 INFO L475 AbstractCegarLoop]: Abstraction has 138238 states and 193824 transitions. [2019-09-08 09:42:23,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 138238 states and 193824 transitions. [2019-09-08 09:42:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:42:23,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:23,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:23,671 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash 877619674, now seen corresponding path program 1 times [2019-09-08 09:42:23,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:23,806 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 09:42:23,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:23,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:42:23,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:42:23,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:42:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:42:23,808 INFO L87 Difference]: Start difference. First operand 138238 states and 193824 transitions. Second operand 5 states. [2019-09-08 09:42:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:36,254 INFO L93 Difference]: Finished difference Result 212000 states and 299474 transitions. [2019-09-08 09:42:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:42:36,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 09:42:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:36,418 INFO L225 Difference]: With dead ends: 212000 [2019-09-08 09:42:36,418 INFO L226 Difference]: Without dead ends: 108313 [2019-09-08 09:42:36,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:42:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108313 states. [2019-09-08 09:42:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108313 to 108311. [2019-09-08 09:42:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108311 states. [2019-09-08 09:42:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108311 states to 108311 states and 152588 transitions. [2019-09-08 09:42:46,155 INFO L78 Accepts]: Start accepts. Automaton has 108311 states and 152588 transitions. Word has length 178 [2019-09-08 09:42:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:46,155 INFO L475 AbstractCegarLoop]: Abstraction has 108311 states and 152588 transitions. [2019-09-08 09:42:46,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:42:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108311 states and 152588 transitions. [2019-09-08 09:42:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:42:46,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:46,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:46,183 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -497687846, now seen corresponding path program 1 times [2019-09-08 09:42:46,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:46,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:46,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:46,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:42:46,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:46,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:42:46,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:42:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:42:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:42:46,362 INFO L87 Difference]: Start difference. First operand 108311 states and 152588 transitions. Second operand 8 states. [2019-09-08 09:43:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:19,998 INFO L93 Difference]: Finished difference Result 408209 states and 594308 transitions. [2019-09-08 09:43:19,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 09:43:19,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 09:43:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:20,506 INFO L225 Difference]: With dead ends: 408209 [2019-09-08 09:43:20,506 INFO L226 Difference]: Without dead ends: 327867 [2019-09-08 09:43:20,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:43:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327867 states. [2019-09-08 09:43:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327867 to 315494. [2019-09-08 09:43:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315494 states. [2019-09-08 09:43:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315494 states to 315494 states and 454761 transitions. [2019-09-08 09:43:59,916 INFO L78 Accepts]: Start accepts. Automaton has 315494 states and 454761 transitions. Word has length 178 [2019-09-08 09:43:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:59,916 INFO L475 AbstractCegarLoop]: Abstraction has 315494 states and 454761 transitions. [2019-09-08 09:43:59,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:43:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 315494 states and 454761 transitions. [2019-09-08 09:43:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:43:59,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:59,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:59,966 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash 398907811, now seen corresponding path program 1 times [2019-09-08 09:43:59,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:00,835 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 09:44:00,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:00,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:44:00,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:44:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:44:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:44:00,836 INFO L87 Difference]: Start difference. First operand 315494 states and 454761 transitions. Second operand 21 states. [2019-09-08 09:44:03,607 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 09:44:03,862 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 09:44:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:53,052 INFO L93 Difference]: Finished difference Result 560727 states and 814014 transitions. [2019-09-08 09:44:53,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 09:44:53,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 178 [2019-09-08 09:44:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:53,700 INFO L225 Difference]: With dead ends: 560727 [2019-09-08 09:44:53,700 INFO L226 Difference]: Without dead ends: 413169 [2019-09-08 09:44:53,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 09:44:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413169 states. [2019-09-08 09:45:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413169 to 324214. [2019-09-08 09:45:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324214 states. [2019-09-08 09:45:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324214 states to 324214 states and 464837 transitions. [2019-09-08 09:45:34,896 INFO L78 Accepts]: Start accepts. Automaton has 324214 states and 464837 transitions. Word has length 178 [2019-09-08 09:45:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:34,897 INFO L475 AbstractCegarLoop]: Abstraction has 324214 states and 464837 transitions. [2019-09-08 09:45:34,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 09:45:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 324214 states and 464837 transitions. [2019-09-08 09:45:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:45:34,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:34,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:34,965 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1242603885, now seen corresponding path program 1 times [2019-09-08 09:45:34,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:34,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:36,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:36,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:45:36,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:45:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:45:36,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:45:36,363 INFO L87 Difference]: Start difference. First operand 324214 states and 464837 transitions. Second operand 25 states. [2019-09-08 09:45:37,233 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 09:45:38,706 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 09:46:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:41,670 INFO L93 Difference]: Finished difference Result 599653 states and 872682 transitions. [2019-09-08 09:46:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:46:41,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-09-08 09:46:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:42,520 INFO L225 Difference]: With dead ends: 599653 [2019-09-08 09:46:42,521 INFO L226 Difference]: Without dead ends: 482051 [2019-09-08 09:46:42,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:46:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482051 states. [2019-09-08 09:47:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482051 to 326927. [2019-09-08 09:47:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326927 states. [2019-09-08 09:47:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326927 states to 326927 states and 467976 transitions. [2019-09-08 09:47:28,433 INFO L78 Accepts]: Start accepts. Automaton has 326927 states and 467976 transitions. Word has length 178 [2019-09-08 09:47:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:28,434 INFO L475 AbstractCegarLoop]: Abstraction has 326927 states and 467976 transitions. [2019-09-08 09:47:28,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:47:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 326927 states and 467976 transitions. [2019-09-08 09:47:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:28,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:28,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:28,495 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash -791507543, now seen corresponding path program 1 times [2019-09-08 09:47:28,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:28,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:28,750 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 09:47:28,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:28,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 09:47:28,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 09:47:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 09:47:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:47:28,752 INFO L87 Difference]: Start difference. First operand 326927 states and 467976 transitions. Second operand 11 states. [2019-09-08 09:48:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:09,618 INFO L93 Difference]: Finished difference Result 614125 states and 889657 transitions. [2019-09-08 09:48:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:48:09,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-09-08 09:48:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:10,091 INFO L225 Difference]: With dead ends: 614125 [2019-09-08 09:48:10,091 INFO L226 Difference]: Without dead ends: 297006 [2019-09-08 09:48:10,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:48:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297006 states. [2019-09-08 09:48:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297006 to 188442. [2019-09-08 09:48:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188442 states. [2019-09-08 09:48:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188442 states to 188442 states and 268761 transitions. [2019-09-08 09:48:34,390 INFO L78 Accepts]: Start accepts. Automaton has 188442 states and 268761 transitions. Word has length 178 [2019-09-08 09:48:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:34,391 INFO L475 AbstractCegarLoop]: Abstraction has 188442 states and 268761 transitions. [2019-09-08 09:48:34,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 09:48:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 188442 states and 268761 transitions. [2019-09-08 09:48:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:48:34,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:34,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:34,427 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash -543511580, now seen corresponding path program 1 times [2019-09-08 09:48:34,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:34,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:35,323 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-09-08 09:48:36,158 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 09:48:36,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:36,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 09:48:36,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 09:48:36,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 09:48:36,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-08 09:48:36,160 INFO L87 Difference]: Start difference. First operand 188442 states and 268761 transitions. Second operand 22 states. [2019-09-08 09:48:36,847 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 09:48:38,071 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-08 09:48:38,297 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 09:48:39,767 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 09:48:40,317 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 09:48:40,712 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 09:48:40,975 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-08 09:48:41,773 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 09:48:42,389 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-08 09:48:42,705 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-08 09:48:43,393 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 09:48:43,704 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 09:48:46,626 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 09:48:46,831 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 09:48:47,973 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-08 09:48:49,032 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 09:48:50,131 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 09:48:50,839 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-08 09:49:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:36,908 INFO L93 Difference]: Finished difference Result 401891 states and 581980 transitions. [2019-09-08 09:49:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 09:49:36,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-09-08 09:49:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:37,400 INFO L225 Difference]: With dead ends: 401891 [2019-09-08 09:49:37,401 INFO L226 Difference]: Without dead ends: 334303 [2019-09-08 09:49:37,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=698, Invalid=2272, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 09:49:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334303 states. [2019-09-08 09:50:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334303 to 189454. [2019-09-08 09:50:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189454 states. [2019-09-08 09:50:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189454 states to 189454 states and 269896 transitions. [2019-09-08 09:50:03,399 INFO L78 Accepts]: Start accepts. Automaton has 189454 states and 269896 transitions. Word has length 178 [2019-09-08 09:50:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:03,399 INFO L475 AbstractCegarLoop]: Abstraction has 189454 states and 269896 transitions. [2019-09-08 09:50:03,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 09:50:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 189454 states and 269896 transitions. [2019-09-08 09:50:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:50:03,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:03,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:03,434 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:03,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1674053606, now seen corresponding path program 1 times [2019-09-08 09:50:03,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:03,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:03,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:03,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:03,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:03,580 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 09:50:03,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:50:03,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:50:03,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:50:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:50:03,583 INFO L87 Difference]: Start difference. First operand 189454 states and 269896 transitions. Second operand 5 states. [2019-09-08 09:50:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:43,900 INFO L93 Difference]: Finished difference Result 368399 states and 535652 transitions. [2019-09-08 09:50:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:50:43,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 09:50:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:44,410 INFO L225 Difference]: With dead ends: 368399 [2019-09-08 09:50:44,410 INFO L226 Difference]: Without dead ends: 293689 [2019-09-08 09:50:44,524 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 09:50:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293689 states. [2019-09-08 09:51:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293689 to 202479. [2019-09-08 09:51:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202479 states. [2019-09-08 09:51:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202479 states to 202479 states and 289200 transitions. [2019-09-08 09:51:10,143 INFO L78 Accepts]: Start accepts. Automaton has 202479 states and 289200 transitions. Word has length 178 [2019-09-08 09:51:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:10,144 INFO L475 AbstractCegarLoop]: Abstraction has 202479 states and 289200 transitions. [2019-09-08 09:51:10,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:51:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 202479 states and 289200 transitions. [2019-09-08 09:51:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:51:10,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:10,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:10,178 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:10,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash 874552556, now seen corresponding path program 1 times [2019-09-08 09:51:10,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:10,332 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 09:51:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:51:10,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:51:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:51:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:51:10,334 INFO L87 Difference]: Start difference. First operand 202479 states and 289200 transitions. Second operand 6 states.