java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:34:17,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:34:17,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:34:17,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:34:17,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:34:17,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:34:17,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:34:17,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:34:17,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:34:17,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:34:17,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:34:17,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:34:17,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:34:17,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:34:17,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:34:17,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:34:17,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:34:17,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:34:17,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:34:17,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:34:17,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:34:17,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:34:17,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:34:17,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:34:17,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:34:17,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:34:17,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:34:17,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:34:17,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:34:17,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:34:17,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:34:17,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:34:17,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:34:17,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:34:17,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:34:17,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:34:17,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:34:17,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:34:17,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:34:17,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:34:17,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:34:17,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 08:34:17,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:34:17,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:34:17,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:34:17,759 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:34:17,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:34:17,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:34:17,760 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:34:17,760 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:34:17,762 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:34:17,762 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:34:17,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:34:17,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:34:17,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:34:17,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:34:17,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:34:17,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:34:17,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:34:17,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:34:17,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:34:17,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:34:17,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:34:17,768 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:34:17,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:34:17,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:34:17,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:34:17,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:34:17,769 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:34:17,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:34:17,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:34:17,769 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:34:17,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:34:17,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:34:17,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:34:17,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:34:17,841 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:34:17,841 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:34:17,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a55a162e/dbefdf74989e447bafbd77d991a49419/FLAGf41f6c9f2 [2019-09-10 08:34:18,424 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:34:18,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:34:18,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a55a162e/dbefdf74989e447bafbd77d991a49419/FLAGf41f6c9f2 [2019-09-10 08:34:18,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a55a162e/dbefdf74989e447bafbd77d991a49419 [2019-09-10 08:34:18,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:34:18,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:34:18,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:34:18,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:34:18,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:34:18,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:34:18" (1/1) ... [2019-09-10 08:34:18,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c22f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:18, skipping insertion in model container [2019-09-10 08:34:18,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:34:18" (1/1) ... [2019-09-10 08:34:18,736 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:34:18,794 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:34:19,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:34:19,209 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:34:19,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:34:19,358 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:34:19,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19 WrapperNode [2019-09-10 08:34:19,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:34:19,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:34:19,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:34:19,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:34:19,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... [2019-09-10 08:34:19,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:34:19,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:34:19,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:34:19,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:34:19,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:34:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:34:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:34:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:34:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:34:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:34:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:34:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:34:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:34:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:34:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:34:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:34:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:34:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:34:20,304 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:34:20,305 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:34:20,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:34:20 BoogieIcfgContainer [2019-09-10 08:34:20,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:34:20,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:34:20,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:34:20,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:34:20,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:34:18" (1/3) ... [2019-09-10 08:34:20,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e90ce53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:34:20, skipping insertion in model container [2019-09-10 08:34:20,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:34:19" (2/3) ... [2019-09-10 08:34:20,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e90ce53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:34:20, skipping insertion in model container [2019-09-10 08:34:20,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:34:20" (3/3) ... [2019-09-10 08:34:20,319 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:34:20,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:34:20,342 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:34:20,358 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:34:20,385 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:34:20,385 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:34:20,386 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:34:20,386 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:34:20,386 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:34:20,387 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:34:20,387 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:34:20,387 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:34:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-09-10 08:34:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 08:34:20,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:20,424 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] [2019-09-10 08:34:20,427 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash 586489149, now seen corresponding path program 1 times [2019-09-10 08:34:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:20,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:20,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:20,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:20,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:20,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:20,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:20,894 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-09-10 08:34:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,020 INFO L93 Difference]: Finished difference Result 231 states and 381 transitions. [2019-09-10 08:34:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:21,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 08:34:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,046 INFO L225 Difference]: With dead ends: 231 [2019-09-10 08:34:21,047 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 08:34:21,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 08:34:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-10 08:34:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 08:34:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2019-09-10 08:34:21,123 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 60 [2019-09-10 08:34:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,123 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2019-09-10 08:34:21,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2019-09-10 08:34:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 08:34:21,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,131 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] [2019-09-10 08:34:21,132 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 960046910, now seen corresponding path program 1 times [2019-09-10 08:34:21,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:21,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:21,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:21,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:21,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:21,296 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2019-09-10 08:34:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,359 INFO L93 Difference]: Finished difference Result 371 states and 591 transitions. [2019-09-10 08:34:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:21,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 08:34:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,363 INFO L225 Difference]: With dead ends: 371 [2019-09-10 08:34:21,363 INFO L226 Difference]: Without dead ends: 371 [2019-09-10 08:34:21,364 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 08:34:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-10 08:34:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-10 08:34:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-10 08:34:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 590 transitions. [2019-09-10 08:34:21,400 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 590 transitions. Word has length 62 [2019-09-10 08:34:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,401 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 590 transitions. [2019-09-10 08:34:21,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 590 transitions. [2019-09-10 08:34:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 08:34:21,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,409 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] [2019-09-10 08:34:21,412 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash 319322495, now seen corresponding path program 1 times [2019-09-10 08:34:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:21,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:21,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:21,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:21,554 INFO L87 Difference]: Start difference. First operand 369 states and 590 transitions. Second operand 3 states. [2019-09-10 08:34:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,579 INFO L93 Difference]: Finished difference Result 651 states and 1047 transitions. [2019-09-10 08:34:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:21,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 08:34:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,584 INFO L225 Difference]: With dead ends: 651 [2019-09-10 08:34:21,584 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 08:34:21,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 08:34:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2019-09-10 08:34:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-10 08:34:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1046 transitions. [2019-09-10 08:34:21,612 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1046 transitions. Word has length 64 [2019-09-10 08:34:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,613 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1046 transitions. [2019-09-10 08:34:21,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1046 transitions. [2019-09-10 08:34:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:34:21,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,616 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] [2019-09-10 08:34:21,616 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash -694013056, now seen corresponding path program 1 times [2019-09-10 08:34:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:21,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:21,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:34:21,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:21,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:34:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:34:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:21,796 INFO L87 Difference]: Start difference. First operand 649 states and 1046 transitions. Second operand 5 states. [2019-09-10 08:34:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,981 INFO L93 Difference]: Finished difference Result 1893 states and 3092 transitions. [2019-09-10 08:34:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:34:21,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 08:34:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,995 INFO L225 Difference]: With dead ends: 1893 [2019-09-10 08:34:21,995 INFO L226 Difference]: Without dead ends: 1893 [2019-09-10 08:34:21,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:34:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-10 08:34:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1413. [2019-09-10 08:34:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-09-10 08:34:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2310 transitions. [2019-09-10 08:34:22,070 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2310 transitions. Word has length 66 [2019-09-10 08:34:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:22,071 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 2310 transitions. [2019-09-10 08:34:22,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:34:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2310 transitions. [2019-09-10 08:34:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 08:34:22,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:22,076 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] [2019-09-10 08:34:22,076 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash -101178732, now seen corresponding path program 1 times [2019-09-10 08:34:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:22,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:34:22,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:22,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:34:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:34:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:34:22,196 INFO L87 Difference]: Start difference. First operand 1413 states and 2310 transitions. Second operand 6 states. [2019-09-10 08:34:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:22,414 INFO L93 Difference]: Finished difference Result 4995 states and 8146 transitions. [2019-09-10 08:34:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:34:22,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 08:34:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:22,441 INFO L225 Difference]: With dead ends: 4995 [2019-09-10 08:34:22,441 INFO L226 Difference]: Without dead ends: 4995 [2019-09-10 08:34:22,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-09-10 08:34:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4888. [2019-09-10 08:34:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-09-10 08:34:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 7991 transitions. [2019-09-10 08:34:22,585 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 7991 transitions. Word has length 67 [2019-09-10 08:34:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:22,585 INFO L475 AbstractCegarLoop]: Abstraction has 4888 states and 7991 transitions. [2019-09-10 08:34:22,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:34:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 7991 transitions. [2019-09-10 08:34:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:34:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:22,588 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] [2019-09-10 08:34:22,589 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 497091130, now seen corresponding path program 1 times [2019-09-10 08:34:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:22,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:22,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:22,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:22,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:22,650 INFO L87 Difference]: Start difference. First operand 4888 states and 7991 transitions. Second operand 3 states. [2019-09-10 08:34:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:22,717 INFO L93 Difference]: Finished difference Result 7331 states and 11953 transitions. [2019-09-10 08:34:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:22,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:34:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:22,754 INFO L225 Difference]: With dead ends: 7331 [2019-09-10 08:34:22,755 INFO L226 Difference]: Without dead ends: 7331 [2019-09-10 08:34:22,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-09-10 08:34:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7329. [2019-09-10 08:34:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7329 states. [2019-09-10 08:34:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 11952 transitions. [2019-09-10 08:34:23,036 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 11952 transitions. Word has length 68 [2019-09-10 08:34:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:23,036 INFO L475 AbstractCegarLoop]: Abstraction has 7329 states and 11952 transitions. [2019-09-10 08:34:23,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 11952 transitions. [2019-09-10 08:34:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:34:23,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:23,040 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] [2019-09-10 08:34:23,040 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash -440955688, now seen corresponding path program 1 times [2019-09-10 08:34:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:23,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:23,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:23,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:23,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:23,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:23,162 INFO L87 Difference]: Start difference. First operand 7329 states and 11952 transitions. Second operand 3 states. [2019-09-10 08:34:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:23,252 INFO L93 Difference]: Finished difference Result 10449 states and 16948 transitions. [2019-09-10 08:34:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:23,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:34:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:23,318 INFO L225 Difference]: With dead ends: 10449 [2019-09-10 08:34:23,319 INFO L226 Difference]: Without dead ends: 10449 [2019-09-10 08:34:23,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10449 states. [2019-09-10 08:34:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10449 to 10447. [2019-09-10 08:34:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10447 states. [2019-09-10 08:34:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 16947 transitions. [2019-09-10 08:34:23,639 INFO L78 Accepts]: Start accepts. Automaton has 10447 states and 16947 transitions. Word has length 68 [2019-09-10 08:34:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:23,639 INFO L475 AbstractCegarLoop]: Abstraction has 10447 states and 16947 transitions. [2019-09-10 08:34:23,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10447 states and 16947 transitions. [2019-09-10 08:34:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:34:23,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:23,640 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] [2019-09-10 08:34:23,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1101374151, now seen corresponding path program 1 times [2019-09-10 08:34:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:23,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:23,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:23,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:34:23,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:23,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:34:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:34:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:34:23,753 INFO L87 Difference]: Start difference. First operand 10447 states and 16947 transitions. Second operand 4 states. [2019-09-10 08:34:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:23,894 INFO L93 Difference]: Finished difference Result 15089 states and 24432 transitions. [2019-09-10 08:34:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:34:23,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-10 08:34:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:23,930 INFO L225 Difference]: With dead ends: 15089 [2019-09-10 08:34:23,930 INFO L226 Difference]: Without dead ends: 15089 [2019-09-10 08:34:23,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:34:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2019-09-10 08:34:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 15045. [2019-09-10 08:34:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15045 states. [2019-09-10 08:34:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15045 states to 15045 states and 24350 transitions. [2019-09-10 08:34:24,740 INFO L78 Accepts]: Start accepts. Automaton has 15045 states and 24350 transitions. Word has length 68 [2019-09-10 08:34:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:24,740 INFO L475 AbstractCegarLoop]: Abstraction has 15045 states and 24350 transitions. [2019-09-10 08:34:24,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:34:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15045 states and 24350 transitions. [2019-09-10 08:34:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:34:24,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:24,741 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] [2019-09-10 08:34:24,742 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1261589494, now seen corresponding path program 1 times [2019-09-10 08:34:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:24,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:24,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:24,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:24,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:24,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:24,810 INFO L87 Difference]: Start difference. First operand 15045 states and 24350 transitions. Second operand 3 states. [2019-09-10 08:34:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:24,901 INFO L93 Difference]: Finished difference Result 20464 states and 32895 transitions. [2019-09-10 08:34:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:24,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:34:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:24,953 INFO L225 Difference]: With dead ends: 20464 [2019-09-10 08:34:24,954 INFO L226 Difference]: Without dead ends: 20464 [2019-09-10 08:34:24,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20464 states. [2019-09-10 08:34:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20464 to 20462. [2019-09-10 08:34:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-09-10 08:34:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 32894 transitions. [2019-09-10 08:34:25,399 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 32894 transitions. Word has length 68 [2019-09-10 08:34:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:25,399 INFO L475 AbstractCegarLoop]: Abstraction has 20462 states and 32894 transitions. [2019-09-10 08:34:25,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 32894 transitions. [2019-09-10 08:34:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 08:34:25,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:25,401 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] [2019-09-10 08:34:25,401 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -269634117, now seen corresponding path program 1 times [2019-09-10 08:34:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:25,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:34:25,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:25,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:34:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:34:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:34:25,507 INFO L87 Difference]: Start difference. First operand 20462 states and 32894 transitions. Second operand 4 states. [2019-09-10 08:34:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:25,727 INFO L93 Difference]: Finished difference Result 45670 states and 73369 transitions. [2019-09-10 08:34:25,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:34:25,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 08:34:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:25,845 INFO L225 Difference]: With dead ends: 45670 [2019-09-10 08:34:25,845 INFO L226 Difference]: Without dead ends: 45670 [2019-09-10 08:34:25,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:34:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45670 states. [2019-09-10 08:34:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45670 to 30643. [2019-09-10 08:34:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30643 states. [2019-09-10 08:34:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30643 states to 30643 states and 49101 transitions. [2019-09-10 08:34:26,661 INFO L78 Accepts]: Start accepts. Automaton has 30643 states and 49101 transitions. Word has length 69 [2019-09-10 08:34:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:26,662 INFO L475 AbstractCegarLoop]: Abstraction has 30643 states and 49101 transitions. [2019-09-10 08:34:26,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:34:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30643 states and 49101 transitions. [2019-09-10 08:34:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 08:34:26,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:26,663 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] [2019-09-10 08:34:26,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1384982603, now seen corresponding path program 1 times [2019-09-10 08:34:26,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:26,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:34:26,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:26,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:34:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:34:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:26,816 INFO L87 Difference]: Start difference. First operand 30643 states and 49101 transitions. Second operand 5 states. [2019-09-10 08:34:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:26,989 INFO L93 Difference]: Finished difference Result 30649 states and 48969 transitions. [2019-09-10 08:34:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:34:26,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 08:34:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:27,068 INFO L225 Difference]: With dead ends: 30649 [2019-09-10 08:34:27,068 INFO L226 Difference]: Without dead ends: 30649 [2019-09-10 08:34:27,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30649 states. [2019-09-10 08:34:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30649 to 30643. [2019-09-10 08:34:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30643 states. [2019-09-10 08:34:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30643 states to 30643 states and 48966 transitions. [2019-09-10 08:34:28,255 INFO L78 Accepts]: Start accepts. Automaton has 30643 states and 48966 transitions. Word has length 71 [2019-09-10 08:34:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 30643 states and 48966 transitions. [2019-09-10 08:34:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:34:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30643 states and 48966 transitions. [2019-09-10 08:34:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:34:28,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:28,257 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] [2019-09-10 08:34:28,257 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash 511361176, now seen corresponding path program 1 times [2019-09-10 08:34:28,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:28,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:28,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:28,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:34:28,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:28,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:34:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:34:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:28,450 INFO L87 Difference]: Start difference. First operand 30643 states and 48966 transitions. Second operand 5 states. [2019-09-10 08:34:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:28,713 INFO L93 Difference]: Finished difference Result 69315 states and 110775 transitions. [2019-09-10 08:34:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:34:28,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 08:34:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:28,821 INFO L225 Difference]: With dead ends: 69315 [2019-09-10 08:34:28,821 INFO L226 Difference]: Without dead ends: 69315 [2019-09-10 08:34:28,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69315 states. [2019-09-10 08:34:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69315 to 43971. [2019-09-10 08:34:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43971 states. [2019-09-10 08:34:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43971 states to 43971 states and 70017 transitions. [2019-09-10 08:34:30,895 INFO L78 Accepts]: Start accepts. Automaton has 43971 states and 70017 transitions. Word has length 74 [2019-09-10 08:34:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:30,896 INFO L475 AbstractCegarLoop]: Abstraction has 43971 states and 70017 transitions. [2019-09-10 08:34:30,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:34:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 43971 states and 70017 transitions. [2019-09-10 08:34:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:34:30,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:30,897 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] [2019-09-10 08:34:30,897 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1329582040, now seen corresponding path program 1 times [2019-09-10 08:34:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:30,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:34:31,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:34:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:34:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:31,003 INFO L87 Difference]: Start difference. First operand 43971 states and 70017 transitions. Second operand 5 states. [2019-09-10 08:34:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:31,213 INFO L93 Difference]: Finished difference Result 77782 states and 122673 transitions. [2019-09-10 08:34:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:34:31,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 08:34:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:31,334 INFO L225 Difference]: With dead ends: 77782 [2019-09-10 08:34:31,335 INFO L226 Difference]: Without dead ends: 77782 [2019-09-10 08:34:31,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:34:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77782 states. [2019-09-10 08:34:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77782 to 44987. [2019-09-10 08:34:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44987 states. [2019-09-10 08:34:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44987 states to 44987 states and 71024 transitions. [2019-09-10 08:34:32,109 INFO L78 Accepts]: Start accepts. Automaton has 44987 states and 71024 transitions. Word has length 75 [2019-09-10 08:34:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:32,109 INFO L475 AbstractCegarLoop]: Abstraction has 44987 states and 71024 transitions. [2019-09-10 08:34:32,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:34:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44987 states and 71024 transitions. [2019-09-10 08:34:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:34:32,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:32,112 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:32,113 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 933476449, now seen corresponding path program 1 times [2019-09-10 08:34:32,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:32,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:32,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:32,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:32,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:32,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:32,192 INFO L87 Difference]: Start difference. First operand 44987 states and 71024 transitions. Second operand 3 states. [2019-09-10 08:34:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:32,292 INFO L93 Difference]: Finished difference Result 37112 states and 58355 transitions. [2019-09-10 08:34:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:34:32,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 08:34:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:32,332 INFO L225 Difference]: With dead ends: 37112 [2019-09-10 08:34:32,332 INFO L226 Difference]: Without dead ends: 37112 [2019-09-10 08:34:32,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37112 states. [2019-09-10 08:34:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37112 to 37049. [2019-09-10 08:34:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37049 states. [2019-09-10 08:34:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37049 states to 37049 states and 58270 transitions. [2019-09-10 08:34:32,634 INFO L78 Accepts]: Start accepts. Automaton has 37049 states and 58270 transitions. Word has length 99 [2019-09-10 08:34:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:32,634 INFO L475 AbstractCegarLoop]: Abstraction has 37049 states and 58270 transitions. [2019-09-10 08:34:32,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:34:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37049 states and 58270 transitions. [2019-09-10 08:34:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:34:32,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:32,636 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:32,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -4570369, now seen corresponding path program 1 times [2019-09-10 08:34:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:32,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:34:32,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:32,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:34:32,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:32,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:34:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:34:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:32,745 INFO L87 Difference]: Start difference. First operand 37049 states and 58270 transitions. Second operand 5 states. [2019-09-10 08:34:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:33,070 INFO L93 Difference]: Finished difference Result 42027 states and 66025 transitions. [2019-09-10 08:34:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:34:33,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 08:34:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:33,134 INFO L225 Difference]: With dead ends: 42027 [2019-09-10 08:34:33,134 INFO L226 Difference]: Without dead ends: 42027 [2019-09-10 08:34:33,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:34:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42027 states. [2019-09-10 08:34:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42027 to 42021. [2019-09-10 08:34:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42021 states. [2019-09-10 08:34:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42021 states to 42021 states and 66022 transitions. [2019-09-10 08:34:33,692 INFO L78 Accepts]: Start accepts. Automaton has 42021 states and 66022 transitions. Word has length 99 [2019-09-10 08:34:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:33,693 INFO L475 AbstractCegarLoop]: Abstraction has 42021 states and 66022 transitions. [2019-09-10 08:34:33,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:34:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 42021 states and 66022 transitions. [2019-09-10 08:34:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:34:33,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:33,695 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:33,696 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1524668658, now seen corresponding path program 1 times [2019-09-10 08:34:33,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:33,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:33,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:33,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:34:33,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 08:34:33,846 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [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], [109], [112], [127], [130], [133], [135], [137], [140], [155], [163], [165], [193], [196], [199], [202], [205], [212], [220], [222], [225], [226], [228], [237], [240], [251], [254], [264], [278], [281], [312], [322], [332], [338], [342], [346], [348], [351], [382], [392], [402], [412], [416], [418], [421], [452], [462], [472], [581], [582], [586], [587], [588] [2019-09-10 08:34:33,915 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:34:33,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:34:34,196 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:34:34,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:34:34,651 INFO L272 AbstractInterpreter]: Visited 87 different actions 345 times. Merged at 41 different actions 234 times. Widened at 17 different actions 31 times. Performed 1123 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 5 different actions. Largest state had 174 variables. [2019-09-10 08:34:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:34,657 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:34:34,997 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 86.46% of their original sizes. [2019-09-10 08:34:34,997 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:34:38,915 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 08:34:38,915 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:34:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:34:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [5] total 64 [2019-09-10 08:34:38,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:38,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 08:34:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 08:34:38,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3257, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:34:38,920 INFO L87 Difference]: Start difference. First operand 42021 states and 66022 transitions. Second operand 61 states. [2019-09-10 08:35:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:38,217 INFO L93 Difference]: Finished difference Result 172120 states and 267067 transitions. [2019-09-10 08:35:38,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2019-09-10 08:35:38,218 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 100 [2019-09-10 08:35:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:38,835 INFO L225 Difference]: With dead ends: 172120 [2019-09-10 08:35:38,835 INFO L226 Difference]: Without dead ends: 172120 [2019-09-10 08:35:38,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21694 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=7428, Invalid=47562, Unknown=0, NotChecked=0, Total=54990 [2019-09-10 08:35:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172120 states. [2019-09-10 08:35:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172120 to 59001. [2019-09-10 08:35:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-09-10 08:35:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 92232 transitions. [2019-09-10 08:35:40,932 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 92232 transitions. Word has length 100 [2019-09-10 08:35:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:40,932 INFO L475 AbstractCegarLoop]: Abstraction has 59001 states and 92232 transitions. [2019-09-10 08:35:40,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 08:35:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 92232 transitions. [2019-09-10 08:35:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:35:40,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:40,936 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:40,936 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash 276151769, now seen corresponding path program 1 times [2019-09-10 08:35:40,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:40,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:41,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:41,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:35:41,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:41,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:35:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:35:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:41,010 INFO L87 Difference]: Start difference. First operand 59001 states and 92232 transitions. Second operand 3 states. [2019-09-10 08:35:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:41,340 INFO L93 Difference]: Finished difference Result 114228 states and 177004 transitions. [2019-09-10 08:35:41,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:41,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 08:35:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:41,657 INFO L225 Difference]: With dead ends: 114228 [2019-09-10 08:35:41,657 INFO L226 Difference]: Without dead ends: 114228 [2019-09-10 08:35:41,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114228 states. [2019-09-10 08:35:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114228 to 114226. [2019-09-10 08:35:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114226 states. [2019-09-10 08:35:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114226 states to 114226 states and 177003 transitions. [2019-09-10 08:35:44,746 INFO L78 Accepts]: Start accepts. Automaton has 114226 states and 177003 transitions. Word has length 101 [2019-09-10 08:35:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:44,746 INFO L475 AbstractCegarLoop]: Abstraction has 114226 states and 177003 transitions. [2019-09-10 08:35:44,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:35:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 114226 states and 177003 transitions. [2019-09-10 08:35:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:35:44,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:44,751 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:35:44,751 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1464467175, now seen corresponding path program 1 times [2019-09-10 08:35:44,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:35:44,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:35:44,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:44,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:35:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:35:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:35:44,945 INFO L87 Difference]: Start difference. First operand 114226 states and 177003 transitions. Second operand 4 states. [2019-09-10 08:35:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:45,592 INFO L93 Difference]: Finished difference Result 198870 states and 308511 transitions. [2019-09-10 08:35:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:35:45,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-10 08:35:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:46,125 INFO L225 Difference]: With dead ends: 198870 [2019-09-10 08:35:46,125 INFO L226 Difference]: Without dead ends: 198870 [2019-09-10 08:35:46,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:35:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198870 states. [2019-09-10 08:35:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198870 to 173892. [2019-09-10 08:35:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173892 states. [2019-09-10 08:35:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173892 states to 173892 states and 269861 transitions. [2019-09-10 08:35:50,886 INFO L78 Accepts]: Start accepts. Automaton has 173892 states and 269861 transitions. Word has length 101 [2019-09-10 08:35:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:50,886 INFO L475 AbstractCegarLoop]: Abstraction has 173892 states and 269861 transitions. [2019-09-10 08:35:50,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:35:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 173892 states and 269861 transitions. [2019-09-10 08:35:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:35:50,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:50,890 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:50,890 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash -515913713, now seen corresponding path program 1 times [2019-09-10 08:35:50,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:35:50,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:50,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:35:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:35:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:50,957 INFO L87 Difference]: Start difference. First operand 173892 states and 269861 transitions. Second operand 3 states. [2019-09-10 08:35:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:52,048 INFO L93 Difference]: Finished difference Result 337729 states and 519748 transitions. [2019-09-10 08:35:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:52,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 08:35:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:52,673 INFO L225 Difference]: With dead ends: 337729 [2019-09-10 08:35:52,673 INFO L226 Difference]: Without dead ends: 337729 [2019-09-10 08:35:52,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337729 states. [2019-09-10 08:35:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337729 to 337727. [2019-09-10 08:35:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337727 states. [2019-09-10 08:36:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337727 states to 337727 states and 519747 transitions. [2019-09-10 08:36:00,225 INFO L78 Accepts]: Start accepts. Automaton has 337727 states and 519747 transitions. Word has length 101 [2019-09-10 08:36:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:00,226 INFO L475 AbstractCegarLoop]: Abstraction has 337727 states and 519747 transitions. [2019-09-10 08:36:00,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 337727 states and 519747 transitions. [2019-09-10 08:36:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:36:00,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:00,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:00,230 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -634650113, now seen corresponding path program 1 times [2019-09-10 08:36:00,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:00,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:00,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:00,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:00,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:36:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:00,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:00,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:00,293 INFO L87 Difference]: Start difference. First operand 337727 states and 519747 transitions. Second operand 3 states. [2019-09-10 08:36:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:02,539 INFO L93 Difference]: Finished difference Result 476916 states and 732868 transitions. [2019-09-10 08:36:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:02,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:36:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:03,372 INFO L225 Difference]: With dead ends: 476916 [2019-09-10 08:36:03,372 INFO L226 Difference]: Without dead ends: 476916 [2019-09-10 08:36:03,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476916 states. [2019-09-10 08:36:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476916 to 340426. [2019-09-10 08:36:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340426 states. [2019-09-10 08:36:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340426 states to 340426 states and 523717 transitions. [2019-09-10 08:36:14,213 INFO L78 Accepts]: Start accepts. Automaton has 340426 states and 523717 transitions. Word has length 102 [2019-09-10 08:36:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:14,213 INFO L475 AbstractCegarLoop]: Abstraction has 340426 states and 523717 transitions. [2019-09-10 08:36:14,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 340426 states and 523717 transitions. [2019-09-10 08:36:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:36:14,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:14,217 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] [2019-09-10 08:36:14,217 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1302743281, now seen corresponding path program 1 times [2019-09-10 08:36:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:14,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:14,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:36:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:14,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:14,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:14,286 INFO L87 Difference]: Start difference. First operand 340426 states and 523717 transitions. Second operand 3 states. [2019-09-10 08:36:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:15,367 INFO L93 Difference]: Finished difference Result 490588 states and 755575 transitions. [2019-09-10 08:36:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:15,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:36:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:17,718 INFO L225 Difference]: With dead ends: 490588 [2019-09-10 08:36:17,718 INFO L226 Difference]: Without dead ends: 490588 [2019-09-10 08:36:17,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490588 states. [2019-09-10 08:36:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490588 to 474526. [2019-09-10 08:36:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474526 states. [2019-09-10 08:36:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474526 states to 474526 states and 726490 transitions. [2019-09-10 08:36:36,660 INFO L78 Accepts]: Start accepts. Automaton has 474526 states and 726490 transitions. Word has length 102 [2019-09-10 08:36:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:36,660 INFO L475 AbstractCegarLoop]: Abstraction has 474526 states and 726490 transitions. [2019-09-10 08:36:36,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 474526 states and 726490 transitions. [2019-09-10 08:36:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:36:36,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:36,663 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:36,663 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1868792098, now seen corresponding path program 1 times [2019-09-10 08:36:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:36,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:36,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:36:36,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:36,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:36,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:36,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:36,722 INFO L87 Difference]: Start difference. First operand 474526 states and 726490 transitions. Second operand 3 states. [2019-09-10 08:36:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:39,115 INFO L93 Difference]: Finished difference Result 720298 states and 1100654 transitions. [2019-09-10 08:36:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:39,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 08:36:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:40,200 INFO L225 Difference]: With dead ends: 720298 [2019-09-10 08:36:40,201 INFO L226 Difference]: Without dead ends: 720298 [2019-09-10 08:36:40,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720298 states. [2019-09-10 08:36:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720298 to 717644. [2019-09-10 08:36:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717644 states. [2019-09-10 08:37:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717644 states to 717644 states and 1098001 transitions. [2019-09-10 08:37:11,470 INFO L78 Accepts]: Start accepts. Automaton has 717644 states and 1098001 transitions. Word has length 102 [2019-09-10 08:37:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:11,470 INFO L475 AbstractCegarLoop]: Abstraction has 717644 states and 1098001 transitions. [2019-09-10 08:37:11,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 717644 states and 1098001 transitions. [2019-09-10 08:37:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:37:11,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:11,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:11,474 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 597613679, now seen corresponding path program 1 times [2019-09-10 08:37:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:11,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:37:11,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:37:11,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:37:11,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 08:37:11,632 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [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], [109], [112], [127], [135], [137], [140], [155], [158], [161], [163], [165], [193], [196], [199], [202], [205], [212], [220], [222], [225], [226], [228], [237], [240], [251], [254], [260], [278], [281], [312], [322], [332], [342], [346], [348], [351], [382], [392], [402], [408], [412], [416], [418], [421], [452], [462], [472], [581], [582], [586], [587], [588] [2019-09-10 08:37:11,642 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:37:11,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:37:11,696 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:37:11,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:37:11,869 INFO L272 AbstractInterpreter]: Visited 87 different actions 338 times. Merged at 41 different actions 228 times. Widened at 18 different actions 25 times. Performed 1066 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1066 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 5 different actions. Largest state had 174 variables. [2019-09-10 08:37:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:11,870 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:37:12,069 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 85.95% of their original sizes. [2019-09-10 08:37:12,069 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:37:16,425 INFO L420 sIntCurrentIteration]: We unified 101 AI predicates to 101 [2019-09-10 08:37:16,425 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:37:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:37:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [6] total 67 [2019-09-10 08:37:16,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:16,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:37:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:37:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:37:16,428 INFO L87 Difference]: Start difference. First operand 717644 states and 1098001 transitions. Second operand 63 states. [2019-09-10 08:38:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:33,055 INFO L93 Difference]: Finished difference Result 1916083 states and 2915577 transitions. [2019-09-10 08:38:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-09-10 08:38:33,055 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 102 [2019-09-10 08:38:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:38,669 INFO L225 Difference]: With dead ends: 1916083 [2019-09-10 08:38:38,669 INFO L226 Difference]: Without dead ends: 1916083 [2019-09-10 08:38:38,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22818 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=7979, Invalid=52783, Unknown=0, NotChecked=0, Total=60762 [2019-09-10 08:38:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916083 states. [2019-09-10 08:39:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916083 to 839210. [2019-09-10 08:39:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839210 states. [2019-09-10 08:39:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839210 states to 839210 states and 1281125 transitions. [2019-09-10 08:39:28,487 INFO L78 Accepts]: Start accepts. Automaton has 839210 states and 1281125 transitions. Word has length 102 [2019-09-10 08:39:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:28,488 INFO L475 AbstractCegarLoop]: Abstraction has 839210 states and 1281125 transitions. [2019-09-10 08:39:28,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:39:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 839210 states and 1281125 transitions. [2019-09-10 08:39:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:39:28,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:28,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:28,491 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -708297945, now seen corresponding path program 1 times [2019-09-10 08:39:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:28,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:28,552 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 08:39:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:28,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:28,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:28,554 INFO L87 Difference]: Start difference. First operand 839210 states and 1281125 transitions. Second operand 3 states. [2019-09-10 08:39:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:45,800 INFO L93 Difference]: Finished difference Result 1629205 states and 2463569 transitions. [2019-09-10 08:39:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:45,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 08:39:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:48,531 INFO L225 Difference]: With dead ends: 1629205 [2019-09-10 08:39:48,532 INFO L226 Difference]: Without dead ends: 1629205 [2019-09-10 08:39:48,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629205 states. [2019-09-10 08:40:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629205 to 1509567. [2019-09-10 08:40:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509567 states.