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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:16:28,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:16:28,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:16:28,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:16:28,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:16:28,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:16:28,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:16:28,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:16:28,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:16:28,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:16:28,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:16:28,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:16:28,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:16:28,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:16:28,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:16:28,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:16:28,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:16:28,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:16:28,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:16:28,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:16:28,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:16:28,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:16:28,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:16:28,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:16:28,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:16:28,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:16:28,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:16:28,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:16:28,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:16:28,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:16:28,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:16:28,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:16:28,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:16:28,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:16:28,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:16:28,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:16:28,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:16:28,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:16:28,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:16:28,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:16:28,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:16:28,735 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 07:16:28,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:16:28,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:16:28,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:16:28,750 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:16:28,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:16:28,751 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:16:28,751 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:16:28,752 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:16:28,752 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:16:28,752 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:16:28,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:16:28,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:16:28,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:16:28,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:16:28,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:16:28,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:16:28,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:16:28,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:16:28,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:16:28,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:16:28,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:16:28,755 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:16:28,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:16:28,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:16:28,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:16:28,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:16:28,756 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:16:28,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:16:28,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:16:28,757 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:16:28,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:16:28,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:16:28,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:16:28,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:16:28,803 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:16:28,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:16:28,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1b124dd/1ec391da9a574946bd7aa5a3583f1971/FLAGb56d41d8f [2019-09-10 07:16:29,398 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:16:29,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:16:29,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1b124dd/1ec391da9a574946bd7aa5a3583f1971/FLAGb56d41d8f [2019-09-10 07:16:29,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1b124dd/1ec391da9a574946bd7aa5a3583f1971 [2019-09-10 07:16:29,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:16:29,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:16:29,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:29,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:16:29,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:16:29,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:29" (1/1) ... [2019-09-10 07:16:29,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:29, skipping insertion in model container [2019-09-10 07:16:29,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:29" (1/1) ... [2019-09-10 07:16:29,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:16:29,800 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:16:30,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:30,320 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:16:30,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:30,442 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:16:30,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30 WrapperNode [2019-09-10 07:16:30,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:30,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:16:30,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:16:30,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:16:30,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (1/1) ... [2019-09-10 07:16:30,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:16:30,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:16:30,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:16:30,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:16:30,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (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 07:16:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:16:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:16:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:16:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:16:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:16:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:16:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:16:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:16:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:16:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:16:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:16:30,585 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:16:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:16:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:16:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:16:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:16:31,597 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:16:31,597 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:16:31,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:31 BoogieIcfgContainer [2019-09-10 07:16:31,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:16:31,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:16:31,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:16:31,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:16:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:16:29" (1/3) ... [2019-09-10 07:16:31,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19da1b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:31, skipping insertion in model container [2019-09-10 07:16:31,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:30" (2/3) ... [2019-09-10 07:16:31,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19da1b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:31, skipping insertion in model container [2019-09-10 07:16:31,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:31" (3/3) ... [2019-09-10 07:16:31,607 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:16:31,615 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:16:31,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:16:31,640 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:16:31,665 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:16:31,665 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:16:31,666 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:16:31,666 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:16:31,666 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:16:31,666 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:16:31,667 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:16:31,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:16:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-10 07:16:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:16:31,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:31,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:31,706 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -474732239, now seen corresponding path program 1 times [2019-09-10 07:16:31,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:31,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:31,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:32,217 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 07:16:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:32,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:32,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:32,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:32,245 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2019-09-10 07:16:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:32,344 INFO L93 Difference]: Finished difference Result 272 states and 441 transitions. [2019-09-10 07:16:32,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:32,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:16:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:32,362 INFO L225 Difference]: With dead ends: 272 [2019-09-10 07:16:32,363 INFO L226 Difference]: Without dead ends: 264 [2019-09-10 07:16:32,364 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 07:16:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-10 07:16:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-10 07:16:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-10 07:16:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 390 transitions. [2019-09-10 07:16:32,431 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 390 transitions. Word has length 77 [2019-09-10 07:16:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:32,432 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 390 transitions. [2019-09-10 07:16:32,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 390 transitions. [2019-09-10 07:16:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:16:32,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:32,436 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] [2019-09-10 07:16:32,436 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -992316925, now seen corresponding path program 1 times [2019-09-10 07:16:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:32,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:32,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:32,617 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 07:16:32,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:32,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:32,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:32,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:32,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:32,622 INFO L87 Difference]: Start difference. First operand 262 states and 390 transitions. Second operand 3 states. [2019-09-10 07:16:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:32,659 INFO L93 Difference]: Finished difference Result 444 states and 678 transitions. [2019-09-10 07:16:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:32,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:16:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:32,664 INFO L225 Difference]: With dead ends: 444 [2019-09-10 07:16:32,664 INFO L226 Difference]: Without dead ends: 444 [2019-09-10 07:16:32,665 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 07:16:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-10 07:16:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2019-09-10 07:16:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 07:16:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 677 transitions. [2019-09-10 07:16:32,690 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 677 transitions. Word has length 78 [2019-09-10 07:16:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:32,691 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 677 transitions. [2019-09-10 07:16:32,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 677 transitions. [2019-09-10 07:16:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:16:32,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:32,693 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] [2019-09-10 07:16:32,693 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:32,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1011193650, now seen corresponding path program 1 times [2019-09-10 07:16:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:32,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:32,823 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 07:16:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:32,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:32,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:32,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:32,830 INFO L87 Difference]: Start difference. First operand 442 states and 677 transitions. Second operand 3 states. [2019-09-10 07:16:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:32,862 INFO L93 Difference]: Finished difference Result 772 states and 1198 transitions. [2019-09-10 07:16:32,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:32,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:16:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:32,868 INFO L225 Difference]: With dead ends: 772 [2019-09-10 07:16:32,868 INFO L226 Difference]: Without dead ends: 772 [2019-09-10 07:16:32,868 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 07:16:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-10 07:16:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2019-09-10 07:16:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-09-10 07:16:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1197 transitions. [2019-09-10 07:16:32,907 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1197 transitions. Word has length 79 [2019-09-10 07:16:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:32,910 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1197 transitions. [2019-09-10 07:16:32,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1197 transitions. [2019-09-10 07:16:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:16:32,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:32,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:32,920 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 373615374, now seen corresponding path program 1 times [2019-09-10 07:16:32,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:32,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:33,038 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 07:16:33,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:33,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:33,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:33,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:33,041 INFO L87 Difference]: Start difference. First operand 770 states and 1197 transitions. Second operand 3 states. [2019-09-10 07:16:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:33,072 INFO L93 Difference]: Finished difference Result 1364 states and 2130 transitions. [2019-09-10 07:16:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:33,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:16:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:33,081 INFO L225 Difference]: With dead ends: 1364 [2019-09-10 07:16:33,081 INFO L226 Difference]: Without dead ends: 1364 [2019-09-10 07:16:33,081 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 07:16:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-10 07:16:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2019-09-10 07:16:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-10 07:16:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2129 transitions. [2019-09-10 07:16:33,137 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2129 transitions. Word has length 80 [2019-09-10 07:16:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:33,138 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2129 transitions. [2019-09-10 07:16:33,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2129 transitions. [2019-09-10 07:16:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:16:33,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:33,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:33,140 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 779333447, now seen corresponding path program 1 times [2019-09-10 07:16:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:33,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:33,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:33,233 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 07:16:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:33,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:33,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:33,234 INFO L87 Difference]: Start difference. First operand 1362 states and 2129 transitions. Second operand 3 states. [2019-09-10 07:16:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:33,270 INFO L93 Difference]: Finished difference Result 2420 states and 3778 transitions. [2019-09-10 07:16:33,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:33,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:16:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:33,283 INFO L225 Difference]: With dead ends: 2420 [2019-09-10 07:16:33,284 INFO L226 Difference]: Without dead ends: 2420 [2019-09-10 07:16:33,284 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 07:16:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-09-10 07:16:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2019-09-10 07:16:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-09-10 07:16:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3777 transitions. [2019-09-10 07:16:33,342 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3777 transitions. Word has length 81 [2019-09-10 07:16:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:33,343 INFO L475 AbstractCegarLoop]: Abstraction has 2418 states and 3777 transitions. [2019-09-10 07:16:33,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3777 transitions. [2019-09-10 07:16:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:16:33,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:33,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:33,345 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash -148987347, now seen corresponding path program 1 times [2019-09-10 07:16:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:33,436 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 07:16:33,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:33,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:33,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:33,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:33,439 INFO L87 Difference]: Start difference. First operand 2418 states and 3777 transitions. Second operand 3 states. [2019-09-10 07:16:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:33,505 INFO L93 Difference]: Finished difference Result 4276 states and 6642 transitions. [2019-09-10 07:16:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:33,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:16:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:33,533 INFO L225 Difference]: With dead ends: 4276 [2019-09-10 07:16:33,533 INFO L226 Difference]: Without dead ends: 4276 [2019-09-10 07:16:33,534 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 07:16:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-09-10 07:16:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4274. [2019-09-10 07:16:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-09-10 07:16:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 6641 transitions. [2019-09-10 07:16:33,690 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 6641 transitions. Word has length 82 [2019-09-10 07:16:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:33,692 INFO L475 AbstractCegarLoop]: Abstraction has 4274 states and 6641 transitions. [2019-09-10 07:16:33,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 6641 transitions. [2019-09-10 07:16:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:16:33,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:33,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:33,704 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash 328210800, now seen corresponding path program 1 times [2019-09-10 07:16:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:34,057 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 07:16:34,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:16:34,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:34,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:16:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:16:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:16:34,059 INFO L87 Difference]: Start difference. First operand 4274 states and 6641 transitions. Second operand 8 states. [2019-09-10 07:16:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:34,449 INFO L93 Difference]: Finished difference Result 21564 states and 33206 transitions. [2019-09-10 07:16:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:16:34,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 07:16:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:34,560 INFO L225 Difference]: With dead ends: 21564 [2019-09-10 07:16:34,560 INFO L226 Difference]: Without dead ends: 21564 [2019-09-10 07:16:34,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:16:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21564 states. [2019-09-10 07:16:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21564 to 21554. [2019-09-10 07:16:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21554 states. [2019-09-10 07:16:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21554 states to 21554 states and 33201 transitions. [2019-09-10 07:16:35,119 INFO L78 Accepts]: Start accepts. Automaton has 21554 states and 33201 transitions. Word has length 83 [2019-09-10 07:16:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:35,119 INFO L475 AbstractCegarLoop]: Abstraction has 21554 states and 33201 transitions. [2019-09-10 07:16:35,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:16:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21554 states and 33201 transitions. [2019-09-10 07:16:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:16:35,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:35,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:35,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash -513165031, now seen corresponding path program 1 times [2019-09-10 07:16:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:35,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:35,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:35,216 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 07:16:35,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:35,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:35,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:35,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:35,218 INFO L87 Difference]: Start difference. First operand 21554 states and 33201 transitions. Second operand 5 states. [2019-09-10 07:16:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:35,896 INFO L93 Difference]: Finished difference Result 43060 states and 66002 transitions. [2019-09-10 07:16:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:35,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:16:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:36,014 INFO L225 Difference]: With dead ends: 43060 [2019-09-10 07:16:36,014 INFO L226 Difference]: Without dead ends: 43060 [2019-09-10 07:16:36,015 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 07:16:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43060 states. [2019-09-10 07:16:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43060 to 43058. [2019-09-10 07:16:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43058 states. [2019-09-10 07:16:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43058 states to 43058 states and 66001 transitions. [2019-09-10 07:16:37,542 INFO L78 Accepts]: Start accepts. Automaton has 43058 states and 66001 transitions. Word has length 85 [2019-09-10 07:16:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:37,543 INFO L475 AbstractCegarLoop]: Abstraction has 43058 states and 66001 transitions. [2019-09-10 07:16:37,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43058 states and 66001 transitions. [2019-09-10 07:16:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:16:37,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:37,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:37,545 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -670112898, now seen corresponding path program 1 times [2019-09-10 07:16:37,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:37,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:37,909 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 07:16:37,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:37,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:16:37,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:37,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:16:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:16:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:16:37,911 INFO L87 Difference]: Start difference. First operand 43058 states and 66001 transitions. Second operand 8 states. [2019-09-10 07:16:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:40,381 INFO L93 Difference]: Finished difference Result 200318 states and 306103 transitions. [2019-09-10 07:16:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:16:40,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-10 07:16:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:40,853 INFO L225 Difference]: With dead ends: 200318 [2019-09-10 07:16:40,853 INFO L226 Difference]: Without dead ends: 200318 [2019-09-10 07:16:40,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:16:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200318 states. [2019-09-10 07:16:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200318 to 86066. [2019-09-10 07:16:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86066 states. [2019-09-10 07:16:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86066 states to 86066 states and 130417 transitions. [2019-09-10 07:16:43,461 INFO L78 Accepts]: Start accepts. Automaton has 86066 states and 130417 transitions. Word has length 85 [2019-09-10 07:16:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:43,461 INFO L475 AbstractCegarLoop]: Abstraction has 86066 states and 130417 transitions. [2019-09-10 07:16:43,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:16:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 86066 states and 130417 transitions. [2019-09-10 07:16:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:43,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:43,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:43,463 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash 682803964, now seen corresponding path program 1 times [2019-09-10 07:16:43,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:43,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:43,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:43,569 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 07:16:43,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:43,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:43,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:43,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:43,571 INFO L87 Difference]: Start difference. First operand 86066 states and 130417 transitions. Second operand 5 states. [2019-09-10 07:16:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:43,956 INFO L93 Difference]: Finished difference Result 175154 states and 262321 transitions. [2019-09-10 07:16:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:16:43,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:16:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:44,214 INFO L225 Difference]: With dead ends: 175154 [2019-09-10 07:16:44,214 INFO L226 Difference]: Without dead ends: 175154 [2019-09-10 07:16:44,214 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 07:16:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175154 states. [2019-09-10 07:16:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175154 to 89138. [2019-09-10 07:16:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89138 states. [2019-09-10 07:16:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89138 states to 89138 states and 133489 transitions. [2019-09-10 07:16:47,579 INFO L78 Accepts]: Start accepts. Automaton has 89138 states and 133489 transitions. Word has length 86 [2019-09-10 07:16:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 89138 states and 133489 transitions. [2019-09-10 07:16:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 89138 states and 133489 transitions. [2019-09-10 07:16:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:47,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:47,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:47,581 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash -298293779, now seen corresponding path program 1 times [2019-09-10 07:16:47,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:47,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:47,664 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 07:16:47,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:47,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:47,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:47,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:47,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:47,666 INFO L87 Difference]: Start difference. First operand 89138 states and 133489 transitions. Second operand 3 states. [2019-09-10 07:16:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:47,962 INFO L93 Difference]: Finished difference Result 110038 states and 163940 transitions. [2019-09-10 07:16:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:47,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:16:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:48,112 INFO L225 Difference]: With dead ends: 110038 [2019-09-10 07:16:48,112 INFO L226 Difference]: Without dead ends: 110038 [2019-09-10 07:16:48,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 07:16:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110038 states. [2019-09-10 07:16:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110038 to 110036. [2019-09-10 07:16:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110036 states. [2019-09-10 07:16:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110036 states to 110036 states and 163939 transitions. [2019-09-10 07:16:51,892 INFO L78 Accepts]: Start accepts. Automaton has 110036 states and 163939 transitions. Word has length 87 [2019-09-10 07:16:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:51,892 INFO L475 AbstractCegarLoop]: Abstraction has 110036 states and 163939 transitions. [2019-09-10 07:16:51,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 110036 states and 163939 transitions. [2019-09-10 07:16:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:16:51,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:51,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:51,933 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1662270977, now seen corresponding path program 1 times [2019-09-10 07:16:51,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:51,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:52,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:52,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:16:52,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:16:52,266 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [242], [247], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [472], [474], [487], [495], [514], [525], [527], [530], [533], [536], [538], [540], [613], [614], [618], [619], [620] [2019-09-10 07:16:52,309 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:16:52,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:16:52,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:16:53,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:16:53,140 INFO L272 AbstractInterpreter]: Visited 107 different actions 710 times. Merged at 59 different actions 516 times. Widened at 21 different actions 81 times. Performed 2478 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 73 fixpoints after 19 different actions. Largest state had 169 variables. [2019-09-10 07:16:53,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:53,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:16:53,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:53,145 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:16:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:53,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:16:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:16:53,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:16:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:16:53,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:16:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:16:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:16:54,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:16:54,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 07:16:54,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:16:54,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:16:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:16:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:16:54,200 INFO L87 Difference]: Start difference. First operand 110036 states and 163939 transitions. Second operand 19 states. [2019-09-10 07:16:54,778 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-10 07:17:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:24,167 INFO L93 Difference]: Finished difference Result 1184268 states and 1735072 transitions. [2019-09-10 07:17:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-09-10 07:17:24,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2019-09-10 07:17:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:25,908 INFO L225 Difference]: With dead ends: 1184268 [2019-09-10 07:17:25,908 INFO L226 Difference]: Without dead ends: 1184268 [2019-09-10 07:17:25,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16736 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=7029, Invalid=34383, Unknown=0, NotChecked=0, Total=41412 [2019-09-10 07:17:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184268 states. [2019-09-10 07:17:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184268 to 255780. [2019-09-10 07:17:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255780 states. [2019-09-10 07:17:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255780 states to 255780 states and 375891 transitions. [2019-09-10 07:17:42,563 INFO L78 Accepts]: Start accepts. Automaton has 255780 states and 375891 transitions. Word has length 116 [2019-09-10 07:17:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:42,563 INFO L475 AbstractCegarLoop]: Abstraction has 255780 states and 375891 transitions. [2019-09-10 07:17:42,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:17:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 255780 states and 375891 transitions. [2019-09-10 07:17:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:17:42,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:42,648 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:17:42,648 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 482487770, now seen corresponding path program 1 times [2019-09-10 07:17:42,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:42,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:42,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:42,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:42,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:42,736 INFO L87 Difference]: Start difference. First operand 255780 states and 375891 transitions. Second operand 3 states. [2019-09-10 07:17:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:43,576 INFO L93 Difference]: Finished difference Result 434212 states and 632230 transitions. [2019-09-10 07:17:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:43,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:17:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:49,584 INFO L225 Difference]: With dead ends: 434212 [2019-09-10 07:17:49,584 INFO L226 Difference]: Without dead ends: 434212 [2019-09-10 07:17:49,584 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 07:17:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434212 states. [2019-09-10 07:17:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434212 to 423234. [2019-09-10 07:17:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423234 states. [2019-09-10 07:17:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423234 states to 423234 states and 617101 transitions. [2019-09-10 07:17:53,848 INFO L78 Accepts]: Start accepts. Automaton has 423234 states and 617101 transitions. Word has length 117 [2019-09-10 07:17:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:53,848 INFO L475 AbstractCegarLoop]: Abstraction has 423234 states and 617101 transitions. [2019-09-10 07:17:53,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 423234 states and 617101 transitions. [2019-09-10 07:17:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:17:53,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:53,907 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:17:53,908 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1877792189, now seen corresponding path program 1 times [2019-09-10 07:17:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:53,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:53,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:53,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:53,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:53,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:53,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:53,986 INFO L87 Difference]: Start difference. First operand 423234 states and 617101 transitions. Second operand 3 states. [2019-09-10 07:18:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:02,880 INFO L93 Difference]: Finished difference Result 707124 states and 1028926 transitions. [2019-09-10 07:18:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:02,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:18:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:03,701 INFO L225 Difference]: With dead ends: 707124 [2019-09-10 07:18:03,701 INFO L226 Difference]: Without dead ends: 707124 [2019-09-10 07:18:03,702 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 07:18:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707124 states. [2019-09-10 07:18:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707124 to 627266. [2019-09-10 07:18:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627266 states. [2019-09-10 07:18:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627266 states to 627266 states and 912965 transitions. [2019-09-10 07:18:22,278 INFO L78 Accepts]: Start accepts. Automaton has 627266 states and 912965 transitions. Word has length 117 [2019-09-10 07:18:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:22,279 INFO L475 AbstractCegarLoop]: Abstraction has 627266 states and 912965 transitions. [2019-09-10 07:18:22,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 627266 states and 912965 transitions. [2019-09-10 07:18:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:18:22,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:22,341 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:18:22,342 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1892887198, now seen corresponding path program 1 times [2019-09-10 07:18:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:22,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:22,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:22,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:18:22,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:18:22,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 07:18:22,454 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [152], [155], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [249], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [463], [466], [474], [477], [480], [483], [485], [487], [525], [527], [540], [548], [567], [613], [614], [618], [619], [620] [2019-09-10 07:18:22,465 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:18:22,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:18:22,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:18:22,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:18:22,876 INFO L272 AbstractInterpreter]: Visited 104 different actions 539 times. Merged at 53 different actions 370 times. Widened at 16 different actions 42 times. Performed 1880 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 45 fixpoints after 12 different actions. Largest state had 169 variables. [2019-09-10 07:18:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:22,878 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:18:23,295 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 80.51% of their original sizes. [2019-09-10 07:18:23,295 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:18:30,213 INFO L420 sIntCurrentIteration]: We unified 116 AI predicates to 116 [2019-09-10 07:18:30,213 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:18:30,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:18:30,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [7] total 66 [2019-09-10 07:18:30,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:30,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 07:18:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 07:18:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=3260, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 07:18:30,217 INFO L87 Difference]: Start difference. First operand 627266 states and 912965 transitions. Second operand 61 states. [2019-09-10 07:21:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:40,834 INFO L93 Difference]: Finished difference Result 1440439 states and 2033781 transitions. [2019-09-10 07:21:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 695 states. [2019-09-10 07:21:40,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 117 [2019-09-10 07:21:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:42,818 INFO L225 Difference]: With dead ends: 1440439 [2019-09-10 07:21:42,818 INFO L226 Difference]: Without dead ends: 1440439 [2019-09-10 07:21:42,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232700 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=51449, Invalid=476353, Unknown=0, NotChecked=0, Total=527802 [2019-09-10 07:21:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440439 states. [2019-09-10 07:22:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440439 to 848892. [2019-09-10 07:22:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848892 states. [2019-09-10 07:22:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848892 states to 848892 states and 1215699 transitions. [2019-09-10 07:22:30,475 INFO L78 Accepts]: Start accepts. Automaton has 848892 states and 1215699 transitions. Word has length 117 [2019-09-10 07:22:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:30,475 INFO L475 AbstractCegarLoop]: Abstraction has 848892 states and 1215699 transitions. [2019-09-10 07:22:30,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 07:22:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 848892 states and 1215699 transitions. [2019-09-10 07:22:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:22:30,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:30,560 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:22:30,560 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1287174569, now seen corresponding path program 1 times [2019-09-10 07:22:30,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:30,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:30,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:30,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:30,638 INFO L87 Difference]: Start difference. First operand 848892 states and 1215699 transitions. Second operand 3 states. [2019-09-10 07:22:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:45,250 INFO L93 Difference]: Finished difference Result 1320201 states and 1873946 transitions. [2019-09-10 07:22:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:45,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:22:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:47,016 INFO L225 Difference]: With dead ends: 1320201 [2019-09-10 07:22:47,016 INFO L226 Difference]: Without dead ends: 1320201 [2019-09-10 07:22:47,016 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 07:22:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320201 states. [2019-09-10 07:23:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320201 to 1286743. [2019-09-10 07:23:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286743 states. [2019-09-10 07:23:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286743 states to 1286743 states and 1829897 transitions. [2019-09-10 07:23:41,296 INFO L78 Accepts]: Start accepts. Automaton has 1286743 states and 1829897 transitions. Word has length 117 [2019-09-10 07:23:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:41,296 INFO L475 AbstractCegarLoop]: Abstraction has 1286743 states and 1829897 transitions. [2019-09-10 07:23:41,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1286743 states and 1829897 transitions. [2019-09-10 07:23:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:23:41,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:41,431 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:23:41,431 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1934399398, now seen corresponding path program 1 times [2019-09-10 07:23:41,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:41,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:41,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:41,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:41,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:41,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:41,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:41,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:41,502 INFO L87 Difference]: Start difference. First operand 1286743 states and 1829897 transitions. Second operand 3 states. [2019-09-10 07:23:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:58,370 INFO L93 Difference]: Finished difference Result 1947148 states and 2740519 transitions. [2019-09-10 07:23:58,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:58,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:23:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:00,798 INFO L225 Difference]: With dead ends: 1947148 [2019-09-10 07:24:00,798 INFO L226 Difference]: Without dead ends: 1947148 [2019-09-10 07:24:00,798 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 07:24:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947148 states. [2019-09-10 07:24:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947148 to 1885708. [2019-09-10 07:24:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885708 states.