java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:44:47,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:44:47,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:44:47,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:44:47,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:44:47,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:44:47,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:44:47,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:44:47,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:44:47,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:44:47,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:44:47,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:44:47,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:44:47,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:44:47,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:44:47,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:44:47,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:44:47,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:44:47,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:44:47,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:44:47,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:44:47,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:44:47,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:44:47,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:44:47,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:44:47,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:44:47,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:44:47,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:44:47,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:44:47,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:44:47,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:44:47,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:44:47,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:44:47,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:44:47,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:44:47,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:44:47,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:44:47,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:44:47,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:44:47,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:44:47,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:44:47,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:44:47,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:44:47,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:44:47,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:44:47,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:44:47,731 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:44:47,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:44:47,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:44:47,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:44:47,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:44:47,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:44:47,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:44:47,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:44:47,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:44:47,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:44:47,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:44:47,733 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:44:47,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:44:47,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:44:47,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:44:47,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:44:47,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:44:47,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:44:47,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:44:47,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:44:47,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:44:47,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:44:47,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:44:47,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:44:47,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:44:47,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:44:47,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:44:47,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:44:47,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:44:47,796 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:44:47,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:44:47,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd11a78a5/9f276ed704c64e94a6f2ddd952ed46b3/FLAG4dff4b1a8 [2019-09-08 09:44:48,439 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:44:48,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:44:48,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd11a78a5/9f276ed704c64e94a6f2ddd952ed46b3/FLAG4dff4b1a8 [2019-09-08 09:44:48,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd11a78a5/9f276ed704c64e94a6f2ddd952ed46b3 [2019-09-08 09:44:48,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:44:48,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:44:48,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:44:48,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:44:48,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:44:48,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:44:48" (1/1) ... [2019-09-08 09:44:48,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4141a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:48, skipping insertion in model container [2019-09-08 09:44:48,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:44:48" (1/1) ... [2019-09-08 09:44:48,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:44:48,804 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:44:49,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:44:49,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:44:49,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:44:49,563 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:44:49,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49 WrapperNode [2019-09-08 09:44:49,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:44:49,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:44:49,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:44:49,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:44:49,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... [2019-09-08 09:44:49,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:44:49,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:44:49,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:44:49,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:44:49,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:44:49,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:44:49,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:44:49,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:44:49,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:44:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:44:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:44:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:44:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:44:49,730 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:44:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:44:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:44:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:44:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:44:49,731 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:44:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:44:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:44:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:44:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:44:49,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:44:51,322 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:44:51,323 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:44:51,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:44:51 BoogieIcfgContainer [2019-09-08 09:44:51,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:44:51,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:44:51,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:44:51,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:44:51,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:44:48" (1/3) ... [2019-09-08 09:44:51,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e25ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:44:51, skipping insertion in model container [2019-09-08 09:44:51,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:44:49" (2/3) ... [2019-09-08 09:44:51,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e25ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:44:51, skipping insertion in model container [2019-09-08 09:44:51,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:44:51" (3/3) ... [2019-09-08 09:44:51,332 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:44:51,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:44:51,351 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:44:51,369 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:44:51,404 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:44:51,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:44:51,405 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:44:51,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:44:51,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:44:51,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:44:51,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:44:51,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:44:51,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:44:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-08 09:44:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 09:44:51,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:51,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:51,455 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-08 09:44:51,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:51,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:52,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:52,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:52,194 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-08 09:44:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:52,374 INFO L93 Difference]: Finished difference Result 575 states and 998 transitions. [2019-09-08 09:44:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:52,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 09:44:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:52,396 INFO L225 Difference]: With dead ends: 575 [2019-09-08 09:44:52,396 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 09:44:52,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 09:44:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-08 09:44:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 09:44:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-08 09:44:52,488 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-08 09:44:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:52,489 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-08 09:44:52,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-08 09:44:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:44:52,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:52,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:52,496 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-08 09:44:52,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:52,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:52,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:52,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:52,739 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-08 09:44:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:52,798 INFO L93 Difference]: Finished difference Result 664 states and 1109 transitions. [2019-09-08 09:44:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:52,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:44:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:52,804 INFO L225 Difference]: With dead ends: 664 [2019-09-08 09:44:52,804 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 09:44:52,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 09:44:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-08 09:44:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 09:44:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-08 09:44:52,844 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-08 09:44:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:52,845 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-08 09:44:52,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-08 09:44:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:44:52,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:52,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:52,852 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-08 09:44:52,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:53,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,039 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-08 09:44:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:53,108 INFO L93 Difference]: Finished difference Result 1188 states and 1989 transitions. [2019-09-08 09:44:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:53,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:44:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:53,120 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 09:44:53,121 INFO L226 Difference]: Without dead ends: 848 [2019-09-08 09:44:53,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-08 09:44:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-08 09:44:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-08 09:44:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-08 09:44:53,186 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-08 09:44:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:53,188 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-08 09:44:53,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-08 09:44:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:44:53,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:53,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:53,198 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-08 09:44:53,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:53,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:53,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,357 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-08 09:44:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:53,430 INFO L93 Difference]: Finished difference Result 1466 states and 2456 transitions. [2019-09-08 09:44:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:53,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:44:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:53,472 INFO L225 Difference]: With dead ends: 1466 [2019-09-08 09:44:53,472 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 09:44:53,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 09:44:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-08 09:44:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-08 09:44:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-08 09:44:53,527 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-08 09:44:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:53,527 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-08 09:44:53,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-08 09:44:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:44:53,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:53,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:53,530 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:53,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-08 09:44:53,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:53,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:53,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:53,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,654 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-08 09:44:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:53,754 INFO L93 Difference]: Finished difference Result 2865 states and 4791 transitions. [2019-09-08 09:44:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:53,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:44:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:53,769 INFO L225 Difference]: With dead ends: 2865 [2019-09-08 09:44:53,769 INFO L226 Difference]: Without dead ends: 1954 [2019-09-08 09:44:53,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-08 09:44:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-08 09:44:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 09:44:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-08 09:44:53,868 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-08 09:44:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:53,869 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-08 09:44:53,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-08 09:44:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:44:53,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:53,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:53,872 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-08 09:44:53,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:54,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:54,024 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-08 09:44:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:54,151 INFO L93 Difference]: Finished difference Result 3558 states and 5947 transitions. [2019-09-08 09:44:54,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:54,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:44:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:54,172 INFO L225 Difference]: With dead ends: 3558 [2019-09-08 09:44:54,173 INFO L226 Difference]: Without dead ends: 2647 [2019-09-08 09:44:54,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-08 09:44:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-08 09:44:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-08 09:44:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-08 09:44:54,342 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-08 09:44:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:54,343 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-08 09:44:54,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-08 09:44:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:44:54,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:54,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:54,347 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-08 09:44:54,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:54,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:54,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:54,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:54,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:54,488 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-08 09:44:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:54,746 INFO L93 Difference]: Finished difference Result 7230 states and 12009 transitions. [2019-09-08 09:44:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:54,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:44:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:54,777 INFO L225 Difference]: With dead ends: 7230 [2019-09-08 09:44:54,777 INFO L226 Difference]: Without dead ends: 4816 [2019-09-08 09:44:54,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-08 09:44:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-08 09:44:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-08 09:44:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-08 09:44:55,108 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-08 09:44:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:55,109 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-08 09:44:55,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-08 09:44:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 09:44:55,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:55,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:55,111 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-08 09:44:55,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:55,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:55,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:55,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:55,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:55,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 09:44:55,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:55,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:44:55,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:44:55,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:44:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:44:55,361 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-08 09:44:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:56,957 INFO L93 Difference]: Finished difference Result 28885 states and 48038 transitions. [2019-09-08 09:44:56,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:44:56,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 09:44:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:57,067 INFO L225 Difference]: With dead ends: 28885 [2019-09-08 09:44:57,067 INFO L226 Difference]: Without dead ends: 24302 [2019-09-08 09:44:57,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:44:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-08 09:44:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-08 09:44:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-08 09:44:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-08 09:44:57,940 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-08 09:44:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:57,941 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-08 09:44:57,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:44:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-08 09:44:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:44:57,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:57,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:57,944 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-08 09:44:57,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:58,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:44:58,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:44:58,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:44:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:58,101 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-08 09:44:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:59,188 INFO L93 Difference]: Finished difference Result 27309 states and 45168 transitions. [2019-09-08 09:44:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:59,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 09:44:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:59,233 INFO L225 Difference]: With dead ends: 27309 [2019-09-08 09:44:59,234 INFO L226 Difference]: Without dead ends: 18232 [2019-09-08 09:44:59,257 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 09:44:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-08 09:45:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-08 09:45:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-08 09:45:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-08 09:45:00,571 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-08 09:45:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:00,571 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-08 09:45:00,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-08 09:45:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:45:00,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:00,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:00,574 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-08 09:45:00,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:45:00,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:45:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:45:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:00,668 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-08 09:45:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:01,466 INFO L93 Difference]: Finished difference Result 28841 states and 47657 transitions. [2019-09-08 09:45:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:45:01,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 09:45:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:01,522 INFO L225 Difference]: With dead ends: 28841 [2019-09-08 09:45:01,523 INFO L226 Difference]: Without dead ends: 20841 [2019-09-08 09:45:01,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-08 09:45:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-08 09:45:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-08 09:45:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-08 09:45:02,665 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-08 09:45:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:02,666 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-08 09:45:02,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:45:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-08 09:45:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:45:02,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:02,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:02,668 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-08 09:45:02,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:02,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:45:02,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:45:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:45:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:45:02,770 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-08 09:45:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:05,151 INFO L93 Difference]: Finished difference Result 60941 states and 100477 transitions. [2019-09-08 09:45:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:45:05,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 09:45:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:05,261 INFO L225 Difference]: With dead ends: 60941 [2019-09-08 09:45:05,262 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 09:45:05,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:45:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 09:45:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-08 09:45:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-08 09:45:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-08 09:45:06,883 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-08 09:45:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:06,884 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-08 09:45:06,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-08 09:45:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 09:45:06,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:06,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:06,886 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-08 09:45:06,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:06,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:06,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:45:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:45:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:45:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:45:06,987 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-08 09:45:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:10,771 INFO L93 Difference]: Finished difference Result 98585 states and 162103 transitions. [2019-09-08 09:45:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:45:10,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 09:45:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:10,920 INFO L225 Difference]: With dead ends: 98585 [2019-09-08 09:45:10,921 INFO L226 Difference]: Without dead ends: 64914 [2019-09-08 09:45:10,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:45:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-08 09:45:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-08 09:45:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-08 09:45:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-08 09:45:13,448 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-08 09:45:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:13,449 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-08 09:45:13,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-08 09:45:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 09:45:13,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:13,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:13,451 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-08 09:45:13,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:13,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:13,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:13,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:13,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:13,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:13,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 09:45:13,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:45:13,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:45:13,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:45:13,622 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-08 09:45:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:25,552 INFO L93 Difference]: Finished difference Result 266912 states and 437681 transitions. [2019-09-08 09:45:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:45:25,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 09:45:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:25,959 INFO L225 Difference]: With dead ends: 266912 [2019-09-08 09:45:25,960 INFO L226 Difference]: Without dead ends: 212252 [2019-09-08 09:45:26,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:45:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-08 09:45:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-08 09:45:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:45:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-08 09:45:37,218 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-08 09:45:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:37,219 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-08 09:45:37,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:45:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-08 09:45:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 09:45:37,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:37,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:37,220 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-08 09:45:37,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:37,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:37,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:37,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:37,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:37,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:45:37,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:45:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:45:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:45:37,542 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-08 09:45:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:50,158 INFO L93 Difference]: Finished difference Result 353665 states and 575236 transitions. [2019-09-08 09:45:50,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:45:50,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-08 09:45:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:50,567 INFO L225 Difference]: With dead ends: 353665 [2019-09-08 09:45:50,567 INFO L226 Difference]: Without dead ends: 205422 [2019-09-08 09:45:50,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:45:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-08 09:46:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-08 09:46:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:46:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-08 09:46:02,005 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-08 09:46:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:02,005 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-08 09:46:02,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:46:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-08 09:46:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 09:46:02,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:02,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:46:02,007 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-08 09:46:02,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:02,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:02,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:46:02,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:46:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:46:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:46:02,271 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-08 09:46:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:21,746 INFO L93 Difference]: Finished difference Result 436044 states and 707875 transitions. [2019-09-08 09:46:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:46:21,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-08 09:46:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:22,275 INFO L225 Difference]: With dead ends: 436044 [2019-09-08 09:46:22,276 INFO L226 Difference]: Without dead ends: 287801 [2019-09-08 09:46:22,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:46:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-08 09:46:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-08 09:46:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-08 09:46:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-08 09:46:49,002 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-08 09:46:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:49,002 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-08 09:46:49,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:46:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-08 09:46:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 09:46:49,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:49,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:46:49,004 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-08 09:46:49,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:49,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:49,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:46:49,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:46:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:46:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:46:49,164 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-08 09:47:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:23,104 INFO L93 Difference]: Finished difference Result 473705 states and 763150 transitions. [2019-09-08 09:47:23,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:47:23,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 09:47:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:23,969 INFO L225 Difference]: With dead ends: 473705 [2019-09-08 09:47:23,970 INFO L226 Difference]: Without dead ends: 473703 [2019-09-08 09:47:24,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:47:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-08 09:47:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-08 09:47:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-08 09:47:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-08 09:47:53,707 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-08 09:47:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:53,707 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-08 09:47:53,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:47:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-08 09:47:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:47:53,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:53,716 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:53,716 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-08 09:47:53,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:53,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:47:53,914 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) [2019-09-08 09:47:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:47:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:54,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 09:47:54,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:47:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:47:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:47:54,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 09:47:54,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:47:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:47:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:47:54,324 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 9 states. [2019-09-08 09:49:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:10,947 INFO L93 Difference]: Finished difference Result 978988 states and 1593906 transitions. [2019-09-08 09:49:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:49:10,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 09:49:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:13,357 INFO L225 Difference]: With dead ends: 978988 [2019-09-08 09:49:13,357 INFO L226 Difference]: Without dead ends: 873902 [2019-09-08 09:49:13,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:49:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873902 states. [2019-09-08 09:50:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873902 to 510458. [2019-09-08 09:50:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510458 states. [2019-09-08 09:50:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510458 states to 510458 states and 824571 transitions. [2019-09-08 09:50:08,619 INFO L78 Accepts]: Start accepts. Automaton has 510458 states and 824571 transitions. Word has length 167 [2019-09-08 09:50:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:08,620 INFO L475 AbstractCegarLoop]: Abstraction has 510458 states and 824571 transitions. [2019-09-08 09:50:08,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:50:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 510458 states and 824571 transitions. [2019-09-08 09:50:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:50:08,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:08,632 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:08,632 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-08 09:50:08,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:08,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:50:08,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:08,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:08,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:08,950 INFO L87 Difference]: Start difference. First operand 510458 states and 824571 transitions. Second operand 4 states. [2019-09-08 09:51:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:29,983 INFO L93 Difference]: Finished difference Result 1034137 states and 1678698 transitions. [2019-09-08 09:51:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:51:29,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-08 09:51:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:31,743 INFO L225 Difference]: With dead ends: 1034137 [2019-09-08 09:51:31,743 INFO L226 Difference]: Without dead ends: 814205 [2019-09-08 09:51:32,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814205 states. [2019-09-08 09:52:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814205 to 720736. [2019-09-08 09:52:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720736 states. [2019-09-08 09:52:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720736 states to 720736 states and 1167117 transitions. [2019-09-08 09:52:55,428 INFO L78 Accepts]: Start accepts. Automaton has 720736 states and 1167117 transitions. Word has length 167 [2019-09-08 09:52:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:55,429 INFO L475 AbstractCegarLoop]: Abstraction has 720736 states and 1167117 transitions. [2019-09-08 09:52:55,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 720736 states and 1167117 transitions. [2019-09-08 09:52:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:52:55,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:55,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:55,437 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-08 09:52:55,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:55,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:55,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 09:52:55,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:52:55,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:52:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:52:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:52:55,618 INFO L87 Difference]: Start difference. First operand 720736 states and 1167117 transitions. Second operand 6 states. [2019-09-08 09:54:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:47,139 INFO L93 Difference]: Finished difference Result 1507793 states and 2452860 transitions. [2019-09-08 09:54:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:54:47,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:54:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:49,134 INFO L225 Difference]: With dead ends: 1507793 [2019-09-08 09:54:49,134 INFO L226 Difference]: Without dead ends: 1036095 [2019-09-08 09:54:49,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:54:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036095 states.