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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:47:36,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:47:36,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:47:36,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:47:36,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:47:36,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:47:36,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:47:36,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:47:36,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:47:36,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:47:36,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:47:36,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:47:36,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:47:36,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:47:36,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:47:36,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:47:36,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:47:36,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:47:36,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:47:36,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:47:36,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:47:36,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:47:36,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:47:36,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:47:36,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:47:36,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:47:36,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:47:36,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:47:36,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:47:36,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:47:36,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:47:36,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:47:36,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:47:36,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:47:36,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:47:36,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:47:36,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:47:36,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:47:36,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:47:36,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:47:36,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:47:36,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:47:36,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:47:36,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:47:36,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:47:36,718 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:47:36,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:47:36,718 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:47:36,719 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:47:36,719 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:47:36,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:47:36,719 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:47:36,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:47:36,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:47:36,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:47:36,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:47:36,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:47:36,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:47:36,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:47:36,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:47:36,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:47:36,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:47:36,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:47:36,724 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:47:36,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:47:36,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:47:36,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:47:36,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:47:36,725 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:47:36,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:47:36,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:47:36,726 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:47:36,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:47:36,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:47:36,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:47:36,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:47:36,808 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:47:36,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:47:36,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6529e3731/ea5dff60c858451686dae00ffb3ef5b1/FLAGc078f9897 [2019-09-10 08:47:37,514 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:47:37,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:47:37,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6529e3731/ea5dff60c858451686dae00ffb3ef5b1/FLAGc078f9897 [2019-09-10 08:47:37,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6529e3731/ea5dff60c858451686dae00ffb3ef5b1 [2019-09-10 08:47:37,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:47:37,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:47:37,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:37,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:47:37,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:47:37,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:37" (1/1) ... [2019-09-10 08:47:37,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc34360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:37, skipping insertion in model container [2019-09-10 08:47:37,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:37" (1/1) ... [2019-09-10 08:47:37,755 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:47:37,832 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:47:38,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:38,423 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:47:38,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:38,674 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:47:38,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38 WrapperNode [2019-09-10 08:47:38,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:38,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:47:38,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:47:38,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:47:38,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (1/1) ... [2019-09-10 08:47:38,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:47:38,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:47:38,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:47:38,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:47:38,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (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-10 08:47:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:47:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:47:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:47:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:47:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:47:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:47:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:47:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:47:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:47:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:47:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:47:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:47:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:47:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:47:40,568 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:47:40,568 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:47:40,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:40 BoogieIcfgContainer [2019-09-10 08:47:40,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:47:40,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:47:40,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:47:40,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:47:40,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:47:37" (1/3) ... [2019-09-10 08:47:40,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381442a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:40, skipping insertion in model container [2019-09-10 08:47:40,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:38" (2/3) ... [2019-09-10 08:47:40,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381442a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:40, skipping insertion in model container [2019-09-10 08:47:40,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:40" (3/3) ... [2019-09-10 08:47:40,579 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:47:40,590 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:47:40,600 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:47:40,618 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:47:40,648 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:47:40,648 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:47:40,648 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:47:40,648 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:47:40,648 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:47:40,649 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:47:40,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:47:40,649 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:47:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states. [2019-09-10 08:47:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:47:40,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:40,701 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] [2019-09-10 08:47:40,704 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1480412157, now seen corresponding path program 1 times [2019-09-10 08:47:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:40,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:41,388 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-10 08:47:41,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:41,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:41,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:41,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:41,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:41,416 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 3 states. [2019-09-10 08:47:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:41,607 INFO L93 Difference]: Finished difference Result 489 states and 836 transitions. [2019-09-10 08:47:41,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:41,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:47:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:41,642 INFO L225 Difference]: With dead ends: 489 [2019-09-10 08:47:41,643 INFO L226 Difference]: Without dead ends: 481 [2019-09-10 08:47:41,644 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-10 08:47:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-10 08:47:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2019-09-10 08:47:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-09-10 08:47:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 793 transitions. [2019-09-10 08:47:41,725 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 793 transitions. Word has length 110 [2019-09-10 08:47:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:41,726 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 793 transitions. [2019-09-10 08:47:41,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 793 transitions. [2019-09-10 08:47:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:47:41,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:41,733 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] [2019-09-10 08:47:41,733 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1040646636, now seen corresponding path program 1 times [2019-09-10 08:47:41,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:41,967 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-10 08:47:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:41,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:41,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:41,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:41,971 INFO L87 Difference]: Start difference. First operand 478 states and 793 transitions. Second operand 3 states. [2019-09-10 08:47:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:42,023 INFO L93 Difference]: Finished difference Result 751 states and 1241 transitions. [2019-09-10 08:47:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:42,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 08:47:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:42,031 INFO L225 Difference]: With dead ends: 751 [2019-09-10 08:47:42,031 INFO L226 Difference]: Without dead ends: 751 [2019-09-10 08:47:42,033 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-10 08:47:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-10 08:47:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 747. [2019-09-10 08:47:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-09-10 08:47:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1238 transitions. [2019-09-10 08:47:42,075 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1238 transitions. Word has length 113 [2019-09-10 08:47:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:42,076 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1238 transitions. [2019-09-10 08:47:42,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1238 transitions. [2019-09-10 08:47:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:47:42,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:42,080 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] [2019-09-10 08:47:42,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -915935034, now seen corresponding path program 1 times [2019-09-10 08:47:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:42,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-10 08:47:42,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:42,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:42,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:42,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:42,276 INFO L87 Difference]: Start difference. First operand 747 states and 1238 transitions. Second operand 3 states. [2019-09-10 08:47:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:42,331 INFO L93 Difference]: Finished difference Result 1269 states and 2091 transitions. [2019-09-10 08:47:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:42,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:47:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:42,344 INFO L225 Difference]: With dead ends: 1269 [2019-09-10 08:47:42,344 INFO L226 Difference]: Without dead ends: 1269 [2019-09-10 08:47:42,345 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-10 08:47:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-10 08:47:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1263. [2019-09-10 08:47:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-09-10 08:47:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2086 transitions. [2019-09-10 08:47:42,392 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2086 transitions. Word has length 116 [2019-09-10 08:47:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:42,393 INFO L475 AbstractCegarLoop]: Abstraction has 1263 states and 2086 transitions. [2019-09-10 08:47:42,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2086 transitions. [2019-09-10 08:47:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:47:42,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:42,399 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] [2019-09-10 08:47:42,399 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2119644227, now seen corresponding path program 1 times [2019-09-10 08:47:42,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:42,605 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-10 08:47:42,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:42,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:42,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:42,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:42,607 INFO L87 Difference]: Start difference. First operand 1263 states and 2086 transitions. Second operand 3 states. [2019-09-10 08:47:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:42,659 INFO L93 Difference]: Finished difference Result 2261 states and 3707 transitions. [2019-09-10 08:47:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:42,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:47:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:42,673 INFO L225 Difference]: With dead ends: 2261 [2019-09-10 08:47:42,673 INFO L226 Difference]: Without dead ends: 2261 [2019-09-10 08:47:42,674 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-10 08:47:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-09-10 08:47:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2251. [2019-09-10 08:47:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2019-09-10 08:47:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3698 transitions. [2019-09-10 08:47:42,728 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3698 transitions. Word has length 119 [2019-09-10 08:47:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:42,728 INFO L475 AbstractCegarLoop]: Abstraction has 2251 states and 3698 transitions. [2019-09-10 08:47:42,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3698 transitions. [2019-09-10 08:47:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:47:42,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:42,731 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] [2019-09-10 08:47:42,732 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:42,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1574727771, now seen corresponding path program 1 times [2019-09-10 08:47:42,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:42,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:42,920 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-10 08:47:42,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:42,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:47:42,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:42,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:47:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:47:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:47:42,923 INFO L87 Difference]: Start difference. First operand 2251 states and 3698 transitions. Second operand 6 states. [2019-09-10 08:47:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:43,318 INFO L93 Difference]: Finished difference Result 6555 states and 10810 transitions. [2019-09-10 08:47:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:47:43,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-10 08:47:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:43,363 INFO L225 Difference]: With dead ends: 6555 [2019-09-10 08:47:43,363 INFO L226 Difference]: Without dead ends: 6555 [2019-09-10 08:47:43,364 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-10 08:47:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2019-09-10 08:47:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 5152. [2019-09-10 08:47:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5152 states. [2019-09-10 08:47:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 8473 transitions. [2019-09-10 08:47:43,575 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 8473 transitions. Word has length 122 [2019-09-10 08:47:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:43,575 INFO L475 AbstractCegarLoop]: Abstraction has 5152 states and 8473 transitions. [2019-09-10 08:47:43,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:47:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 8473 transitions. [2019-09-10 08:47:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:47:43,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:43,580 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] [2019-09-10 08:47:43,580 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1505752343, now seen corresponding path program 1 times [2019-09-10 08:47:43,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:43,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:43,772 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-10 08:47:43,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:43,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:43,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:43,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:43,776 INFO L87 Difference]: Start difference. First operand 5152 states and 8473 transitions. Second operand 4 states. [2019-09-10 08:47:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:43,945 INFO L93 Difference]: Finished difference Result 8723 states and 14396 transitions. [2019-09-10 08:47:43,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:43,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 08:47:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:43,993 INFO L225 Difference]: With dead ends: 8723 [2019-09-10 08:47:43,994 INFO L226 Difference]: Without dead ends: 8723 [2019-09-10 08:47:43,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-09-10 08:47:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 7617. [2019-09-10 08:47:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7617 states. [2019-09-10 08:47:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7617 states to 7617 states and 12546 transitions. [2019-09-10 08:47:44,191 INFO L78 Accepts]: Start accepts. Automaton has 7617 states and 12546 transitions. Word has length 123 [2019-09-10 08:47:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:44,192 INFO L475 AbstractCegarLoop]: Abstraction has 7617 states and 12546 transitions. [2019-09-10 08:47:44,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7617 states and 12546 transitions. [2019-09-10 08:47:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:47:44,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:44,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, 1, 1, 1] [2019-09-10 08:47:44,198 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash -627927902, now seen corresponding path program 1 times [2019-09-10 08:47:44,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:44,417 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-10 08:47:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:44,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:44,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:44,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:44,419 INFO L87 Difference]: Start difference. First operand 7617 states and 12546 transitions. Second operand 4 states. [2019-09-10 08:47:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:44,566 INFO L93 Difference]: Finished difference Result 12858 states and 21181 transitions. [2019-09-10 08:47:44,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:44,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 08:47:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:44,611 INFO L225 Difference]: With dead ends: 12858 [2019-09-10 08:47:44,611 INFO L226 Difference]: Without dead ends: 12858 [2019-09-10 08:47:44,612 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-10 08:47:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2019-09-10 08:47:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 11192. [2019-09-10 08:47:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11192 states. [2019-09-10 08:47:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11192 states to 11192 states and 18415 transitions. [2019-09-10 08:47:44,919 INFO L78 Accepts]: Start accepts. Automaton has 11192 states and 18415 transitions. Word has length 124 [2019-09-10 08:47:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:44,920 INFO L475 AbstractCegarLoop]: Abstraction has 11192 states and 18415 transitions. [2019-09-10 08:47:44,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11192 states and 18415 transitions. [2019-09-10 08:47:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:47:44,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:44,929 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] [2019-09-10 08:47:44,929 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1952019262, now seen corresponding path program 1 times [2019-09-10 08:47:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:45,152 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-10 08:47:45,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:45,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:47:45,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:45,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:47:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:47:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:47:45,155 INFO L87 Difference]: Start difference. First operand 11192 states and 18415 transitions. Second operand 7 states. [2019-09-10 08:47:45,274 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 08:47:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:45,907 INFO L93 Difference]: Finished difference Result 41321 states and 67842 transitions. [2019-09-10 08:47:45,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:47:45,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-10 08:47:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:46,006 INFO L225 Difference]: With dead ends: 41321 [2019-09-10 08:47:46,006 INFO L226 Difference]: Without dead ends: 41321 [2019-09-10 08:47:46,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:47:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41321 states. [2019-09-10 08:47:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41321 to 32200. [2019-09-10 08:47:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32200 states. [2019-09-10 08:47:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32200 states to 32200 states and 52792 transitions. [2019-09-10 08:47:46,774 INFO L78 Accepts]: Start accepts. Automaton has 32200 states and 52792 transitions. Word has length 125 [2019-09-10 08:47:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:46,774 INFO L475 AbstractCegarLoop]: Abstraction has 32200 states and 52792 transitions. [2019-09-10 08:47:46,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:47:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32200 states and 52792 transitions. [2019-09-10 08:47:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:47:46,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:46,782 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] [2019-09-10 08:47:46,782 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1179888794, now seen corresponding path program 1 times [2019-09-10 08:47:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:46,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:46,875 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-10 08:47:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:46,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:46,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:46,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:46,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:46,877 INFO L87 Difference]: Start difference. First operand 32200 states and 52792 transitions. Second operand 3 states. [2019-09-10 08:47:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:47,032 INFO L93 Difference]: Finished difference Result 47772 states and 78023 transitions. [2019-09-10 08:47:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:47,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:47:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:47,155 INFO L225 Difference]: With dead ends: 47772 [2019-09-10 08:47:47,155 INFO L226 Difference]: Without dead ends: 47772 [2019-09-10 08:47:47,156 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-10 08:47:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47772 states. [2019-09-10 08:47:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47772 to 47770. [2019-09-10 08:47:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47770 states. [2019-09-10 08:47:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 78022 transitions. [2019-09-10 08:47:48,958 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 78022 transitions. Word has length 126 [2019-09-10 08:47:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:48,959 INFO L475 AbstractCegarLoop]: Abstraction has 47770 states and 78022 transitions. [2019-09-10 08:47:48,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 78022 transitions. [2019-09-10 08:47:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:47:48,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:48,963 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] [2019-09-10 08:47:48,963 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash 330560745, now seen corresponding path program 1 times [2019-09-10 08:47:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:48,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:48,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:48,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:49,073 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-10 08:47:49,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:49,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:49,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:49,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:49,075 INFO L87 Difference]: Start difference. First operand 47770 states and 78022 transitions. Second operand 4 states. [2019-09-10 08:47:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:49,438 INFO L93 Difference]: Finished difference Result 85170 states and 139272 transitions. [2019-09-10 08:47:49,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:49,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 08:47:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:49,727 INFO L225 Difference]: With dead ends: 85170 [2019-09-10 08:47:49,727 INFO L226 Difference]: Without dead ends: 85170 [2019-09-10 08:47:49,728 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-10 08:47:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85170 states. [2019-09-10 08:47:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85170 to 66318. [2019-09-10 08:47:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66318 states. [2019-09-10 08:47:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66318 states to 66318 states and 108255 transitions. [2019-09-10 08:47:52,049 INFO L78 Accepts]: Start accepts. Automaton has 66318 states and 108255 transitions. Word has length 126 [2019-09-10 08:47:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:52,049 INFO L475 AbstractCegarLoop]: Abstraction has 66318 states and 108255 transitions. [2019-09-10 08:47:52,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66318 states and 108255 transitions. [2019-09-10 08:47:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:47:52,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:52,054 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] [2019-09-10 08:47:52,054 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1031111542, now seen corresponding path program 1 times [2019-09-10 08:47:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:52,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:52,155 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-10 08:47:52,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:52,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:52,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:52,157 INFO L87 Difference]: Start difference. First operand 66318 states and 108255 transitions. Second operand 3 states. [2019-09-10 08:47:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:52,804 INFO L93 Difference]: Finished difference Result 100637 states and 163627 transitions. [2019-09-10 08:47:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:52,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:47:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:52,977 INFO L225 Difference]: With dead ends: 100637 [2019-09-10 08:47:52,977 INFO L226 Difference]: Without dead ends: 100637 [2019-09-10 08:47:52,978 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-10 08:47:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100637 states. [2019-09-10 08:47:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100637 to 100635. [2019-09-10 08:47:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100635 states. [2019-09-10 08:47:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100635 states to 100635 states and 163626 transitions. [2019-09-10 08:47:55,721 INFO L78 Accepts]: Start accepts. Automaton has 100635 states and 163626 transitions. Word has length 126 [2019-09-10 08:47:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:55,722 INFO L475 AbstractCegarLoop]: Abstraction has 100635 states and 163626 transitions. [2019-09-10 08:47:55,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 100635 states and 163626 transitions. [2019-09-10 08:47:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:47:55,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:55,726 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] [2019-09-10 08:47:55,726 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 590709654, now seen corresponding path program 1 times [2019-09-10 08:47:55,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:55,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:55,820 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-10 08:47:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:55,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:55,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:55,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:55,822 INFO L87 Difference]: Start difference. First operand 100635 states and 163626 transitions. Second operand 3 states. [2019-09-10 08:47:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:56,334 INFO L93 Difference]: Finished difference Result 148807 states and 240972 transitions. [2019-09-10 08:47:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:56,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:47:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:58,665 INFO L225 Difference]: With dead ends: 148807 [2019-09-10 08:47:58,665 INFO L226 Difference]: Without dead ends: 148807 [2019-09-10 08:47:58,666 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-10 08:47:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148807 states. [2019-09-10 08:47:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148807 to 148805. [2019-09-10 08:47:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148805 states. [2019-09-10 08:48:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148805 states to 148805 states and 240971 transitions. [2019-09-10 08:48:00,111 INFO L78 Accepts]: Start accepts. Automaton has 148805 states and 240971 transitions. Word has length 126 [2019-09-10 08:48:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:00,112 INFO L475 AbstractCegarLoop]: Abstraction has 148805 states and 240971 transitions. [2019-09-10 08:48:00,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 148805 states and 240971 transitions. [2019-09-10 08:48:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:48:00,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:00,114 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] [2019-09-10 08:48:00,115 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1885688154, now seen corresponding path program 1 times [2019-09-10 08:48:00,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:00,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:00,206 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-10 08:48:00,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:00,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:00,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:00,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:00,208 INFO L87 Difference]: Start difference. First operand 148805 states and 240971 transitions. Second operand 3 states. [2019-09-10 08:48:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:00,794 INFO L93 Difference]: Finished difference Result 216925 states and 350264 transitions. [2019-09-10 08:48:00,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:00,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:48:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:04,212 INFO L225 Difference]: With dead ends: 216925 [2019-09-10 08:48:04,212 INFO L226 Difference]: Without dead ends: 216925 [2019-09-10 08:48:04,212 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-10 08:48:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216925 states. [2019-09-10 08:48:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216925 to 216923. [2019-09-10 08:48:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216923 states. [2019-09-10 08:48:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216923 states to 216923 states and 350263 transitions. [2019-09-10 08:48:06,213 INFO L78 Accepts]: Start accepts. Automaton has 216923 states and 350263 transitions. Word has length 126 [2019-09-10 08:48:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:06,213 INFO L475 AbstractCegarLoop]: Abstraction has 216923 states and 350263 transitions. [2019-09-10 08:48:06,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 216923 states and 350263 transitions. [2019-09-10 08:48:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:48:06,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:06,217 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-10 08:48:06,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1648333671, now seen corresponding path program 1 times [2019-09-10 08:48:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:06,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:07,215 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-10 08:48:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:48:07,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:07,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:48:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:48:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:48:07,218 INFO L87 Difference]: Start difference. First operand 216923 states and 350263 transitions. Second operand 6 states. [2019-09-10 08:48:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:08,171 INFO L93 Difference]: Finished difference Result 313185 states and 505887 transitions. [2019-09-10 08:48:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:48:08,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 08:48:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:08,585 INFO L225 Difference]: With dead ends: 313185 [2019-09-10 08:48:08,585 INFO L226 Difference]: Without dead ends: 313185 [2019-09-10 08:48:08,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313185 states. [2019-09-10 08:48:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313185 to 247483. [2019-09-10 08:48:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247483 states. [2019-09-10 08:48:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247483 states to 247483 states and 398873 transitions. [2019-09-10 08:48:15,373 INFO L78 Accepts]: Start accepts. Automaton has 247483 states and 398873 transitions. Word has length 128 [2019-09-10 08:48:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:15,374 INFO L475 AbstractCegarLoop]: Abstraction has 247483 states and 398873 transitions. [2019-09-10 08:48:15,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:48:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 247483 states and 398873 transitions. [2019-09-10 08:48:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:48:15,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:15,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:48:15,375 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1098345903, now seen corresponding path program 1 times [2019-09-10 08:48:15,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:15,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:15,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:15,615 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-10 08:48:15,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:15,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:48:15,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:15,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:48:15,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:48:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:48:15,617 INFO L87 Difference]: Start difference. First operand 247483 states and 398873 transitions. Second operand 6 states. [2019-09-10 08:48:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:20,809 INFO L93 Difference]: Finished difference Result 480769 states and 775673 transitions. [2019-09-10 08:48:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:48:20,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-10 08:48:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:21,553 INFO L225 Difference]: With dead ends: 480769 [2019-09-10 08:48:21,553 INFO L226 Difference]: Without dead ends: 480769 [2019-09-10 08:48:21,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:48:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480769 states. [2019-09-10 08:48:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480769 to 440411. [2019-09-10 08:48:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440411 states. [2019-09-10 08:48:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440411 states to 440411 states and 709530 transitions. [2019-09-10 08:48:33,497 INFO L78 Accepts]: Start accepts. Automaton has 440411 states and 709530 transitions. Word has length 131 [2019-09-10 08:48:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:33,497 INFO L475 AbstractCegarLoop]: Abstraction has 440411 states and 709530 transitions. [2019-09-10 08:48:33,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:48:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 440411 states and 709530 transitions. [2019-09-10 08:48:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:48:33,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:33,498 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] [2019-09-10 08:48:33,498 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -312924490, now seen corresponding path program 1 times [2019-09-10 08:48:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:33,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:33,631 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-10 08:48:33,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:33,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:48:33,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:33,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:48:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:48:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:33,633 INFO L87 Difference]: Start difference. First operand 440411 states and 709530 transitions. Second operand 5 states. [2019-09-10 08:48:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:37,341 INFO L93 Difference]: Finished difference Result 737099 states and 1180385 transitions. [2019-09-10 08:48:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:48:37,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 08:48:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:38,558 INFO L225 Difference]: With dead ends: 737099 [2019-09-10 08:48:38,558 INFO L226 Difference]: Without dead ends: 737099 [2019-09-10 08:48:38,559 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-10 08:48:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737099 states. [2019-09-10 08:48:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737099 to 446323. [2019-09-10 08:48:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446323 states. [2019-09-10 08:48:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446323 states to 446323 states and 715397 transitions. [2019-09-10 08:48:55,247 INFO L78 Accepts]: Start accepts. Automaton has 446323 states and 715397 transitions. Word has length 132 [2019-09-10 08:48:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:55,248 INFO L475 AbstractCegarLoop]: Abstraction has 446323 states and 715397 transitions. [2019-09-10 08:48:55,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:48:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 446323 states and 715397 transitions. [2019-09-10 08:48:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:48:55,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:55,253 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:55,254 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1657589921, now seen corresponding path program 1 times [2019-09-10 08:48:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:55,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:48:55,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:55,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:48:55,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:55,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:48:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:48:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:48:55,427 INFO L87 Difference]: Start difference. First operand 446323 states and 715397 transitions. Second operand 6 states. [2019-09-10 08:48:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:58,934 INFO L93 Difference]: Finished difference Result 540400 states and 867216 transitions. [2019-09-10 08:48:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:48:58,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-10 08:48:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:59,838 INFO L225 Difference]: With dead ends: 540400 [2019-09-10 08:48:59,838 INFO L226 Difference]: Without dead ends: 540400 [2019-09-10 08:48:59,839 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-10 08:49:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540400 states. [2019-09-10 08:49:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540400 to 498590. [2019-09-10 08:49:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498590 states. [2019-09-10 08:49:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498590 states to 498590 states and 799189 transitions. [2019-09-10 08:49:14,084 INFO L78 Accepts]: Start accepts. Automaton has 498590 states and 799189 transitions. Word has length 168 [2019-09-10 08:49:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:14,084 INFO L475 AbstractCegarLoop]: Abstraction has 498590 states and 799189 transitions. [2019-09-10 08:49:14,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:49:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 498590 states and 799189 transitions. [2019-09-10 08:49:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:49:14,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:14,090 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:14,090 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1508812669, now seen corresponding path program 1 times [2019-09-10 08:49:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:14,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:14,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:14,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:14,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:14,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:14,263 INFO L87 Difference]: Start difference. First operand 498590 states and 799189 transitions. Second operand 3 states. [2019-09-10 08:49:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:20,784 INFO L93 Difference]: Finished difference Result 402278 states and 646134 transitions. [2019-09-10 08:49:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:20,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:49:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:21,361 INFO L225 Difference]: With dead ends: 402278 [2019-09-10 08:49:21,361 INFO L226 Difference]: Without dead ends: 402278 [2019-09-10 08:49:21,362 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-10 08:49:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402278 states. [2019-09-10 08:49:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402278 to 402276. [2019-09-10 08:49:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402276 states. [2019-09-10 08:49:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402276 states to 402276 states and 646133 transitions. [2019-09-10 08:49:27,461 INFO L78 Accepts]: Start accepts. Automaton has 402276 states and 646133 transitions. Word has length 168 [2019-09-10 08:49:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:27,461 INFO L475 AbstractCegarLoop]: Abstraction has 402276 states and 646133 transitions. [2019-09-10 08:49:27,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 402276 states and 646133 transitions. [2019-09-10 08:49:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:49:27,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:27,464 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:27,465 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1407987027, now seen corresponding path program 1 times [2019-09-10 08:49:27,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:27,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:27,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:27,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:27,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:27,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:27,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:27,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:27,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:27,597 INFO L87 Difference]: Start difference. First operand 402276 states and 646133 transitions. Second operand 3 states. [2019-09-10 08:49:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:28,052 INFO L93 Difference]: Finished difference Result 169831 states and 272226 transitions. [2019-09-10 08:49:28,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:28,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:49:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:28,276 INFO L225 Difference]: With dead ends: 169831 [2019-09-10 08:49:28,276 INFO L226 Difference]: Without dead ends: 169831 [2019-09-10 08:49:28,277 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-10 08:49:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169831 states. [2019-09-10 08:49:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169831 to 169829. [2019-09-10 08:49:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169829 states. [2019-09-10 08:49:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169829 states to 169829 states and 272225 transitions. [2019-09-10 08:49:35,424 INFO L78 Accepts]: Start accepts. Automaton has 169829 states and 272225 transitions. Word has length 168 [2019-09-10 08:49:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:35,425 INFO L475 AbstractCegarLoop]: Abstraction has 169829 states and 272225 transitions. [2019-09-10 08:49:35,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 169829 states and 272225 transitions. [2019-09-10 08:49:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:49:35,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:35,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:49:35,429 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1987987435, now seen corresponding path program 1 times [2019-09-10 08:49:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:35,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:35,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:49:35,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2019-09-10 08:49:35,586 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [227], [230], [235], [257], [265], [267], [307], [347], [350], [355], [377], [380], [383], [385], [387], [390], [393], [396], [399], [402], [409], [417], [419], [422], [423], [425], [434], [437], [448], [451], [463], [471], [475], [479], [481], [483], [486], [532], [542], [552], [562], [584], [587], [633], [643], [653], [663], [685], [688], [734], [744], [754], [764], [770], [774], [778], [782], [784], [786], [789], [835], [845], [855], [865], [1481], [1482], [1486], [1487], [1488] [2019-09-10 08:49:35,639 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:49:35,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:49:35,856 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:49:36,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:49:36,437 INFO L272 AbstractInterpreter]: Visited 153 different actions 466 times. Merged at 64 different actions 295 times. Widened at 19 different actions 22 times. Performed 1589 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1589 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 10 different actions. Largest state had 294 variables. [2019-09-10 08:49:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:36,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:49:36,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:36,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 08:49:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:36,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:49:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:36,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 08:49:36,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:49:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:49:36,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:49:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:49:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:49:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2019-09-10 08:49:36,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:36,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:49:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:49:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:49:36,957 INFO L87 Difference]: Start difference. First operand 169829 states and 272225 transitions. Second operand 6 states. [2019-09-10 08:49:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:38,244 INFO L93 Difference]: Finished difference Result 186280 states and 298822 transitions. [2019-09-10 08:49:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:49:38,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-10 08:49:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:39,031 INFO L225 Difference]: With dead ends: 186280 [2019-09-10 08:49:39,031 INFO L226 Difference]: Without dead ends: 186280 [2019-09-10 08:49:39,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:49:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186280 states. [2019-09-10 08:49:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186280 to 169829. [2019-09-10 08:49:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169829 states. [2019-09-10 08:49:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169829 states to 169829 states and 272029 transitions. [2019-09-10 08:49:44,972 INFO L78 Accepts]: Start accepts. Automaton has 169829 states and 272029 transitions. Word has length 171 [2019-09-10 08:49:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:44,972 INFO L475 AbstractCegarLoop]: Abstraction has 169829 states and 272029 transitions. [2019-09-10 08:49:44,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:49:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 169829 states and 272029 transitions. [2019-09-10 08:49:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:49:44,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:44,982 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:49:44,982 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1074362494, now seen corresponding path program 1 times [2019-09-10 08:49:44,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:45,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:45,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:49:45,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2019-09-10 08:49:45,184 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [227], [230], [235], [257], [260], [263], [265], [267], [307], [347], [350], [355], [377], [385], [387], [390], [393], [396], [399], [402], [409], [417], [419], [422], [423], [425], [434], [437], [448], [451], [463], [467], [471], [475], [479], [481], [483], [486], [532], [542], [552], [562], [584], [587], [633], [643], [653], [663], [685], [688], [734], [744], [754], [764], [774], [778], [782], [784], [786], [789], [835], [845], [855], [865], [1481], [1482], [1486], [1487], [1488] [2019-09-10 08:49:45,197 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:49:45,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:49:45,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:49:45,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:49:45,727 INFO L272 AbstractInterpreter]: Visited 153 different actions 500 times. Merged at 64 different actions 327 times. Widened at 30 different actions 38 times. Performed 1626 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 9 different actions. Largest state had 294 variables. [2019-09-10 08:49:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:45,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:49:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:45,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:49:45,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:45,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:49:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:46,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 08:49:46,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:49:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:46,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:49:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:49:46,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2019-09-10 08:49:46,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:46,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:49:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:49:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:49:46,355 INFO L87 Difference]: Start difference. First operand 169829 states and 272029 transitions. Second operand 6 states. [2019-09-10 08:49:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:47,564 INFO L93 Difference]: Finished difference Result 215410 states and 345539 transitions. [2019-09-10 08:49:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:49:47,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-10 08:49:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:47,874 INFO L225 Difference]: With dead ends: 215410 [2019-09-10 08:49:47,874 INFO L226 Difference]: Without dead ends: 215410 [2019-09-10 08:49:47,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:49:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215410 states. [2019-09-10 08:49:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215410 to 195970. [2019-09-10 08:49:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195970 states. [2019-09-10 08:49:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195970 states to 195970 states and 313927 transitions. [2019-09-10 08:49:51,519 INFO L78 Accepts]: Start accepts. Automaton has 195970 states and 313927 transitions. Word has length 171 [2019-09-10 08:49:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:51,519 INFO L475 AbstractCegarLoop]: Abstraction has 195970 states and 313927 transitions. [2019-09-10 08:49:51,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:49:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 195970 states and 313927 transitions. [2019-09-10 08:49:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:49:51,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:51,522 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:49:51,522 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash -501825097, now seen corresponding path program 1 times [2019-09-10 08:49:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:51,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:51,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:51,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:51,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:51,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:51,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:51,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:51,636 INFO L87 Difference]: Start difference. First operand 195970 states and 313927 transitions. Second operand 3 states. [2019-09-10 08:49:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:52,593 INFO L93 Difference]: Finished difference Result 354159 states and 566567 transitions. [2019-09-10 08:49:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:52,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:49:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:53,307 INFO L225 Difference]: With dead ends: 354159 [2019-09-10 08:49:53,307 INFO L226 Difference]: Without dead ends: 354159 [2019-09-10 08:49:53,308 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-10 08:49:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354159 states. [2019-09-10 08:50:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354159 to 353652. [2019-09-10 08:50:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353652 states. [2019-09-10 08:50:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353652 states to 353652 states and 566061 transitions. [2019-09-10 08:50:02,187 INFO L78 Accepts]: Start accepts. Automaton has 353652 states and 566061 transitions. Word has length 172 [2019-09-10 08:50:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:02,187 INFO L475 AbstractCegarLoop]: Abstraction has 353652 states and 566061 transitions. [2019-09-10 08:50:02,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 353652 states and 566061 transitions. [2019-09-10 08:50:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:50:02,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:02,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:50:02,191 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash 988332752, now seen corresponding path program 1 times [2019-09-10 08:50:02,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:02,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:02,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:02,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:02,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:02,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:02,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:02,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:02,314 INFO L87 Difference]: Start difference. First operand 353652 states and 566061 transitions. Second operand 3 states. [2019-09-10 08:50:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:03,885 INFO L93 Difference]: Finished difference Result 147547 states and 235574 transitions. [2019-09-10 08:50:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:03,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:50:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:04,139 INFO L225 Difference]: With dead ends: 147547 [2019-09-10 08:50:04,139 INFO L226 Difference]: Without dead ends: 147547 [2019-09-10 08:50:04,140 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-10 08:50:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147547 states. [2019-09-10 08:50:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147547 to 147545. [2019-09-10 08:50:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147545 states. [2019-09-10 08:50:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147545 states to 147545 states and 235573 transitions. [2019-09-10 08:50:10,502 INFO L78 Accepts]: Start accepts. Automaton has 147545 states and 235573 transitions. Word has length 172 [2019-09-10 08:50:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:10,502 INFO L475 AbstractCegarLoop]: Abstraction has 147545 states and 235573 transitions. [2019-09-10 08:50:10,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 147545 states and 235573 transitions. [2019-09-10 08:50:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:50:10,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:10,505 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:50:10,505 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -657170400, now seen corresponding path program 1 times [2019-09-10 08:50:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:10,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:10,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:10,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:10,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:10,633 INFO L87 Difference]: Start difference. First operand 147545 states and 235573 transitions. Second operand 3 states. [2019-09-10 08:50:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:10,837 INFO L93 Difference]: Finished difference Result 58060 states and 92594 transitions. [2019-09-10 08:50:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:10,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:50:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:10,935 INFO L225 Difference]: With dead ends: 58060 [2019-09-10 08:50:10,935 INFO L226 Difference]: Without dead ends: 58060 [2019-09-10 08:50:10,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58060 states. [2019-09-10 08:50:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58060 to 58058. [2019-09-10 08:50:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58058 states. [2019-09-10 08:50:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58058 states to 58058 states and 92593 transitions. [2019-09-10 08:50:12,299 INFO L78 Accepts]: Start accepts. Automaton has 58058 states and 92593 transitions. Word has length 175 [2019-09-10 08:50:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:12,300 INFO L475 AbstractCegarLoop]: Abstraction has 58058 states and 92593 transitions. [2019-09-10 08:50:12,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58058 states and 92593 transitions. [2019-09-10 08:50:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:50:12,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:12,303 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:12,303 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2084627698, now seen corresponding path program 1 times [2019-09-10 08:50:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:12,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:12,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:12,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:50:12,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:50:12,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2019-09-10 08:50:12,465 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [227], [230], [235], [257], [265], [267], [270], [275], [297], [300], [303], [305], [307], [310], [315], [337], [345], [347], [350], [355], [377], [385], [387], [390], [393], [396], [399], [402], [409], [417], [419], [422], [423], [425], [434], [437], [448], [451], [463], [467], [471], [475], [479], [481], [483], [486], [532], [542], [552], [562], [568], [572], [576], [580], [582], [584], [587], [633], [643], [653], [663], [673], [677], [681], [683], [685], [688], [734], [744], [754], [764], [770], [774], [778], [782], [784], [786], [789], [835], [845], [855], [865], [1481], [1482], [1486], [1487], [1488] [2019-09-10 08:50:12,467 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:50:12,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:50:12,523 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:50:13,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:50:13,029 INFO L272 AbstractInterpreter]: Visited 171 different actions 731 times. Merged at 82 different actions 518 times. Widened at 34 different actions 94 times. Performed 2272 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 17 different actions. Largest state had 294 variables. [2019-09-10 08:50:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:13,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:50:13,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:50:13,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:50:13,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:13,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:50:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:13,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 08:50:13,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:50:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:50:13,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:50:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:50:13,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:50:13,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2019-09-10 08:50:13,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:13,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:50:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:50:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:50:13,484 INFO L87 Difference]: Start difference. First operand 58058 states and 92593 transitions. Second operand 6 states. [2019-09-10 08:50:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:13,777 INFO L93 Difference]: Finished difference Result 70001 states and 111729 transitions. [2019-09-10 08:50:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:50:13,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-09-10 08:50:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:13,856 INFO L225 Difference]: With dead ends: 70001 [2019-09-10 08:50:13,857 INFO L226 Difference]: Without dead ends: 70001 [2019-09-10 08:50:13,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:50:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70001 states. [2019-09-10 08:50:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70001 to 64631. [2019-09-10 08:50:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64631 states. [2019-09-10 08:50:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64631 states to 64631 states and 103087 transitions. [2019-09-10 08:50:15,041 INFO L78 Accepts]: Start accepts. Automaton has 64631 states and 103087 transitions. Word has length 177 [2019-09-10 08:50:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:15,041 INFO L475 AbstractCegarLoop]: Abstraction has 64631 states and 103087 transitions. [2019-09-10 08:50:15,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:50:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 64631 states and 103087 transitions. [2019-09-10 08:50:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:50:15,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:15,044 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:15,044 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2130056439, now seen corresponding path program 1 times [2019-09-10 08:50:15,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:15,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:50:15,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:15,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:15,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:15,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:15,418 INFO L87 Difference]: Start difference. First operand 64631 states and 103087 transitions. Second operand 4 states. [2019-09-10 08:50:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:15,804 INFO L93 Difference]: Finished difference Result 126984 states and 201615 transitions. [2019-09-10 08:50:15,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:15,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 08:50:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:16,011 INFO L225 Difference]: With dead ends: 126984 [2019-09-10 08:50:16,019 INFO L226 Difference]: Without dead ends: 126984 [2019-09-10 08:50:16,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126984 states. [2019-09-10 08:50:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126984 to 126982. [2019-09-10 08:50:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126982 states. [2019-09-10 08:50:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126982 states to 126982 states and 201614 transitions. [2019-09-10 08:50:19,337 INFO L78 Accepts]: Start accepts. Automaton has 126982 states and 201614 transitions. Word has length 178 [2019-09-10 08:50:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:19,338 INFO L475 AbstractCegarLoop]: Abstraction has 126982 states and 201614 transitions. [2019-09-10 08:50:19,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 126982 states and 201614 transitions. [2019-09-10 08:50:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:50:19,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:19,345 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:19,345 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1581537095, now seen corresponding path program 1 times [2019-09-10 08:50:19,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:19,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:19,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:50:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:19,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:19,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:19,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:19,493 INFO L87 Difference]: Start difference. First operand 126982 states and 201614 transitions. Second operand 3 states. [2019-09-10 08:50:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:20,132 INFO L93 Difference]: Finished difference Result 249420 states and 394136 transitions. [2019-09-10 08:50:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:20,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:50:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:20,478 INFO L225 Difference]: With dead ends: 249420 [2019-09-10 08:50:20,479 INFO L226 Difference]: Without dead ends: 249420 [2019-09-10 08:50:20,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249420 states. [2019-09-10 08:50:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249420 to 249418. [2019-09-10 08:50:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249418 states. [2019-09-10 08:50:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249418 states to 249418 states and 394135 transitions. [2019-09-10 08:50:26,410 INFO L78 Accepts]: Start accepts. Automaton has 249418 states and 394135 transitions. Word has length 180 [2019-09-10 08:50:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:26,410 INFO L475 AbstractCegarLoop]: Abstraction has 249418 states and 394135 transitions. [2019-09-10 08:50:26,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 249418 states and 394135 transitions. [2019-09-10 08:50:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:50:26,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:26,420 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:26,420 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1855550594, now seen corresponding path program 1 times [2019-09-10 08:50:26,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:26,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:26,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:50:26,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:26,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:26,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:26,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:26,491 INFO L87 Difference]: Start difference. First operand 249418 states and 394135 transitions. Second operand 3 states. [2019-09-10 08:50:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:27,743 INFO L93 Difference]: Finished difference Result 498803 states and 788210 transitions. [2019-09-10 08:50:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:50:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:28,431 INFO L225 Difference]: With dead ends: 498803 [2019-09-10 08:50:28,431 INFO L226 Difference]: Without dead ends: 498803 [2019-09-10 08:50:28,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498803 states. [2019-09-10 08:50:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498803 to 249437. [2019-09-10 08:50:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249437 states. [2019-09-10 08:50:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249437 states to 249437 states and 394163 transitions. [2019-09-10 08:50:40,026 INFO L78 Accepts]: Start accepts. Automaton has 249437 states and 394163 transitions. Word has length 180 [2019-09-10 08:50:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:40,026 INFO L475 AbstractCegarLoop]: Abstraction has 249437 states and 394163 transitions. [2019-09-10 08:50:40,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 249437 states and 394163 transitions. [2019-09-10 08:50:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:50:40,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:40,036 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:40,036 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash -240105665, now seen corresponding path program 1 times [2019-09-10 08:50:40,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:40,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:50:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:40,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:40,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:40,133 INFO L87 Difference]: Start difference. First operand 249437 states and 394163 transitions. Second operand 3 states. [2019-09-10 08:50:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:42,118 INFO L93 Difference]: Finished difference Result 387847 states and 612074 transitions. [2019-09-10 08:50:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:42,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:50:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:42,854 INFO L225 Difference]: With dead ends: 387847 [2019-09-10 08:50:42,854 INFO L226 Difference]: Without dead ends: 387847 [2019-09-10 08:50:42,855 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-10 08:50:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387847 states. [2019-09-10 08:50:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387847 to 253949. [2019-09-10 08:50:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253949 states. [2019-09-10 08:50:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253949 states to 253949 states and 400921 transitions. [2019-09-10 08:50:52,688 INFO L78 Accepts]: Start accepts. Automaton has 253949 states and 400921 transitions. Word has length 180 [2019-09-10 08:50:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:52,688 INFO L475 AbstractCegarLoop]: Abstraction has 253949 states and 400921 transitions. [2019-09-10 08:50:52,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 253949 states and 400921 transitions. [2019-09-10 08:50:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:50:52,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:52,698 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:52,698 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1449947845, now seen corresponding path program 1 times [2019-09-10 08:50:52,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:52,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:52,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:52,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:52,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:50:52,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:52,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:52,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:52,768 INFO L87 Difference]: Start difference. First operand 253949 states and 400921 transitions. Second operand 3 states. [2019-09-10 08:50:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:55,454 INFO L93 Difference]: Finished difference Result 507845 states and 801747 transitions. [2019-09-10 08:50:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:55,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 08:50:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:56,318 INFO L225 Difference]: With dead ends: 507845 [2019-09-10 08:50:56,318 INFO L226 Difference]: Without dead ends: 507845 [2019-09-10 08:50:56,319 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-10 08:50:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507845 states. [2019-09-10 08:51:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507845 to 253967. [2019-09-10 08:51:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253967 states. [2019-09-10 08:51:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253967 states to 253967 states and 400942 transitions. [2019-09-10 08:51:08,073 INFO L78 Accepts]: Start accepts. Automaton has 253967 states and 400942 transitions. Word has length 181 [2019-09-10 08:51:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:08,073 INFO L475 AbstractCegarLoop]: Abstraction has 253967 states and 400942 transitions. [2019-09-10 08:51:08,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 253967 states and 400942 transitions. [2019-09-10 08:51:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:51:08,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:08,084 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:08,084 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1968211026, now seen corresponding path program 1 times [2019-09-10 08:51:08,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:08,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:08,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:51:08,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:08,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:08,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:08,179 INFO L87 Difference]: Start difference. First operand 253967 states and 400942 transitions. Second operand 3 states. [2019-09-10 08:51:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:09,052 INFO L93 Difference]: Finished difference Result 370205 states and 583381 transitions. [2019-09-10 08:51:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:09,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:51:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:09,627 INFO L225 Difference]: With dead ends: 370205 [2019-09-10 08:51:09,627 INFO L226 Difference]: Without dead ends: 370205 [2019-09-10 08:51:09,628 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-10 08:51:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370205 states. [2019-09-10 08:51:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370205 to 259231. [2019-09-10 08:51:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259231 states. [2019-09-10 08:51:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259231 states to 259231 states and 408452 transitions. [2019-09-10 08:51:20,966 INFO L78 Accepts]: Start accepts. Automaton has 259231 states and 408452 transitions. Word has length 182 [2019-09-10 08:51:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:20,967 INFO L475 AbstractCegarLoop]: Abstraction has 259231 states and 408452 transitions. [2019-09-10 08:51:20,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 259231 states and 408452 transitions. [2019-09-10 08:51:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:51:20,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:20,974 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:20,974 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1360809265, now seen corresponding path program 1 times [2019-09-10 08:51:20,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:20,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:20,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:20,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:20,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:51:21,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:21,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:21,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:21,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:21,147 INFO L87 Difference]: Start difference. First operand 259231 states and 408452 transitions. Second operand 4 states. [2019-09-10 08:51:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:22,428 INFO L93 Difference]: Finished difference Result 518300 states and 816616 transitions. [2019-09-10 08:51:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:22,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:51:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:24,735 INFO L225 Difference]: With dead ends: 518300 [2019-09-10 08:51:24,735 INFO L226 Difference]: Without dead ends: 518300 [2019-09-10 08:51:24,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518300 states. [2019-09-10 08:51:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518300 to 259438. [2019-09-10 08:51:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259438 states. [2019-09-10 08:51:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259438 states to 259438 states and 408805 transitions. [2019-09-10 08:51:34,938 INFO L78 Accepts]: Start accepts. Automaton has 259438 states and 408805 transitions. Word has length 182 [2019-09-10 08:51:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:34,938 INFO L475 AbstractCegarLoop]: Abstraction has 259438 states and 408805 transitions. [2019-09-10 08:51:34,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 259438 states and 408805 transitions. [2019-09-10 08:51:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:51:34,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:34,947 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:34,947 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -881467116, now seen corresponding path program 1 times [2019-09-10 08:51:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:34,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:51:35,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:35,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:35,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:35,079 INFO L87 Difference]: Start difference. First operand 259438 states and 408805 transitions. Second operand 3 states. [2019-09-10 08:51:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:37,438 INFO L93 Difference]: Finished difference Result 509519 states and 798953 transitions. [2019-09-10 08:51:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:37,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:51:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:38,295 INFO L225 Difference]: With dead ends: 509519 [2019-09-10 08:51:38,296 INFO L226 Difference]: Without dead ends: 509519 [2019-09-10 08:51:38,296 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-10 08:51:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509519 states. [2019-09-10 08:51:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509519 to 509517. [2019-09-10 08:51:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509517 states. [2019-09-10 08:51:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509517 states to 509517 states and 798952 transitions. [2019-09-10 08:51:54,197 INFO L78 Accepts]: Start accepts. Automaton has 509517 states and 798952 transitions. Word has length 182 [2019-09-10 08:51:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:54,197 INFO L475 AbstractCegarLoop]: Abstraction has 509517 states and 798952 transitions. [2019-09-10 08:51:54,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 509517 states and 798952 transitions. [2019-09-10 08:51:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:51:54,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:54,213 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:54,213 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:54,214 INFO L82 PathProgramCache]: Analyzing trace with hash 523272520, now seen corresponding path program 1 times [2019-09-10 08:51:54,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:54,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:54,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:54,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:51:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:51:54,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:54,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:51:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:51:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:54,371 INFO L87 Difference]: Start difference. First operand 509517 states and 798952 transitions. Second operand 5 states. [2019-09-10 08:51:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:57,145 INFO L93 Difference]: Finished difference Result 509517 states and 791412 transitions. [2019-09-10 08:51:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:51:57,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:51:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:57,862 INFO L225 Difference]: With dead ends: 509517 [2019-09-10 08:51:57,862 INFO L226 Difference]: Without dead ends: 509517 [2019-09-10 08:51:57,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:51:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509517 states. [2019-09-10 08:52:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509517 to 509517. [2019-09-10 08:52:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509517 states. [2019-09-10 08:52:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509517 states to 509517 states and 791412 transitions. [2019-09-10 08:52:13,481 INFO L78 Accepts]: Start accepts. Automaton has 509517 states and 791412 transitions. Word has length 183 [2019-09-10 08:52:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:13,481 INFO L475 AbstractCegarLoop]: Abstraction has 509517 states and 791412 transitions. [2019-09-10 08:52:13,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:52:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 509517 states and 791412 transitions. [2019-09-10 08:52:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:52:13,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:13,495 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:13,495 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2107889539, now seen corresponding path program 1 times [2019-09-10 08:52:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:13,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:52:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:13,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:13,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:13,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:13,727 INFO L87 Difference]: Start difference. First operand 509517 states and 791412 transitions. Second operand 4 states. [2019-09-10 08:52:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:23,796 INFO L93 Difference]: Finished difference Result 996032 states and 1541313 transitions. [2019-09-10 08:52:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:23,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-10 08:52:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:26,295 INFO L225 Difference]: With dead ends: 996032 [2019-09-10 08:52:26,296 INFO L226 Difference]: Without dead ends: 996032 [2019-09-10 08:52:26,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996032 states. [2019-09-10 08:52:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996032 to 996030. [2019-09-10 08:52:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996030 states. [2019-09-10 08:52:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996030 states to 996030 states and 1541312 transitions. [2019-09-10 08:52:56,892 INFO L78 Accepts]: Start accepts. Automaton has 996030 states and 1541312 transitions. Word has length 183 [2019-09-10 08:52:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:56,892 INFO L475 AbstractCegarLoop]: Abstraction has 996030 states and 1541312 transitions. [2019-09-10 08:52:56,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 996030 states and 1541312 transitions. [2019-09-10 08:52:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:52:56,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:56,922 INFO L399 BasicCegarLoop]: trace histogram [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, 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-10 08:52:56,922 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 666921462, now seen corresponding path program 1 times [2019-09-10 08:52:56,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:52:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:57,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:57,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:57,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:57,035 INFO L87 Difference]: Start difference. First operand 996030 states and 1541312 transitions. Second operand 3 states. [2019-09-10 08:53:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:06,948 INFO L93 Difference]: Finished difference Result 1955121 states and 3008677 transitions. [2019-09-10 08:53:06,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:06,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:53:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:13,324 INFO L225 Difference]: With dead ends: 1955121 [2019-09-10 08:53:13,324 INFO L226 Difference]: Without dead ends: 1955121 [2019-09-10 08:53:13,324 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-10 08:53:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955121 states.