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_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:09:34,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:09:34,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:09:34,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:09:34,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:09:34,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:09:34,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:09:34,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:09:34,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:09:34,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:09:34,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:09:34,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:09:34,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:09:34,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:09:34,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:09:34,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:09:34,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:09:34,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:09:34,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:09:34,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:09:34,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:09:34,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:09:34,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:09:34,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:09:34,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:09:34,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:09:34,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:09:34,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:09:34,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:09:34,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:09:34,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:09:34,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:09:34,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:09:34,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:09:34,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:09:34,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:09:34,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:09:34,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:09:34,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:09:34,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:09:34,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:09:34,707 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 12:09:34,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:09:34,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:09:34,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:09:34,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:09:34,724 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:09:34,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:09:34,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:09:34,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:09:34,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:09:34,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:09:34,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:09:34,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:09:34,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:09:34,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:09:34,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:09:34,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:09:34,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:09:34,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:09:34,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:09:34,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:09:34,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:09:34,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:09:34,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:09:34,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:09:34,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:09:34,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:09:34,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:09:34,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:09:34,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:09:34,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:09:34,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:09:34,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:09:34,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:09:34,773 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:09:34,774 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 12:09:34,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76842eee/668a847761e54282922ad86c61373296/FLAG72f519a9d [2019-09-08 12:09:35,327 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:09:35,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 12:09:35,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76842eee/668a847761e54282922ad86c61373296/FLAG72f519a9d [2019-09-08 12:09:35,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e76842eee/668a847761e54282922ad86c61373296 [2019-09-08 12:09:35,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:09:35,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:09:35,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:09:35,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:09:35,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:09:35,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:09:35" (1/1) ... [2019-09-08 12:09:35,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3c99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:35, skipping insertion in model container [2019-09-08 12:09:35,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:09:35" (1/1) ... [2019-09-08 12:09:35,700 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:09:35,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:09:36,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:09:36,217 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:09:36,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:09:36,373 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:09:36,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36 WrapperNode [2019-09-08 12:09:36,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:09:36,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:09:36,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:09:36,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:09:36,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (1/1) ... [2019-09-08 12:09:36,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:09:36,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:09:36,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:09:36,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:09:36,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (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 12:09:36,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:09:36,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:09:36,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:09:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:09:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:09:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:09:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:09:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:09:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:09:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:09:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:09:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:09:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:09:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:09:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:09:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:09:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:09:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:09:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:09:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:09:37,344 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:09:37,345 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:09:37,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:09:37 BoogieIcfgContainer [2019-09-08 12:09:37,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:09:37,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:09:37,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:09:37,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:09:37,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:09:35" (1/3) ... [2019-09-08 12:09:37,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75940a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:09:37, skipping insertion in model container [2019-09-08 12:09:37,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:36" (2/3) ... [2019-09-08 12:09:37,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75940a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:09:37, skipping insertion in model container [2019-09-08 12:09:37,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:09:37" (3/3) ... [2019-09-08 12:09:37,359 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 12:09:37,370 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:09:37,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:09:37,410 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:09:37,450 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:09:37,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:09:37,451 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:09:37,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:09:37,451 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:09:37,451 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:09:37,452 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:09:37,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:09:37,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:09:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-09-08 12:09:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:09:37,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:37,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:37,485 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1001395215, now seen corresponding path program 1 times [2019-09-08 12:09:37,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:37,996 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 12:09:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:37,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:38,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:38,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:38,020 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 3 states. [2019-09-08 12:09:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:38,165 INFO L93 Difference]: Finished difference Result 302 states and 496 transitions. [2019-09-08 12:09:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:38,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 12:09:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:38,183 INFO L225 Difference]: With dead ends: 302 [2019-09-08 12:09:38,183 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 12:09:38,187 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 12:09:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 12:09:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-08 12:09:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2019-09-08 12:09:38,255 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 80 [2019-09-08 12:09:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:38,256 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2019-09-08 12:09:38,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2019-09-08 12:09:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:09:38,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:38,260 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] [2019-09-08 12:09:38,261 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1695070945, now seen corresponding path program 1 times [2019-09-08 12:09:38,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:38,475 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 12:09:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:38,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:38,478 INFO L87 Difference]: Start difference. First operand 227 states and 325 transitions. Second operand 5 states. [2019-09-08 12:09:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:38,738 INFO L93 Difference]: Finished difference Result 412 states and 607 transitions. [2019-09-08 12:09:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:38,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:09:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:38,741 INFO L225 Difference]: With dead ends: 412 [2019-09-08 12:09:38,742 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 12:09:38,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 12:09:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-08 12:09:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 322 transitions. [2019-09-08 12:09:38,775 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 322 transitions. Word has length 82 [2019-09-08 12:09:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:38,776 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 322 transitions. [2019-09-08 12:09:38,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 322 transitions. [2019-09-08 12:09:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:38,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:38,780 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] [2019-09-08 12:09:38,780 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1498664087, now seen corresponding path program 1 times [2019-09-08 12:09:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:38,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:38,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:38,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:38,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:38,949 INFO L87 Difference]: Start difference. First operand 227 states and 322 transitions. Second operand 5 states. [2019-09-08 12:09:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:39,159 INFO L93 Difference]: Finished difference Result 408 states and 597 transitions. [2019-09-08 12:09:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:39,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 12:09:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:39,163 INFO L225 Difference]: With dead ends: 408 [2019-09-08 12:09:39,163 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 12:09:39,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 12:09:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-08 12:09:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2019-09-08 12:09:39,211 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 83 [2019-09-08 12:09:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:39,212 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2019-09-08 12:09:39,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2019-09-08 12:09:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:09:39,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:39,223 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] [2019-09-08 12:09:39,223 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 565537234, now seen corresponding path program 1 times [2019-09-08 12:09:39,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:39,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:39,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:39,358 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 12:09:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:39,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:39,360 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand 5 states. [2019-09-08 12:09:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:39,540 INFO L93 Difference]: Finished difference Result 400 states and 582 transitions. [2019-09-08 12:09:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:39,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 12:09:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:39,542 INFO L225 Difference]: With dead ends: 400 [2019-09-08 12:09:39,543 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 12:09:39,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 12:09:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-08 12:09:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2019-09-08 12:09:39,560 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 84 [2019-09-08 12:09:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:39,561 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2019-09-08 12:09:39,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2019-09-08 12:09:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:39,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:39,563 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] [2019-09-08 12:09:39,563 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:39,563 INFO L82 PathProgramCache]: Analyzing trace with hash 219817577, now seen corresponding path program 1 times [2019-09-08 12:09:39,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:39,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:39,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:39,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:39,654 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 12:09:39,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:39,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:39,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:39,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:39,655 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand 5 states. [2019-09-08 12:09:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:39,851 INFO L93 Difference]: Finished difference Result 396 states and 572 transitions. [2019-09-08 12:09:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:39,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:09:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:39,853 INFO L225 Difference]: With dead ends: 396 [2019-09-08 12:09:39,854 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 12:09:39,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 12:09:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-08 12:09:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-09-08 12:09:39,873 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 85 [2019-09-08 12:09:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:39,874 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-09-08 12:09:39,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-09-08 12:09:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:09:39,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:39,876 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] [2019-09-08 12:09:39,876 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 693792033, now seen corresponding path program 1 times [2019-09-08 12:09:39,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:39,960 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 12:09:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:39,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:39,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:39,962 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 5 states. [2019-09-08 12:09:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:40,137 INFO L93 Difference]: Finished difference Result 404 states and 575 transitions. [2019-09-08 12:09:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:40,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 12:09:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:40,140 INFO L225 Difference]: With dead ends: 404 [2019-09-08 12:09:40,140 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 12:09:40,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 12:09:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-08 12:09:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:09:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 310 transitions. [2019-09-08 12:09:40,158 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 310 transitions. Word has length 86 [2019-09-08 12:09:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:40,159 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 310 transitions. [2019-09-08 12:09:40,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 310 transitions. [2019-09-08 12:09:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:40,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:40,160 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] [2019-09-08 12:09:40,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash -320560505, now seen corresponding path program 1 times [2019-09-08 12:09:40,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:40,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:40,294 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 12:09:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:40,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:40,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:40,295 INFO L87 Difference]: Start difference. First operand 227 states and 310 transitions. Second operand 7 states. [2019-09-08 12:09:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:40,525 INFO L93 Difference]: Finished difference Result 881 states and 1280 transitions. [2019-09-08 12:09:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:09:40,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 12:09:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:40,530 INFO L225 Difference]: With dead ends: 881 [2019-09-08 12:09:40,531 INFO L226 Difference]: Without dead ends: 765 [2019-09-08 12:09:40,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-08 12:09:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 286. [2019-09-08 12:09:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-08 12:09:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 399 transitions. [2019-09-08 12:09:40,561 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 399 transitions. Word has length 87 [2019-09-08 12:09:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:40,561 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 399 transitions. [2019-09-08 12:09:40,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2019-09-08 12:09:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:40,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:40,563 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] [2019-09-08 12:09:40,563 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash -411004634, now seen corresponding path program 1 times [2019-09-08 12:09:40,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:40,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:40,702 INFO L87 Difference]: Start difference. First operand 286 states and 399 transitions. Second operand 5 states. [2019-09-08 12:09:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:40,834 INFO L93 Difference]: Finished difference Result 604 states and 871 transitions. [2019-09-08 12:09:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:40,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 12:09:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:40,839 INFO L225 Difference]: With dead ends: 604 [2019-09-08 12:09:40,839 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 12:09:40,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:09:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 12:09:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 421. [2019-09-08 12:09:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-08 12:09:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 603 transitions. [2019-09-08 12:09:40,888 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 603 transitions. Word has length 87 [2019-09-08 12:09:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:40,889 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 603 transitions. [2019-09-08 12:09:40,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 603 transitions. [2019-09-08 12:09:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:40,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:40,891 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] [2019-09-08 12:09:40,891 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -141069036, now seen corresponding path program 1 times [2019-09-08 12:09:40,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:40,958 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 12:09:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:40,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:40,960 INFO L87 Difference]: Start difference. First operand 421 states and 603 transitions. Second operand 3 states. [2019-09-08 12:09:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:41,078 INFO L93 Difference]: Finished difference Result 977 states and 1426 transitions. [2019-09-08 12:09:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:41,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-08 12:09:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:41,084 INFO L225 Difference]: With dead ends: 977 [2019-09-08 12:09:41,084 INFO L226 Difference]: Without dead ends: 684 [2019-09-08 12:09:41,086 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 12:09:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-08 12:09:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2019-09-08 12:09:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-08 12:09:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 978 transitions. [2019-09-08 12:09:41,180 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 978 transitions. Word has length 87 [2019-09-08 12:09:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:41,180 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 978 transitions. [2019-09-08 12:09:41,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 978 transitions. [2019-09-08 12:09:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:41,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:41,182 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] [2019-09-08 12:09:41,182 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash 63922835, now seen corresponding path program 1 times [2019-09-08 12:09:41,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:41,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:41,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:41,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:41,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:41,255 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 12:09:41,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:41,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:41,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:41,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:41,257 INFO L87 Difference]: Start difference. First operand 682 states and 978 transitions. Second operand 3 states. [2019-09-08 12:09:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:41,381 INFO L93 Difference]: Finished difference Result 1349 states and 1956 transitions. [2019-09-08 12:09:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:41,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-08 12:09:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:41,386 INFO L225 Difference]: With dead ends: 1349 [2019-09-08 12:09:41,387 INFO L226 Difference]: Without dead ends: 795 [2019-09-08 12:09:41,390 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 12:09:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-09-08 12:09:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2019-09-08 12:09:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-08 12:09:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1137 transitions. [2019-09-08 12:09:41,487 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1137 transitions. Word has length 87 [2019-09-08 12:09:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:41,488 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1137 transitions. [2019-09-08 12:09:41,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1137 transitions. [2019-09-08 12:09:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:41,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:41,489 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] [2019-09-08 12:09:41,490 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2048530461, now seen corresponding path program 1 times [2019-09-08 12:09:41,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:41,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:41,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:41,636 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 12:09:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:41,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:41,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:41,637 INFO L87 Difference]: Start difference. First operand 793 states and 1137 transitions. Second operand 7 states. [2019-09-08 12:09:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:42,027 INFO L93 Difference]: Finished difference Result 2957 states and 4300 transitions. [2019-09-08 12:09:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:09:42,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 12:09:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:42,041 INFO L225 Difference]: With dead ends: 2957 [2019-09-08 12:09:42,041 INFO L226 Difference]: Without dead ends: 2515 [2019-09-08 12:09:42,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2019-09-08 12:09:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1134. [2019-09-08 12:09:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-09-08 12:09:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1635 transitions. [2019-09-08 12:09:42,172 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1635 transitions. Word has length 87 [2019-09-08 12:09:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:42,173 INFO L475 AbstractCegarLoop]: Abstraction has 1134 states and 1635 transitions. [2019-09-08 12:09:42,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1635 transitions. [2019-09-08 12:09:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:42,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:42,174 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] [2019-09-08 12:09:42,175 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash -194393284, now seen corresponding path program 1 times [2019-09-08 12:09:42,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:42,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:42,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 12:09:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:09:42,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:09:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:09:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:42,332 INFO L87 Difference]: Start difference. First operand 1134 states and 1635 transitions. Second operand 7 states. [2019-09-08 12:09:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:42,850 INFO L93 Difference]: Finished difference Result 3206 states and 4665 transitions. [2019-09-08 12:09:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:09:42,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-08 12:09:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:42,870 INFO L225 Difference]: With dead ends: 3206 [2019-09-08 12:09:42,871 INFO L226 Difference]: Without dead ends: 2764 [2019-09-08 12:09:42,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2019-09-08 12:09:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 1368. [2019-09-08 12:09:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-08 12:09:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1978 transitions. [2019-09-08 12:09:43,135 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1978 transitions. Word has length 87 [2019-09-08 12:09:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:43,135 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1978 transitions. [2019-09-08 12:09:43,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1978 transitions. [2019-09-08 12:09:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:43,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:43,137 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] [2019-09-08 12:09:43,137 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 80594002, now seen corresponding path program 1 times [2019-09-08 12:09:43,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:43,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:43,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:43,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:43,226 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 12:09:43,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:43,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:43,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:43,228 INFO L87 Difference]: Start difference. First operand 1368 states and 1978 transitions. Second operand 5 states. [2019-09-08 12:09:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:43,517 INFO L93 Difference]: Finished difference Result 2550 states and 3707 transitions. [2019-09-08 12:09:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:43,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 12:09:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:43,529 INFO L225 Difference]: With dead ends: 2550 [2019-09-08 12:09:43,529 INFO L226 Difference]: Without dead ends: 2108 [2019-09-08 12:09:43,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:09:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2019-09-08 12:09:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2058. [2019-09-08 12:09:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2992 transitions. [2019-09-08 12:09:43,796 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2992 transitions. Word has length 87 [2019-09-08 12:09:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:43,796 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2992 transitions. [2019-09-08 12:09:43,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2992 transitions. [2019-09-08 12:09:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:09:43,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:43,798 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] [2019-09-08 12:09:43,798 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash 116389539, now seen corresponding path program 1 times [2019-09-08 12:09:43,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:44,024 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 12:09:44,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:44,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:44,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:44,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:44,027 INFO L87 Difference]: Start difference. First operand 2058 states and 2992 transitions. Second operand 9 states. [2019-09-08 12:09:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:45,030 INFO L93 Difference]: Finished difference Result 5903 states and 8621 transitions. [2019-09-08 12:09:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:09:45,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:09:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:45,050 INFO L225 Difference]: With dead ends: 5903 [2019-09-08 12:09:45,050 INFO L226 Difference]: Without dead ends: 3951 [2019-09-08 12:09:45,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:09:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2019-09-08 12:09:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2058. [2019-09-08 12:09:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2991 transitions. [2019-09-08 12:09:45,339 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2991 transitions. Word has length 88 [2019-09-08 12:09:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:45,339 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2991 transitions. [2019-09-08 12:09:45,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2991 transitions. [2019-09-08 12:09:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:09:45,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:45,341 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] [2019-09-08 12:09:45,341 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2104622850, now seen corresponding path program 1 times [2019-09-08 12:09:45,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:45,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:45,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:45,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 12:09:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:45,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:45,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:45,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:45,564 INFO L87 Difference]: Start difference. First operand 2058 states and 2991 transitions. Second operand 10 states. [2019-09-08 12:09:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:46,988 INFO L93 Difference]: Finished difference Result 6022 states and 8769 transitions. [2019-09-08 12:09:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:09:46,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 12:09:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:47,009 INFO L225 Difference]: With dead ends: 6022 [2019-09-08 12:09:47,010 INFO L226 Difference]: Without dead ends: 4079 [2019-09-08 12:09:47,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:09:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2019-09-08 12:09:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 2058. [2019-09-08 12:09:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2987 transitions. [2019-09-08 12:09:47,314 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2987 transitions. Word has length 89 [2019-09-08 12:09:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:47,314 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2987 transitions. [2019-09-08 12:09:47,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2987 transitions. [2019-09-08 12:09:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:09:47,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:47,316 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] [2019-09-08 12:09:47,316 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2064177225, now seen corresponding path program 1 times [2019-09-08 12:09:47,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:47,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:47,539 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 12:09:47,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:47,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:47,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:47,543 INFO L87 Difference]: Start difference. First operand 2058 states and 2987 transitions. Second operand 10 states. [2019-09-08 12:09:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:48,920 INFO L93 Difference]: Finished difference Result 6031 states and 8776 transitions. [2019-09-08 12:09:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:09:48,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 12:09:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:48,942 INFO L225 Difference]: With dead ends: 6031 [2019-09-08 12:09:48,942 INFO L226 Difference]: Without dead ends: 4078 [2019-09-08 12:09:48,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:09:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2019-09-08 12:09:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 2058. [2019-09-08 12:09:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2985 transitions. [2019-09-08 12:09:49,352 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2985 transitions. Word has length 89 [2019-09-08 12:09:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:49,353 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2985 transitions. [2019-09-08 12:09:49,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2985 transitions. [2019-09-08 12:09:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:09:49,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:49,356 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] [2019-09-08 12:09:49,356 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2120525072, now seen corresponding path program 1 times [2019-09-08 12:09:49,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:49,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:49,568 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 12:09:49,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:49,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:49,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:49,569 INFO L87 Difference]: Start difference. First operand 2058 states and 2985 transitions. Second operand 10 states. [2019-09-08 12:09:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:51,187 INFO L93 Difference]: Finished difference Result 5992 states and 8715 transitions. [2019-09-08 12:09:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:09:51,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 12:09:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:51,205 INFO L225 Difference]: With dead ends: 5992 [2019-09-08 12:09:51,205 INFO L226 Difference]: Without dead ends: 4069 [2019-09-08 12:09:51,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:09:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-09-08 12:09:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 2058. [2019-09-08 12:09:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2979 transitions. [2019-09-08 12:09:51,520 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2979 transitions. Word has length 90 [2019-09-08 12:09:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:51,521 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2979 transitions. [2019-09-08 12:09:51,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2979 transitions. [2019-09-08 12:09:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:09:51,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:51,522 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] [2019-09-08 12:09:51,523 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1590865908, now seen corresponding path program 1 times [2019-09-08 12:09:51,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:51,767 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 12:09:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:51,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:09:51,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:09:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:09:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:09:51,770 INFO L87 Difference]: Start difference. First operand 2058 states and 2979 transitions. Second operand 10 states. [2019-09-08 12:09:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:53,159 INFO L93 Difference]: Finished difference Result 5942 states and 8629 transitions. [2019-09-08 12:09:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:09:53,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-08 12:09:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:53,169 INFO L225 Difference]: With dead ends: 5942 [2019-09-08 12:09:53,169 INFO L226 Difference]: Without dead ends: 4049 [2019-09-08 12:09:53,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:09:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2019-09-08 12:09:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 2058. [2019-09-08 12:09:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:09:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2972 transitions. [2019-09-08 12:09:53,414 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2972 transitions. Word has length 91 [2019-09-08 12:09:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:53,415 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2972 transitions. [2019-09-08 12:09:53,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:09:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2972 transitions. [2019-09-08 12:09:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:09:53,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:53,416 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] [2019-09-08 12:09:53,416 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 142408710, now seen corresponding path program 1 times [2019-09-08 12:09:53,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:53,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:53,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:53,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:53,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:54,760 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 12:09:54,905 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:09:55,069 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:09:55,377 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:09:56,277 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 12:09:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:09:56,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:09:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:09:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:09:56,279 INFO L87 Difference]: Start difference. First operand 2058 states and 2972 transitions. Second operand 31 states. [2019-09-08 12:09:56,433 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-08 12:09:57,436 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-09-08 12:09:57,885 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-09-08 12:09:58,233 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-09-08 12:09:58,680 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2019-09-08 12:09:59,192 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2019-09-08 12:09:59,847 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-09-08 12:10:00,571 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 135 [2019-09-08 12:10:01,465 WARN L188 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 163 [2019-09-08 12:10:02,513 WARN L188 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 178 [2019-09-08 12:10:02,842 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-09-08 12:10:03,084 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-08 12:10:03,524 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-09-08 12:10:03,999 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-09-08 12:10:04,438 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-09-08 12:10:04,883 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-09-08 12:10:05,552 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-08 12:10:06,047 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-08 12:10:06,870 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-08 12:10:07,469 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-08 12:10:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:13,363 INFO L93 Difference]: Finished difference Result 10901 states and 15893 transitions. [2019-09-08 12:10:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 12:10:13,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2019-09-08 12:10:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:13,385 INFO L225 Difference]: With dead ends: 10901 [2019-09-08 12:10:13,385 INFO L226 Difference]: Without dead ends: 9570 [2019-09-08 12:10:13,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:10:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9570 states. [2019-09-08 12:10:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9570 to 2083. [2019-09-08 12:10:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-09-08 12:10:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3001 transitions. [2019-09-08 12:10:13,839 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3001 transitions. Word has length 92 [2019-09-08 12:10:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:13,840 INFO L475 AbstractCegarLoop]: Abstraction has 2083 states and 3001 transitions. [2019-09-08 12:10:13,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:10:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3001 transitions. [2019-09-08 12:10:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:10:13,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:13,841 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] [2019-09-08 12:10:13,841 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1104384956, now seen corresponding path program 1 times [2019-09-08 12:10:13,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:13,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:14,743 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 12:10:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:14,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:10:14,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:10:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:10:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:10:14,745 INFO L87 Difference]: Start difference. First operand 2083 states and 3001 transitions. Second operand 19 states. [2019-09-08 12:10:15,317 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:10:15,536 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:10:15,823 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 12:10:16,147 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-08 12:10:16,324 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:10:16,651 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:10:16,954 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:10:17,142 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:10:17,406 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:10:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:20,163 INFO L93 Difference]: Finished difference Result 11288 states and 16454 transitions. [2019-09-08 12:10:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:10:20,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-08 12:10:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:20,182 INFO L225 Difference]: With dead ends: 11288 [2019-09-08 12:10:20,183 INFO L226 Difference]: Without dead ends: 9957 [2019-09-08 12:10:20,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:10:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2019-09-08 12:10:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 2081. [2019-09-08 12:10:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-08 12:10:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2995 transitions. [2019-09-08 12:10:20,778 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2995 transitions. Word has length 92 [2019-09-08 12:10:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:20,778 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 2995 transitions. [2019-09-08 12:10:20,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:10:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2995 transitions. [2019-09-08 12:10:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:10:20,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:20,780 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] [2019-09-08 12:10:20,780 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -305465437, now seen corresponding path program 1 times [2019-09-08 12:10:20,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:20,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:20,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:21,841 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:10:22,111 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:10:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:22,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-08 12:10:22,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 12:10:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 12:10:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:10:22,999 INFO L87 Difference]: Start difference. First operand 2081 states and 2995 transitions. Second operand 29 states. [2019-09-08 12:10:23,178 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:10:24,176 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:10:24,528 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-08 12:10:24,809 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-09-08 12:10:25,187 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-09-08 12:10:25,605 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2019-09-08 12:10:26,152 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 109 [2019-09-08 12:10:26,715 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2019-09-08 12:10:27,455 WARN L188 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2019-09-08 12:10:27,733 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 12:10:28,026 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-08 12:10:28,325 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 12:10:28,708 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:10:29,014 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:10:29,450 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-08 12:10:29,757 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-08 12:10:30,389 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-08 12:10:30,749 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-08 12:10:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:36,566 INFO L93 Difference]: Finished difference Result 8261 states and 12006 transitions. [2019-09-08 12:10:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:10:36,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2019-09-08 12:10:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:36,581 INFO L225 Difference]: With dead ends: 8261 [2019-09-08 12:10:36,581 INFO L226 Difference]: Without dead ends: 7579 [2019-09-08 12:10:36,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=666, Invalid=2414, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 12:10:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-09-08 12:10:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 2092. [2019-09-08 12:10:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-09-08 12:10:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3007 transitions. [2019-09-08 12:10:37,246 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3007 transitions. Word has length 92 [2019-09-08 12:10:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:37,246 INFO L475 AbstractCegarLoop]: Abstraction has 2092 states and 3007 transitions. [2019-09-08 12:10:37,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 12:10:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3007 transitions. [2019-09-08 12:10:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:10:37,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:37,248 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] [2019-09-08 12:10:37,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1864540635, now seen corresponding path program 1 times [2019-09-08 12:10:37,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:37,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:38,114 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 12:10:38,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:38,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:10:38,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:10:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:10:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:10:38,116 INFO L87 Difference]: Start difference. First operand 2092 states and 3007 transitions. Second operand 19 states. [2019-09-08 12:10:38,664 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 12:10:38,865 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:10:39,157 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-08 12:10:39,616 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-08 12:10:39,785 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:10:40,095 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:10:40,348 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:10:40,549 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:10:40,764 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:10:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:44,022 INFO L93 Difference]: Finished difference Result 11332 states and 16500 transitions. [2019-09-08 12:10:44,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:10:44,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-09-08 12:10:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:44,038 INFO L225 Difference]: With dead ends: 11332 [2019-09-08 12:10:44,038 INFO L226 Difference]: Without dead ends: 9981 [2019-09-08 12:10:44,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:10:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2019-09-08 12:10:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 2091. [2019-09-08 12:10:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-09-08 12:10:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3001 transitions. [2019-09-08 12:10:44,787 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3001 transitions. Word has length 92 [2019-09-08 12:10:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:44,787 INFO L475 AbstractCegarLoop]: Abstraction has 2091 states and 3001 transitions. [2019-09-08 12:10:44,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:10:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3001 transitions. [2019-09-08 12:10:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:10:44,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:44,788 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] [2019-09-08 12:10:44,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1961118974, now seen corresponding path program 1 times [2019-09-08 12:10:44,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:45,686 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 12:10:45,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:45,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:10:45,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:10:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:10:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:10:45,688 INFO L87 Difference]: Start difference. First operand 2091 states and 3001 transitions. Second operand 19 states. [2019-09-08 12:10:46,275 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:10:46,460 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:10:46,769 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-08 12:10:47,112 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-08 12:10:47,322 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:10:47,678 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:10:47,913 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:10:48,130 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:10:48,347 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:10:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:51,555 INFO L93 Difference]: Finished difference Result 11336 states and 16500 transitions. [2019-09-08 12:10:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:10:51,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-09-08 12:10:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:51,569 INFO L225 Difference]: With dead ends: 11336 [2019-09-08 12:10:51,569 INFO L226 Difference]: Without dead ends: 9965 [2019-09-08 12:10:51,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:10:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2019-09-08 12:10:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 2072. [2019-09-08 12:10:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2019-09-08 12:10:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2975 transitions. [2019-09-08 12:10:52,483 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2975 transitions. Word has length 93 [2019-09-08 12:10:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:52,483 INFO L475 AbstractCegarLoop]: Abstraction has 2072 states and 2975 transitions. [2019-09-08 12:10:52,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:10:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2975 transitions. [2019-09-08 12:10:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:10:52,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:52,485 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] [2019-09-08 12:10:52,485 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 701999135, now seen corresponding path program 1 times [2019-09-08 12:10:52,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:52,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:52,945 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 12:10:52,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:52,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:10:52,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:10:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:10:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:10:52,947 INFO L87 Difference]: Start difference. First operand 2072 states and 2975 transitions. Second operand 13 states. [2019-09-08 12:10:53,230 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-08 12:10:53,376 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:10:53,526 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:10:53,808 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:10:54,004 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:10:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:56,422 INFO L93 Difference]: Finished difference Result 9208 states and 13385 transitions. [2019-09-08 12:10:56,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:56,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 12:10:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:56,432 INFO L225 Difference]: With dead ends: 9208 [2019-09-08 12:10:56,432 INFO L226 Difference]: Without dead ends: 7837 [2019-09-08 12:10:56,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:10:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2019-09-08 12:10:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 2041. [2019-09-08 12:10:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-09-08 12:10:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2936 transitions. [2019-09-08 12:10:57,170 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2936 transitions. Word has length 93 [2019-09-08 12:10:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:57,171 INFO L475 AbstractCegarLoop]: Abstraction has 2041 states and 2936 transitions. [2019-09-08 12:10:57,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:10:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2936 transitions. [2019-09-08 12:10:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:10:57,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:57,172 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] [2019-09-08 12:10:57,172 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1241325465, now seen corresponding path program 1 times [2019-09-08 12:10:57,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:57,696 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 12:10:57,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:57,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:10:57,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:10:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:10:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:10:57,698 INFO L87 Difference]: Start difference. First operand 2041 states and 2936 transitions. Second operand 13 states. [2019-09-08 12:10:58,074 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:10:58,215 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:10:58,364 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:10:58,667 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:10:58,878 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:11:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:01,534 INFO L93 Difference]: Finished difference Result 8823 states and 12858 transitions. [2019-09-08 12:11:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:11:01,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 12:11:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:01,543 INFO L225 Difference]: With dead ends: 8823 [2019-09-08 12:11:01,543 INFO L226 Difference]: Without dead ends: 7715 [2019-09-08 12:11:01,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:11:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2019-09-08 12:11:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 2038. [2019-09-08 12:11:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-09-08 12:11:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2929 transitions. [2019-09-08 12:11:02,244 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2929 transitions. Word has length 93 [2019-09-08 12:11:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:02,244 INFO L475 AbstractCegarLoop]: Abstraction has 2038 states and 2929 transitions. [2019-09-08 12:11:02,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:11:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2929 transitions. [2019-09-08 12:11:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:11:02,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:02,246 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] [2019-09-08 12:11:02,246 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1428521857, now seen corresponding path program 1 times [2019-09-08 12:11:02,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:02,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:03,091 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 12:11:03,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:03,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:11:03,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:11:03,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:11:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:11:03,093 INFO L87 Difference]: Start difference. First operand 2038 states and 2929 transitions. Second operand 17 states. [2019-09-08 12:11:03,927 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-08 12:11:04,079 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:11:04,234 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:11:04,365 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-08 12:11:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:08,275 INFO L93 Difference]: Finished difference Result 8539 states and 12422 transitions. [2019-09-08 12:11:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:11:08,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-09-08 12:11:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:08,281 INFO L225 Difference]: With dead ends: 8539 [2019-09-08 12:11:08,281 INFO L226 Difference]: Without dead ends: 7838 [2019-09-08 12:11:08,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:11:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7838 states. [2019-09-08 12:11:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7838 to 2029. [2019-09-08 12:11:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-09-08 12:11:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2918 transitions. [2019-09-08 12:11:09,015 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2918 transitions. Word has length 93 [2019-09-08 12:11:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:09,015 INFO L475 AbstractCegarLoop]: Abstraction has 2029 states and 2918 transitions. [2019-09-08 12:11:09,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:11:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2918 transitions. [2019-09-08 12:11:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:11:09,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:09,017 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] [2019-09-08 12:11:09,017 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1704891763, now seen corresponding path program 1 times [2019-09-08 12:11:09,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:09,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:09,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:11:09,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:11:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:11:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:11:09,085 INFO L87 Difference]: Start difference. First operand 2029 states and 2918 transitions. Second operand 4 states. [2019-09-08 12:11:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:10,484 INFO L93 Difference]: Finished difference Result 4821 states and 7006 transitions. [2019-09-08 12:11:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:11:10,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 12:11:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:10,489 INFO L225 Difference]: With dead ends: 4821 [2019-09-08 12:11:10,490 INFO L226 Difference]: Without dead ends: 2935 [2019-09-08 12:11:10,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:11:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-09-08 12:11:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2933. [2019-09-08 12:11:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2019-09-08 12:11:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4223 transitions. [2019-09-08 12:11:11,534 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4223 transitions. Word has length 93 [2019-09-08 12:11:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:11,534 INFO L475 AbstractCegarLoop]: Abstraction has 2933 states and 4223 transitions. [2019-09-08 12:11:11,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:11:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4223 transitions. [2019-09-08 12:11:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:11:11,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:11,535 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] [2019-09-08 12:11:11,535 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash -726766473, now seen corresponding path program 1 times [2019-09-08 12:11:11,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:11,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:11,601 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 12:11:11,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:11:11,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:11:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:11:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:11:11,603 INFO L87 Difference]: Start difference. First operand 2933 states and 4223 transitions. Second operand 5 states. [2019-09-08 12:11:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:13,371 INFO L93 Difference]: Finished difference Result 4500 states and 6494 transitions. [2019-09-08 12:11:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:11:13,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:11:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:13,376 INFO L225 Difference]: With dead ends: 4500 [2019-09-08 12:11:13,376 INFO L226 Difference]: Without dead ends: 4498 [2019-09-08 12:11:13,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:11:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2019-09-08 12:11:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 2949. [2019-09-08 12:11:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2019-09-08 12:11:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4225 transitions. [2019-09-08 12:11:14,469 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4225 transitions. Word has length 93 [2019-09-08 12:11:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:14,470 INFO L475 AbstractCegarLoop]: Abstraction has 2949 states and 4225 transitions. [2019-09-08 12:11:14,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:11:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4225 transitions. [2019-09-08 12:11:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:11:14,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:14,470 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] [2019-09-08 12:11:14,471 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash 248993705, now seen corresponding path program 1 times [2019-09-08 12:11:14,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:14,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:14,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:14,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:14,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:15,116 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 12:11:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:11:15,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:11:15,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:11:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:11:15,118 INFO L87 Difference]: Start difference. First operand 2949 states and 4225 transitions. Second operand 16 states. [2019-09-08 12:11:15,834 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 12:11:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:20,265 INFO L93 Difference]: Finished difference Result 9627 states and 13904 transitions. [2019-09-08 12:11:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:11:20,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-09-08 12:11:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:20,272 INFO L225 Difference]: With dead ends: 9627 [2019-09-08 12:11:20,273 INFO L226 Difference]: Without dead ends: 8630 [2019-09-08 12:11:20,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:11:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8630 states. [2019-09-08 12:11:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8630 to 2943. [2019-09-08 12:11:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2943 states. [2019-09-08 12:11:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4216 transitions. [2019-09-08 12:11:21,384 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4216 transitions. Word has length 94 [2019-09-08 12:11:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:21,384 INFO L475 AbstractCegarLoop]: Abstraction has 2943 states and 4216 transitions. [2019-09-08 12:11:21,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:11:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4216 transitions. [2019-09-08 12:11:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:11:21,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:21,385 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] [2019-09-08 12:11:21,386 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2108767036, now seen corresponding path program 1 times [2019-09-08 12:11:21,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:21,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:21,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:21,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:21,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:23,017 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 12:11:23,707 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 12:11:23,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:23,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:11:23,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:11:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:11:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:11:23,709 INFO L87 Difference]: Start difference. First operand 2943 states and 4216 transitions. Second operand 32 states. [2019-09-08 12:11:23,885 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:11:24,943 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:11:25,309 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 12:11:25,527 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:11:25,798 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:11:26,099 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-08 12:11:26,413 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:11:26,797 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-08 12:11:27,192 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-08 12:11:27,729 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2019-09-08 12:11:28,008 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-08 12:11:28,280 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-08 12:11:28,559 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-08 12:11:28,738 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-08 12:11:29,061 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-08 12:11:29,344 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-08 12:11:29,659 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:11:29,844 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:11:30,147 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:11:30,738 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 12:11:31,192 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 12:11:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:47,142 INFO L93 Difference]: Finished difference Result 28073 states and 40606 transitions. [2019-09-08 12:11:47,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:11:47,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 94 [2019-09-08 12:11:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:47,168 INFO L225 Difference]: With dead ends: 28073 [2019-09-08 12:11:47,168 INFO L226 Difference]: Without dead ends: 27079 [2019-09-08 12:11:47,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=821, Invalid=3339, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 12:11:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27079 states. [2019-09-08 12:11:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27079 to 2947. [2019-09-08 12:11:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-09-08 12:11:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4220 transitions. [2019-09-08 12:11:48,610 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4220 transitions. Word has length 94 [2019-09-08 12:11:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:48,611 INFO L475 AbstractCegarLoop]: Abstraction has 2947 states and 4220 transitions. [2019-09-08 12:11:48,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:11:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4220 transitions. [2019-09-08 12:11:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:11:48,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:48,612 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] [2019-09-08 12:11:48,612 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash -722644151, now seen corresponding path program 1 times [2019-09-08 12:11:48,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:48,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:48,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:49,191 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 12:11:49,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:49,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:11:49,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:11:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:11:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:11:49,192 INFO L87 Difference]: Start difference. First operand 2947 states and 4220 transitions. Second operand 13 states. [2019-09-08 12:11:49,480 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 12:11:49,669 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:11:49,861 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:11:50,195 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 12:11:50,478 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-08 12:11:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:55,944 INFO L93 Difference]: Finished difference Result 13296 states and 19210 transitions. [2019-09-08 12:11:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:11:55,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-09-08 12:11:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:55,953 INFO L225 Difference]: With dead ends: 13296 [2019-09-08 12:11:55,953 INFO L226 Difference]: Without dead ends: 11406 [2019-09-08 12:11:55,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:11:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-09-08 12:11:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 2926. [2019-09-08 12:11:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-09-08 12:11:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4196 transitions. [2019-09-08 12:11:57,303 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4196 transitions. Word has length 94 [2019-09-08 12:11:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:57,303 INFO L475 AbstractCegarLoop]: Abstraction has 2926 states and 4196 transitions. [2019-09-08 12:11:57,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:11:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4196 transitions. [2019-09-08 12:11:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:11:57,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:57,304 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] [2019-09-08 12:11:57,304 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash -582714908, now seen corresponding path program 1 times [2019-09-08 12:11:57,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:57,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:57,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:57,830 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 12:11:57,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:57,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:11:57,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:11:57,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:11:57,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:11:57,832 INFO L87 Difference]: Start difference. First operand 2926 states and 4196 transitions. Second operand 12 states. [2019-09-08 12:11:58,226 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:11:58,368 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:11:58,534 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:11:58,841 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:11:59,063 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:11:59,205 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:12:00,226 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-08 12:12:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:06,506 INFO L93 Difference]: Finished difference Result 15842 states and 22914 transitions. [2019-09-08 12:12:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:12:06,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-08 12:12:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:06,521 INFO L225 Difference]: With dead ends: 15842 [2019-09-08 12:12:06,521 INFO L226 Difference]: Without dead ends: 14178 [2019-09-08 12:12:06,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:12:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2019-09-08 12:12:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 2920. [2019-09-08 12:12:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-09-08 12:12:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4189 transitions. [2019-09-08 12:12:08,106 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4189 transitions. Word has length 94 [2019-09-08 12:12:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:08,107 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4189 transitions. [2019-09-08 12:12:08,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:12:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4189 transitions. [2019-09-08 12:12:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:12:08,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:08,108 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] [2019-09-08 12:12:08,108 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:08,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1711227384, now seen corresponding path program 1 times [2019-09-08 12:12:08,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:08,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:08,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:08,654 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 12:12:09,041 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 12:12:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:12:09,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:12:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:12:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:12:09,050 INFO L87 Difference]: Start difference. First operand 2920 states and 4189 transitions. Second operand 16 states. [2019-09-08 12:12:09,512 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:12:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:13,133 INFO L93 Difference]: Finished difference Result 6637 states and 9561 transitions. [2019-09-08 12:12:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:12:13,133 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2019-09-08 12:12:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:13,138 INFO L225 Difference]: With dead ends: 6637 [2019-09-08 12:12:13,139 INFO L226 Difference]: Without dead ends: 5624 [2019-09-08 12:12:13,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:12:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2019-09-08 12:12:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 2578. [2019-09-08 12:12:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-09-08 12:12:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3704 transitions. [2019-09-08 12:12:14,517 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3704 transitions. Word has length 95 [2019-09-08 12:12:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:14,517 INFO L475 AbstractCegarLoop]: Abstraction has 2578 states and 3704 transitions. [2019-09-08 12:12:14,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:12:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3704 transitions. [2019-09-08 12:12:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:12:14,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:14,520 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:14,520 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash -246045565, now seen corresponding path program 1 times [2019-09-08 12:12:14,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:14,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:14,587 INFO L87 Difference]: Start difference. First operand 2578 states and 3704 transitions. Second operand 3 states. [2019-09-08 12:12:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:17,343 INFO L93 Difference]: Finished difference Result 7374 states and 10607 transitions. [2019-09-08 12:12:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:17,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:12:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:17,351 INFO L225 Difference]: With dead ends: 7374 [2019-09-08 12:12:17,352 INFO L226 Difference]: Without dead ends: 4886 [2019-09-08 12:12:17,355 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 12:12:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2019-09-08 12:12:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4704. [2019-09-08 12:12:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4704 states. [2019-09-08 12:12:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 6727 transitions. [2019-09-08 12:12:19,829 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 6727 transitions. Word has length 121 [2019-09-08 12:12:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:19,829 INFO L475 AbstractCegarLoop]: Abstraction has 4704 states and 6727 transitions. [2019-09-08 12:12:19,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 6727 transitions. [2019-09-08 12:12:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:12:19,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:19,831 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:19,831 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1261305191, now seen corresponding path program 1 times [2019-09-08 12:12:19,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:19,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:19,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:19,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:19,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:19,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:19,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:19,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:19,885 INFO L87 Difference]: Start difference. First operand 4704 states and 6727 transitions. Second operand 3 states. [2019-09-08 12:12:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:24,557 INFO L93 Difference]: Finished difference Result 13572 states and 19361 transitions. [2019-09-08 12:12:24,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:24,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:12:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:24,565 INFO L225 Difference]: With dead ends: 13572 [2019-09-08 12:12:24,565 INFO L226 Difference]: Without dead ends: 8958 [2019-09-08 12:12:24,570 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 12:12:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-08 12:12:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8596. [2019-09-08 12:12:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2019-09-08 12:12:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 12188 transitions. [2019-09-08 12:12:29,102 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 12188 transitions. Word has length 122 [2019-09-08 12:12:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:29,103 INFO L475 AbstractCegarLoop]: Abstraction has 8596 states and 12188 transitions. [2019-09-08 12:12:29,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 12188 transitions. [2019-09-08 12:12:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:12:29,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:29,104 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:29,104 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:29,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2090965270, now seen corresponding path program 1 times [2019-09-08 12:12:29,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:29,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:29,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:29,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:29,159 INFO L87 Difference]: Start difference. First operand 8596 states and 12188 transitions. Second operand 3 states. [2019-09-08 12:12:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:35,932 INFO L93 Difference]: Finished difference Result 18861 states and 26781 transitions. [2019-09-08 12:12:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:35,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:12:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:35,945 INFO L225 Difference]: With dead ends: 18861 [2019-09-08 12:12:35,945 INFO L226 Difference]: Without dead ends: 12347 [2019-09-08 12:12:35,953 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 12:12:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12347 states. [2019-09-08 12:12:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12347 to 11829. [2019-09-08 12:12:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11829 states. [2019-09-08 12:12:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 16701 transitions. [2019-09-08 12:12:41,983 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 16701 transitions. Word has length 123 [2019-09-08 12:12:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:41,983 INFO L475 AbstractCegarLoop]: Abstraction has 11829 states and 16701 transitions. [2019-09-08 12:12:41,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 16701 transitions. [2019-09-08 12:12:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:12:41,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:41,984 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:41,984 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1314654851, now seen corresponding path program 1 times [2019-09-08 12:12:41,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:42,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:42,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:42,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:42,073 INFO L87 Difference]: Start difference. First operand 11829 states and 16701 transitions. Second operand 7 states. [2019-09-08 12:12:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:58,015 INFO L93 Difference]: Finished difference Result 40005 states and 56097 transitions. [2019-09-08 12:12:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:58,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-08 12:12:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:58,039 INFO L225 Difference]: With dead ends: 40005 [2019-09-08 12:12:58,039 INFO L226 Difference]: Without dead ends: 28275 [2019-09-08 12:12:58,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:12:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28275 states. [2019-09-08 12:13:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28275 to 12945. [2019-09-08 12:13:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12945 states. [2019-09-08 12:13:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12945 states to 12945 states and 18189 transitions. [2019-09-08 12:13:04,833 INFO L78 Accepts]: Start accepts. Automaton has 12945 states and 18189 transitions. Word has length 125 [2019-09-08 12:13:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:04,833 INFO L475 AbstractCegarLoop]: Abstraction has 12945 states and 18189 transitions. [2019-09-08 12:13:04,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:13:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12945 states and 18189 transitions. [2019-09-08 12:13:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:13:04,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:04,835 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:04,835 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash 621055811, now seen corresponding path program 1 times [2019-09-08 12:13:04,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:04,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:13:04,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:13:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:13:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:13:04,946 INFO L87 Difference]: Start difference. First operand 12945 states and 18189 transitions. Second operand 7 states. [2019-09-08 12:13:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:37,000 INFO L93 Difference]: Finished difference Result 69289 states and 96729 transitions. [2019-09-08 12:13:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:13:37,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-08 12:13:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:37,056 INFO L225 Difference]: With dead ends: 69289 [2019-09-08 12:13:37,056 INFO L226 Difference]: Without dead ends: 56443 [2019-09-08 12:13:37,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:13:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56443 states. [2019-09-08 12:13:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56443 to 28269. [2019-09-08 12:13:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28269 states. [2019-09-08 12:13:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28269 states to 28269 states and 39745 transitions. [2019-09-08 12:13:52,847 INFO L78 Accepts]: Start accepts. Automaton has 28269 states and 39745 transitions. Word has length 125 [2019-09-08 12:13:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:52,847 INFO L475 AbstractCegarLoop]: Abstraction has 28269 states and 39745 transitions. [2019-09-08 12:13:52,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:13:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28269 states and 39745 transitions. [2019-09-08 12:13:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:13:52,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:52,852 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:13:52,853 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1445306896, now seen corresponding path program 1 times [2019-09-08 12:13:52,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:52,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:52,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:52,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:52,920 INFO L87 Difference]: Start difference. First operand 28269 states and 39745 transitions. Second operand 3 states. [2019-09-08 12:14:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:20,993 INFO L93 Difference]: Finished difference Result 81137 states and 113571 transitions. [2019-09-08 12:14:20,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:20,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 12:14:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:21,047 INFO L225 Difference]: With dead ends: 81137 [2019-09-08 12:14:21,048 INFO L226 Difference]: Without dead ends: 52967 [2019-09-08 12:14:21,080 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 12:14:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52967 states. [2019-09-08 12:14:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52967 to 37889. [2019-09-08 12:14:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37889 states. [2019-09-08 12:14:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37889 states to 37889 states and 52373 transitions. [2019-09-08 12:14:42,388 INFO L78 Accepts]: Start accepts. Automaton has 37889 states and 52373 transitions. Word has length 152 [2019-09-08 12:14:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:42,388 INFO L475 AbstractCegarLoop]: Abstraction has 37889 states and 52373 transitions. [2019-09-08 12:14:42,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37889 states and 52373 transitions. [2019-09-08 12:14:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:14:42,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:42,394 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:42,394 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1807818039, now seen corresponding path program 1 times [2019-09-08 12:14:42,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:42,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:42,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:42,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:42,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:42,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:42,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:42,466 INFO L87 Difference]: Start difference. First operand 37889 states and 52373 transitions. Second operand 3 states. [2019-09-08 12:15:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:08,129 INFO L93 Difference]: Finished difference Result 83813 states and 115535 transitions. [2019-09-08 12:15:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:08,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 12:15:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:08,172 INFO L225 Difference]: With dead ends: 83813 [2019-09-08 12:15:08,172 INFO L226 Difference]: Without dead ends: 46023 [2019-09-08 12:15:08,201 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 12:15:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46023 states. [2019-09-08 12:15:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46023 to 43541. [2019-09-08 12:15:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43541 states. [2019-09-08 12:15:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43541 states to 43541 states and 59545 transitions. [2019-09-08 12:15:33,122 INFO L78 Accepts]: Start accepts. Automaton has 43541 states and 59545 transitions. Word has length 153 [2019-09-08 12:15:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:33,122 INFO L475 AbstractCegarLoop]: Abstraction has 43541 states and 59545 transitions. [2019-09-08 12:15:33,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 43541 states and 59545 transitions. [2019-09-08 12:15:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:15:33,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:33,128 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:15:33,128 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1886746401, now seen corresponding path program 1 times [2019-09-08 12:15:33,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:33,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:15:33,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:15:33,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:15:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:33,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:15:33,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:15:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:15:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:15:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:34,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:15:34,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-09-08 12:15:34,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:15:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:15:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:15:34,151 INFO L87 Difference]: Start difference. First operand 43541 states and 59545 transitions. Second operand 15 states. [2019-09-08 12:15:35,202 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:15:35,403 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:15:35,648 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:15:36,353 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:15:36,707 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:15:37,289 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:15:37,577 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:15:37,740 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:15:37,906 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:15:38,491 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:15:38,731 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:15:39,118 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:15:39,425 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:15:39,755 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:15:40,063 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:15:40,459 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:15:40,845 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:15:41,093 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:15:41,480 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:15:41,796 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:15:42,053 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:15:42,443 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:15:42,893 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:15:43,315 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:15:43,956 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:15:49,400 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:15:49,725 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:15:50,376 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:15:50,734 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:15:59,307 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:16:00,100 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:16:01,564 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:16:02,121 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:16:03,819 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:16:05,642 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:16:05,953 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:16:08,925 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-08 12:16:45,614 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:16:45,979 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:16:46,494 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 12:16:46,956 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 12:16:47,266 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 12:16:47,487 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:16:48,110 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:16:48,352 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:16:48,980 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:16:49,780 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:16:53,371 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:16:53,738 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 12:16:53,944 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:16:55,802 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:16:56,133 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:16:57,738 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:16:57,955 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:17:00,232 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:18:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:56,820 INFO L93 Difference]: Finished difference Result 318380 states and 434752 transitions. [2019-09-08 12:18:56,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 12:18:56,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 154 [2019-09-08 12:18:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:57,522 INFO L225 Difference]: With dead ends: 318380 [2019-09-08 12:18:57,522 INFO L226 Difference]: Without dead ends: 274938 [2019-09-08 12:18:57,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1255, Invalid=4001, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 12:18:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274938 states. [2019-09-08 12:20:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274938 to 152022. [2019-09-08 12:20:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152022 states. [2019-09-08 12:20:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152022 states to 152022 states and 206805 transitions. [2019-09-08 12:20:41,885 INFO L78 Accepts]: Start accepts. Automaton has 152022 states and 206805 transitions. Word has length 154 [2019-09-08 12:20:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:41,886 INFO L475 AbstractCegarLoop]: Abstraction has 152022 states and 206805 transitions. [2019-09-08 12:20:41,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:20:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 152022 states and 206805 transitions. [2019-09-08 12:20:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:20:41,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:41,904 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:41,904 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash -487734247, now seen corresponding path program 1 times [2019-09-08 12:20:41,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:42,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:20:42,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:20:42,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:42,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 12:20:42,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:20:42,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:20:42,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:20:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:43,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:20:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-09-08 12:20:43,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:20:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:20:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:20:43,083 INFO L87 Difference]: Start difference. First operand 152022 states and 206805 transitions. Second operand 18 states. [2019-09-08 12:20:43,803 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 12:20:44,040 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:20:45,038 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:20:45,864 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:20:46,154 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-08 12:20:46,412 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 12:20:46,800 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 12:20:46,953 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:20:47,355 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 12:20:47,639 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 12:20:47,916 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 12:20:48,051 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:20:48,280 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-08 12:20:48,686 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-08 12:20:48,975 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:20:49,428 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:20:49,882 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-08 12:20:56,979 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:20:58,604 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 12:20:59,099 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-08 12:20:59,425 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-08 12:21:01,887 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:21:12,186 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-08 12:21:12,569 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 12:21:13,036 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-08 12:21:14,293 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:21:14,644 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 12:21:14,955 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 12:21:15,128 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 12:21:15,797 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-08 12:21:15,971 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 12:21:16,332 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-08 12:21:16,764 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 12:21:17,009 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-08 12:21:18,227 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-08 12:21:19,038 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 12:21:22,473 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50