java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:04:19,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:04:19,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:04:19,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:04:19,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:04:19,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:04:19,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:04:19,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:04:19,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:04:19,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:04:19,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:04:19,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:04:19,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:04:19,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:04:19,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:04:19,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:04:19,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:04:19,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:04:19,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:04:19,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:04:19,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:04:19,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:04:19,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:04:19,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:04:19,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:04:19,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:04:19,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:04:19,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:04:19,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:04:19,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:04:19,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:04:19,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:04:19,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:04:19,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:04:19,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:04:19,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:04:19,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:04:19,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:04:19,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:04:19,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:04:19,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:04:19,605 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:04:19,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:04:19,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:04:19,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:04:19,625 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:04:19,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:04:19,626 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:04:19,626 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:04:19,626 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:04:19,627 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:04:19,627 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:04:19,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:04:19,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:04:19,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:04:19,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:04:19,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:04:19,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:04:19,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:04:19,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:04:19,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:04:19,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:04:19,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:04:19,631 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:04:19,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:04:19,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:04:19,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:04:19,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:04:19,634 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:04:19,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:04:19,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:04:19,634 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:04:19,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:04:19,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:04:19,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:04:19,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:04:19,710 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:04:19,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 08:04:19,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814322ba9/9b04604f499b4331b23673e22b409a9f/FLAG57e115227 [2019-09-10 08:04:20,488 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:04:20,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 08:04:20,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814322ba9/9b04604f499b4331b23673e22b409a9f/FLAG57e115227 [2019-09-10 08:04:20,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814322ba9/9b04604f499b4331b23673e22b409a9f [2019-09-10 08:04:20,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:04:20,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:04:20,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:04:20,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:04:20,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:04:20,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:04:20" (1/1) ... [2019-09-10 08:04:20,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f251cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:20, skipping insertion in model container [2019-09-10 08:04:20,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:04:20" (1/1) ... [2019-09-10 08:04:20,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:04:20,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:04:21,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:04:21,961 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:04:22,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:04:22,516 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:04:22,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22 WrapperNode [2019-09-10 08:04:22,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:04:22,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:04:22,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:04:22,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:04:22,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (1/1) ... [2019-09-10 08:04:22,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:04:22,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:04:22,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:04:22,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:04:22,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (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:04:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:04:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:04:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:04:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:04:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:04:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:04:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:04:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:04:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:04:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:04:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:04:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:04:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:04:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:04:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:04:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:04:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:04:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:04:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:04:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:04:26,510 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:04:26,511 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:04:26,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:04:26 BoogieIcfgContainer [2019-09-10 08:04:26,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:04:26,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:04:26,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:04:26,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:04:26,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:04:20" (1/3) ... [2019-09-10 08:04:26,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea0ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:04:26, skipping insertion in model container [2019-09-10 08:04:26,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:04:22" (2/3) ... [2019-09-10 08:04:26,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea0ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:04:26, skipping insertion in model container [2019-09-10 08:04:26,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:04:26" (3/3) ... [2019-09-10 08:04:26,520 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 08:04:26,530 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:04:26,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 08:04:26,559 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 08:04:26,588 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:04:26,588 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:04:26,588 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:04:26,588 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:04:26,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:04:26,588 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:04:26,589 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:04:26,589 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:04:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states. [2019-09-10 08:04:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:04:26,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:26,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:26,664 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1025872216, now seen corresponding path program 1 times [2019-09-10 08:04:26,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:27,442 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:04:27,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:27,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:27,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:27,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:27,468 INFO L87 Difference]: Start difference. First operand 1198 states. Second operand 5 states. [2019-09-10 08:04:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:29,077 INFO L93 Difference]: Finished difference Result 961 states and 1609 transitions. [2019-09-10 08:04:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:29,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:04:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:29,113 INFO L225 Difference]: With dead ends: 961 [2019-09-10 08:04:29,113 INFO L226 Difference]: Without dead ends: 949 [2019-09-10 08:04:29,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-10 08:04:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2019-09-10 08:04:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-09-10 08:04:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1205 transitions. [2019-09-10 08:04:29,213 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1205 transitions. Word has length 77 [2019-09-10 08:04:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:29,214 INFO L475 AbstractCegarLoop]: Abstraction has 949 states and 1205 transitions. [2019-09-10 08:04:29,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1205 transitions. [2019-09-10 08:04:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:04:29,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:29,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:29,220 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -991361587, now seen corresponding path program 1 times [2019-09-10 08:04:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:29,389 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:04:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:29,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:29,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:29,393 INFO L87 Difference]: Start difference. First operand 949 states and 1205 transitions. Second operand 5 states. [2019-09-10 08:04:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:30,177 INFO L93 Difference]: Finished difference Result 621 states and 784 transitions. [2019-09-10 08:04:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:30,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:04:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:30,183 INFO L225 Difference]: With dead ends: 621 [2019-09-10 08:04:30,183 INFO L226 Difference]: Without dead ends: 621 [2019-09-10 08:04:30,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-10 08:04:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-10 08:04:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-10 08:04:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 784 transitions. [2019-09-10 08:04:30,204 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 784 transitions. Word has length 77 [2019-09-10 08:04:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:30,204 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 784 transitions. [2019-09-10 08:04:30,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 784 transitions. [2019-09-10 08:04:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:04:30,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:30,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:30,209 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2088333632, now seen corresponding path program 1 times [2019-09-10 08:04:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:30,435 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:04:30,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:30,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:30,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:30,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:30,440 INFO L87 Difference]: Start difference. First operand 621 states and 784 transitions. Second operand 5 states. [2019-09-10 08:04:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:30,945 INFO L93 Difference]: Finished difference Result 520 states and 660 transitions. [2019-09-10 08:04:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:30,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:04:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:30,949 INFO L225 Difference]: With dead ends: 520 [2019-09-10 08:04:30,949 INFO L226 Difference]: Without dead ends: 520 [2019-09-10 08:04:30,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-10 08:04:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-10 08:04:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-10 08:04:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 660 transitions. [2019-09-10 08:04:30,962 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 660 transitions. Word has length 77 [2019-09-10 08:04:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:30,963 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 660 transitions. [2019-09-10 08:04:30,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 660 transitions. [2019-09-10 08:04:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:04:30,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:30,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:30,967 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2006758657, now seen corresponding path program 1 times [2019-09-10 08:04:30,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:30,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:30,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:30,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:31,109 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:04:31,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:31,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:31,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:31,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:31,112 INFO L87 Difference]: Start difference. First operand 520 states and 660 transitions. Second operand 5 states. [2019-09-10 08:04:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:31,875 INFO L93 Difference]: Finished difference Result 504 states and 641 transitions. [2019-09-10 08:04:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:31,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 08:04:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:31,879 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:04:31,879 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:04:31,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:04:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-10 08:04:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-10 08:04:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 641 transitions. [2019-09-10 08:04:31,893 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 641 transitions. Word has length 79 [2019-09-10 08:04:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:31,894 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 641 transitions. [2019-09-10 08:04:31,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 641 transitions. [2019-09-10 08:04:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:04:31,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:31,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:31,897 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 748510916, now seen corresponding path program 1 times [2019-09-10 08:04:31,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:31,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:32,097 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:04:32,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:32,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:04:32,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:32,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:04:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:04:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:04:32,100 INFO L87 Difference]: Start difference. First operand 504 states and 641 transitions. Second operand 5 states. [2019-09-10 08:04:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:32,491 INFO L93 Difference]: Finished difference Result 427 states and 541 transitions. [2019-09-10 08:04:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:04:32,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:04:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:32,494 INFO L225 Difference]: With dead ends: 427 [2019-09-10 08:04:32,494 INFO L226 Difference]: Without dead ends: 427 [2019-09-10 08:04:32,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:04:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-10 08:04:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-10 08:04:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 541 transitions. [2019-09-10 08:04:32,505 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 541 transitions. Word has length 81 [2019-09-10 08:04:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:32,505 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 541 transitions. [2019-09-10 08:04:32,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:04:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 541 transitions. [2019-09-10 08:04:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:32,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:32,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:32,508 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash -763074199, now seen corresponding path program 1 times [2019-09-10 08:04:32,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:32,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:32,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:04:32,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:32,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:04:32,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:04:32,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:04:32,747 INFO L87 Difference]: Start difference. First operand 427 states and 541 transitions. Second operand 8 states. [2019-09-10 08:04:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:33,682 INFO L93 Difference]: Finished difference Result 596 states and 732 transitions. [2019-09-10 08:04:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:04:33,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 08:04:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:33,693 INFO L225 Difference]: With dead ends: 596 [2019-09-10 08:04:33,693 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 08:04:33,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:04:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 08:04:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 427. [2019-09-10 08:04:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 540 transitions. [2019-09-10 08:04:33,712 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 540 transitions. Word has length 83 [2019-09-10 08:04:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:33,713 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 540 transitions. [2019-09-10 08:04:33,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:04:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 540 transitions. [2019-09-10 08:04:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:33,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:33,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:33,725 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash 847032169, now seen corresponding path program 1 times [2019-09-10 08:04:33,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:33,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:33,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:33,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:33,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:34,178 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:04:34,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:34,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:34,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:34,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:34,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:34,232 INFO L87 Difference]: Start difference. First operand 427 states and 540 transitions. Second operand 9 states. [2019-09-10 08:04:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:36,097 INFO L93 Difference]: Finished difference Result 791 states and 1031 transitions. [2019-09-10 08:04:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:36,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:36,104 INFO L225 Difference]: With dead ends: 791 [2019-09-10 08:04:36,104 INFO L226 Difference]: Without dead ends: 791 [2019-09-10 08:04:36,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-10 08:04:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 427. [2019-09-10 08:04:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 539 transitions. [2019-09-10 08:04:36,118 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 539 transitions. Word has length 83 [2019-09-10 08:04:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:36,118 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 539 transitions. [2019-09-10 08:04:36,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 539 transitions. [2019-09-10 08:04:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:36,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:36,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:36,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:36,121 INFO L82 PathProgramCache]: Analyzing trace with hash 560401961, now seen corresponding path program 1 times [2019-09-10 08:04:36,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:36,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:36,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:36,317 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:04:36,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:36,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:36,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:36,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:36,319 INFO L87 Difference]: Start difference. First operand 427 states and 539 transitions. Second operand 9 states. [2019-09-10 08:04:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:38,104 INFO L93 Difference]: Finished difference Result 787 states and 1026 transitions. [2019-09-10 08:04:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:38,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:38,109 INFO L225 Difference]: With dead ends: 787 [2019-09-10 08:04:38,109 INFO L226 Difference]: Without dead ends: 787 [2019-09-10 08:04:38,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-10 08:04:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-10 08:04:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 538 transitions. [2019-09-10 08:04:38,122 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 538 transitions. Word has length 83 [2019-09-10 08:04:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:38,122 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 538 transitions. [2019-09-10 08:04:38,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 538 transitions. [2019-09-10 08:04:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:04:38,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:38,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:38,125 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1854316557, now seen corresponding path program 1 times [2019-09-10 08:04:38,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:38,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:38,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:38,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:38,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:38,355 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:04:38,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:38,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:38,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:38,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:38,357 INFO L87 Difference]: Start difference. First operand 427 states and 538 transitions. Second operand 9 states. [2019-09-10 08:04:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:40,056 INFO L93 Difference]: Finished difference Result 779 states and 1008 transitions. [2019-09-10 08:04:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:40,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:04:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:40,062 INFO L225 Difference]: With dead ends: 779 [2019-09-10 08:04:40,062 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 08:04:40,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 08:04:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-10 08:04:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 537 transitions. [2019-09-10 08:04:40,075 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 537 transitions. Word has length 84 [2019-09-10 08:04:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:40,075 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 537 transitions. [2019-09-10 08:04:40,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 537 transitions. [2019-09-10 08:04:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:40,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:40,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:40,077 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash -15576114, now seen corresponding path program 1 times [2019-09-10 08:04:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:40,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:40,298 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:04:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:40,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:40,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:40,300 INFO L87 Difference]: Start difference. First operand 427 states and 537 transitions. Second operand 9 states. [2019-09-10 08:04:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:42,036 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2019-09-10 08:04:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:42,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:42,043 INFO L225 Difference]: With dead ends: 787 [2019-09-10 08:04:42,043 INFO L226 Difference]: Without dead ends: 787 [2019-09-10 08:04:42,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-10 08:04:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-10 08:04:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 536 transitions. [2019-09-10 08:04:42,058 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 536 transitions. Word has length 85 [2019-09-10 08:04:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:42,058 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 536 transitions. [2019-09-10 08:04:42,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 536 transitions. [2019-09-10 08:04:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:42,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:42,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:42,061 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1212918770, now seen corresponding path program 1 times [2019-09-10 08:04:42,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:42,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:42,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:42,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:42,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:42,274 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:04:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:42,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:42,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:42,275 INFO L87 Difference]: Start difference. First operand 427 states and 536 transitions. Second operand 9 states. [2019-09-10 08:04:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:43,822 INFO L93 Difference]: Finished difference Result 779 states and 1006 transitions. [2019-09-10 08:04:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:43,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:43,828 INFO L225 Difference]: With dead ends: 779 [2019-09-10 08:04:43,828 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 08:04:43,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 08:04:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-10 08:04:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 535 transitions. [2019-09-10 08:04:43,840 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 535 transitions. Word has length 85 [2019-09-10 08:04:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:43,840 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 535 transitions. [2019-09-10 08:04:43,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 535 transitions. [2019-09-10 08:04:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:43,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:43,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:43,842 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1860056526, now seen corresponding path program 1 times [2019-09-10 08:04:43,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:43,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:43,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:43,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:43,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:44,061 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:04:44,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:44,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:44,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:44,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:44,063 INFO L87 Difference]: Start difference. First operand 427 states and 535 transitions. Second operand 9 states. [2019-09-10 08:04:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:45,786 INFO L93 Difference]: Finished difference Result 791 states and 1023 transitions. [2019-09-10 08:04:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:45,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:45,791 INFO L225 Difference]: With dead ends: 791 [2019-09-10 08:04:45,791 INFO L226 Difference]: Without dead ends: 791 [2019-09-10 08:04:45,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-10 08:04:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 427. [2019-09-10 08:04:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 534 transitions. [2019-09-10 08:04:45,803 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 534 transitions. Word has length 85 [2019-09-10 08:04:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:45,803 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 534 transitions. [2019-09-10 08:04:45,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 534 transitions. [2019-09-10 08:04:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:45,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:45,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:45,805 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash 920806414, now seen corresponding path program 1 times [2019-09-10 08:04:45,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:45,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:45,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:45,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:45,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:45,987 INFO L87 Difference]: Start difference. First operand 427 states and 534 transitions. Second operand 9 states. [2019-09-10 08:04:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:47,782 INFO L93 Difference]: Finished difference Result 787 states and 1020 transitions. [2019-09-10 08:04:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:47,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:47,786 INFO L225 Difference]: With dead ends: 787 [2019-09-10 08:04:47,787 INFO L226 Difference]: Without dead ends: 787 [2019-09-10 08:04:47,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-10 08:04:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-10 08:04:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 533 transitions. [2019-09-10 08:04:47,798 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 533 transitions. Word has length 85 [2019-09-10 08:04:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:47,798 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 533 transitions. [2019-09-10 08:04:47,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 533 transitions. [2019-09-10 08:04:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:47,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:47,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:47,800 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1035004846, now seen corresponding path program 1 times [2019-09-10 08:04:47,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:47,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:47,979 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:04:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:47,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:47,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:47,981 INFO L87 Difference]: Start difference. First operand 427 states and 533 transitions. Second operand 9 states. [2019-09-10 08:04:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:49,499 INFO L93 Difference]: Finished difference Result 779 states and 1003 transitions. [2019-09-10 08:04:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:49,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:49,503 INFO L225 Difference]: With dead ends: 779 [2019-09-10 08:04:49,503 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 08:04:49,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 08:04:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-10 08:04:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:04:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 532 transitions. [2019-09-10 08:04:49,517 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 532 transitions. Word has length 85 [2019-09-10 08:04:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:49,517 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 532 transitions. [2019-09-10 08:04:49,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 532 transitions. [2019-09-10 08:04:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:49,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:49,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:49,520 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1147266175, now seen corresponding path program 1 times [2019-09-10 08:04:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:49,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:49,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:49,789 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:04:49,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:49,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:49,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:49,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:49,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:49,791 INFO L87 Difference]: Start difference. First operand 427 states and 532 transitions. Second operand 9 states. [2019-09-10 08:04:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:51,244 INFO L93 Difference]: Finished difference Result 762 states and 973 transitions. [2019-09-10 08:04:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:51,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:51,249 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:04:51,250 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:04:51,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:04:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:04:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:04:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 530 transitions. [2019-09-10 08:04:51,260 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 530 transitions. Word has length 85 [2019-09-10 08:04:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:51,261 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 530 transitions. [2019-09-10 08:04:51,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 530 transitions. [2019-09-10 08:04:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:51,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:51,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:51,263 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash -207377138, now seen corresponding path program 1 times [2019-09-10 08:04:51,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:51,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:51,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:51,465 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:04:51,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:51,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:51,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:51,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:51,467 INFO L87 Difference]: Start difference. First operand 426 states and 530 transitions. Second operand 9 states. [2019-09-10 08:04:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:52,968 INFO L93 Difference]: Finished difference Result 778 states and 999 transitions. [2019-09-10 08:04:52,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:52,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:52,974 INFO L225 Difference]: With dead ends: 778 [2019-09-10 08:04:52,974 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 08:04:52,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 08:04:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-10 08:04:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:04:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 529 transitions. [2019-09-10 08:04:52,985 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 529 transitions. Word has length 85 [2019-09-10 08:04:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:52,985 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 529 transitions. [2019-09-10 08:04:52,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 529 transitions. [2019-09-10 08:04:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:04:52,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:52,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:52,988 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -669368786, now seen corresponding path program 1 times [2019-09-10 08:04:52,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:52,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:52,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:52,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:53,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:53,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:53,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:53,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:53,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:53,216 INFO L87 Difference]: Start difference. First operand 426 states and 529 transitions. Second operand 9 states. [2019-09-10 08:04:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:54,918 INFO L93 Difference]: Finished difference Result 762 states and 971 transitions. [2019-09-10 08:04:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:54,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:04:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:54,923 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:04:54,924 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:04:54,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:04:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:04:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:04:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2019-09-10 08:04:54,939 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2019-09-10 08:04:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:54,939 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2019-09-10 08:04:54,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2019-09-10 08:04:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:04:54,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:54,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:54,941 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1385395406, now seen corresponding path program 1 times [2019-09-10 08:04:54,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:54,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:54,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:54,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:54,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:55,172 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:04:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:55,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:55,175 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand 9 states. [2019-09-10 08:04:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:56,790 INFO L93 Difference]: Finished difference Result 762 states and 970 transitions. [2019-09-10 08:04:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:56,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:04:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:56,794 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:04:56,794 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:04:56,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:04:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:04:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:04:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 527 transitions. [2019-09-10 08:04:56,803 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 527 transitions. Word has length 86 [2019-09-10 08:04:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:56,804 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 527 transitions. [2019-09-10 08:04:56,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 527 transitions. [2019-09-10 08:04:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:04:56,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:56,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:56,806 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 858512238, now seen corresponding path program 1 times [2019-09-10 08:04:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:56,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:57,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:04:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:57,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:57,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:57,003 INFO L87 Difference]: Start difference. First operand 426 states and 527 transitions. Second operand 9 states. [2019-09-10 08:04:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:58,921 INFO L93 Difference]: Finished difference Result 762 states and 968 transitions. [2019-09-10 08:04:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:58,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:04:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:58,926 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:04:58,926 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:04:58,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:04:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:04:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:04:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2019-09-10 08:04:58,935 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 86 [2019-09-10 08:04:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:58,935 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2019-09-10 08:04:58,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2019-09-10 08:04:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:04:58,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:58,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:58,937 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1124465518, now seen corresponding path program 1 times [2019-09-10 08:04:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:58,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:59,119 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:04:59,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:59,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:59,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:59,121 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand 9 states. [2019-09-10 08:05:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:00,867 INFO L93 Difference]: Finished difference Result 762 states and 967 transitions. [2019-09-10 08:05:00,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:00,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:05:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:00,872 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:00,872 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:00,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 525 transitions. [2019-09-10 08:05:00,881 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 525 transitions. Word has length 86 [2019-09-10 08:05:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:00,882 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 525 transitions. [2019-09-10 08:05:00,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 525 transitions. [2019-09-10 08:05:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:00,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:00,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:00,884 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1332810989, now seen corresponding path program 1 times [2019-09-10 08:05:00,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:00,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:00,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:00,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:01,058 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:05:01,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:01,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:01,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:01,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:01,060 INFO L87 Difference]: Start difference. First operand 426 states and 525 transitions. Second operand 9 states. [2019-09-10 08:05:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:02,757 INFO L93 Difference]: Finished difference Result 762 states and 966 transitions. [2019-09-10 08:05:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:02,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:02,762 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:02,762 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:02,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 524 transitions. [2019-09-10 08:05:02,771 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 524 transitions. Word has length 87 [2019-09-10 08:05:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:02,772 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 524 transitions. [2019-09-10 08:05:02,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 524 transitions. [2019-09-10 08:05:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:02,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:02,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:02,774 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash 478571315, now seen corresponding path program 1 times [2019-09-10 08:05:02,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:02,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:02,957 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:05:02,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:02,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:02,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:02,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:02,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:02,958 INFO L87 Difference]: Start difference. First operand 426 states and 524 transitions. Second operand 9 states. [2019-09-10 08:05:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:04,433 INFO L93 Difference]: Finished difference Result 778 states and 992 transitions. [2019-09-10 08:05:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:04,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:04,439 INFO L225 Difference]: With dead ends: 778 [2019-09-10 08:05:04,439 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 08:05:04,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 08:05:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-10 08:05:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 523 transitions. [2019-09-10 08:05:04,449 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 523 transitions. Word has length 87 [2019-09-10 08:05:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:04,450 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 523 transitions. [2019-09-10 08:05:04,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 523 transitions. [2019-09-10 08:05:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:04,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:04,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:04,452 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2101826515, now seen corresponding path program 1 times [2019-09-10 08:05:04,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:04,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:04,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:04,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:04,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:04,668 INFO L87 Difference]: Start difference. First operand 426 states and 523 transitions. Second operand 9 states. [2019-09-10 08:05:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:06,609 INFO L93 Difference]: Finished difference Result 786 states and 1004 transitions. [2019-09-10 08:05:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:06,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:06,613 INFO L225 Difference]: With dead ends: 786 [2019-09-10 08:05:06,613 INFO L226 Difference]: Without dead ends: 786 [2019-09-10 08:05:06,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-10 08:05:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 426. [2019-09-10 08:05:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 522 transitions. [2019-09-10 08:05:06,621 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 522 transitions. Word has length 87 [2019-09-10 08:05:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:06,621 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 522 transitions. [2019-09-10 08:05:06,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 522 transitions. [2019-09-10 08:05:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:06,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:06,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:06,623 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 244970323, now seen corresponding path program 1 times [2019-09-10 08:05:06,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:06,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:06,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:06,795 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:05:06,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:06,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:06,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:06,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:06,800 INFO L87 Difference]: Start difference. First operand 426 states and 522 transitions. Second operand 9 states. [2019-09-10 08:05:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:08,497 INFO L93 Difference]: Finished difference Result 778 states and 989 transitions. [2019-09-10 08:05:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:08,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:08,502 INFO L225 Difference]: With dead ends: 778 [2019-09-10 08:05:08,502 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 08:05:08,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 08:05:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-10 08:05:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 521 transitions. [2019-09-10 08:05:08,512 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 521 transitions. Word has length 87 [2019-09-10 08:05:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:08,512 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 521 transitions. [2019-09-10 08:05:08,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 521 transitions. [2019-09-10 08:05:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:08,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:08,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:08,514 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1093485491, now seen corresponding path program 1 times [2019-09-10 08:05:08,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:08,701 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:05:08,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:08,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:08,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:08,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:08,703 INFO L87 Difference]: Start difference. First operand 426 states and 521 transitions. Second operand 9 states. [2019-09-10 08:05:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:10,405 INFO L93 Difference]: Finished difference Result 762 states and 962 transitions. [2019-09-10 08:05:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:10,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:10,409 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:10,410 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:10,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 520 transitions. [2019-09-10 08:05:10,419 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 520 transitions. Word has length 87 [2019-09-10 08:05:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:10,419 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 520 transitions. [2019-09-10 08:05:10,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 520 transitions. [2019-09-10 08:05:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:10,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:10,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:10,421 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1482555949, now seen corresponding path program 1 times [2019-09-10 08:05:10,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:10,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:10,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:10,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:10,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:10,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:10,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:10,617 INFO L87 Difference]: Start difference. First operand 426 states and 520 transitions. Second operand 9 states. [2019-09-10 08:05:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:12,393 INFO L93 Difference]: Finished difference Result 762 states and 960 transitions. [2019-09-10 08:05:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:12,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:12,397 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:12,397 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:12,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 519 transitions. [2019-09-10 08:05:12,405 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 519 transitions. Word has length 87 [2019-09-10 08:05:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:12,405 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 519 transitions. [2019-09-10 08:05:12,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 519 transitions. [2019-09-10 08:05:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:12,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:12,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:12,407 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1339772467, now seen corresponding path program 1 times [2019-09-10 08:05:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:12,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:12,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:12,594 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:05:12,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:12,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:12,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:12,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:12,595 INFO L87 Difference]: Start difference. First operand 426 states and 519 transitions. Second operand 9 states. [2019-09-10 08:05:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:14,287 INFO L93 Difference]: Finished difference Result 762 states and 959 transitions. [2019-09-10 08:05:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:14,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:14,291 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:14,292 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:14,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 518 transitions. [2019-09-10 08:05:14,298 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 518 transitions. Word has length 87 [2019-09-10 08:05:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:14,298 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 518 transitions. [2019-09-10 08:05:14,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 518 transitions. [2019-09-10 08:05:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:14,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:14,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:14,301 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2086137837, now seen corresponding path program 1 times [2019-09-10 08:05:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:14,544 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:05:14,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:14,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:14,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:14,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:14,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:14,545 INFO L87 Difference]: Start difference. First operand 426 states and 518 transitions. Second operand 9 states. [2019-09-10 08:05:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:16,094 INFO L93 Difference]: Finished difference Result 778 states and 982 transitions. [2019-09-10 08:05:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:16,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:16,098 INFO L225 Difference]: With dead ends: 778 [2019-09-10 08:05:16,098 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 08:05:16,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 08:05:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-10 08:05:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 517 transitions. [2019-09-10 08:05:16,106 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 517 transitions. Word has length 87 [2019-09-10 08:05:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:16,106 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 517 transitions. [2019-09-10 08:05:16,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 517 transitions. [2019-09-10 08:05:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:16,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:16,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:16,108 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 923787283, now seen corresponding path program 1 times [2019-09-10 08:05:16,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:16,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:16,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:16,297 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:05:16,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:16,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:16,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:16,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:16,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:16,299 INFO L87 Difference]: Start difference. First operand 426 states and 517 transitions. Second operand 9 states. [2019-09-10 08:05:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:18,058 INFO L93 Difference]: Finished difference Result 762 states and 956 transitions. [2019-09-10 08:05:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:18,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:18,063 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:18,063 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:18,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2019-09-10 08:05:18,072 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 87 [2019-09-10 08:05:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:18,072 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2019-09-10 08:05:18,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2019-09-10 08:05:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:18,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:18,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:18,074 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:18,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1851798797, now seen corresponding path program 1 times [2019-09-10 08:05:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:18,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:18,257 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:05:18,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:18,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:18,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:18,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:18,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:18,259 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 9 states. [2019-09-10 08:05:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:20,113 INFO L93 Difference]: Finished difference Result 762 states and 954 transitions. [2019-09-10 08:05:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:20,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:05:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:20,117 INFO L225 Difference]: With dead ends: 762 [2019-09-10 08:05:20,118 INFO L226 Difference]: Without dead ends: 762 [2019-09-10 08:05:20,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-10 08:05:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-10 08:05:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 515 transitions. [2019-09-10 08:05:20,125 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 515 transitions. Word has length 87 [2019-09-10 08:05:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:20,125 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 515 transitions. [2019-09-10 08:05:20,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 515 transitions. [2019-09-10 08:05:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:20,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:20,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:20,127 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2120002391, now seen corresponding path program 1 times [2019-09-10 08:05:20,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:20,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:20,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:20,858 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-09-10 08:05:21,025 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:05:21,183 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:05:21,862 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:05:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:05:21,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:21,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:05:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:05:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:21,866 INFO L87 Difference]: Start difference. First operand 426 states and 515 transitions. Second operand 21 states. [2019-09-10 08:05:23,020 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:05:23,322 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-10 08:05:23,521 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:05:23,716 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:05:23,960 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:05:26,081 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:05:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:28,271 INFO L93 Difference]: Finished difference Result 983 states and 1235 transitions. [2019-09-10 08:05:28,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:05:28,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2019-09-10 08:05:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:28,275 INFO L225 Difference]: With dead ends: 983 [2019-09-10 08:05:28,275 INFO L226 Difference]: Without dead ends: 983 [2019-09-10 08:05:28,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:05:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-10 08:05:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 447. [2019-09-10 08:05:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 08:05:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 542 transitions. [2019-09-10 08:05:28,286 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 542 transitions. Word has length 88 [2019-09-10 08:05:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:28,287 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 542 transitions. [2019-09-10 08:05:28,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:05:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 542 transitions. [2019-09-10 08:05:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:28,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:28,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:28,289 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 81782089, now seen corresponding path program 1 times [2019-09-10 08:05:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:29,128 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:05:29,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:29,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:05:29,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:29,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:05:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:05:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:29,130 INFO L87 Difference]: Start difference. First operand 447 states and 542 transitions. Second operand 17 states. [2019-09-10 08:05:29,786 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:05:29,957 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:05:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:31,772 INFO L93 Difference]: Finished difference Result 824 states and 1036 transitions. [2019-09-10 08:05:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:05:31,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-10 08:05:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:31,776 INFO L225 Difference]: With dead ends: 824 [2019-09-10 08:05:31,776 INFO L226 Difference]: Without dead ends: 824 [2019-09-10 08:05:31,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:05:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-10 08:05:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 420. [2019-09-10 08:05:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-10 08:05:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 508 transitions. [2019-09-10 08:05:31,786 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 508 transitions. Word has length 88 [2019-09-10 08:05:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:31,786 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 508 transitions. [2019-09-10 08:05:31,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:05:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 508 transitions. [2019-09-10 08:05:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:31,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:31,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:31,788 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 384754761, now seen corresponding path program 1 times [2019-09-10 08:05:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:31,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:31,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:32,887 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:05:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:05:32,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:32,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:05:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:05:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:05:32,889 INFO L87 Difference]: Start difference. First operand 420 states and 508 transitions. Second operand 20 states. [2019-09-10 08:05:33,865 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:05:34,109 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 08:05:34,291 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:05:34,458 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:05:34,620 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:05:34,765 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:05:34,937 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:05:35,129 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:05:37,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:37,315 INFO L93 Difference]: Finished difference Result 772 states and 944 transitions. [2019-09-10 08:05:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:05:37,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2019-09-10 08:05:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:37,319 INFO L225 Difference]: With dead ends: 772 [2019-09-10 08:05:37,320 INFO L226 Difference]: Without dead ends: 772 [2019-09-10 08:05:37,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:05:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-10 08:05:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 427. [2019-09-10 08:05:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-10 08:05:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 515 transitions. [2019-09-10 08:05:37,333 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 515 transitions. Word has length 88 [2019-09-10 08:05:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:37,334 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 515 transitions. [2019-09-10 08:05:37,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:05:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 515 transitions. [2019-09-10 08:05:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:37,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:37,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:37,336 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash -566170359, now seen corresponding path program 1 times [2019-09-10 08:05:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:37,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:37,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:37,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:37,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:38,746 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:05:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:05:38,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:38,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:05:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:05:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:05:38,747 INFO L87 Difference]: Start difference. First operand 427 states and 515 transitions. Second operand 22 states. [2019-09-10 08:05:39,852 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:05:40,125 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:05:40,520 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 08:05:40,695 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:05:40,920 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:05:41,129 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:05:41,275 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:05:41,469 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:05:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:44,267 INFO L93 Difference]: Finished difference Result 760 states and 937 transitions. [2019-09-10 08:05:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:05:44,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-10 08:05:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:44,271 INFO L225 Difference]: With dead ends: 760 [2019-09-10 08:05:44,272 INFO L226 Difference]: Without dead ends: 760 [2019-09-10 08:05:44,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:05:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-10 08:05:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 434. [2019-09-10 08:05:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 08:05:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 522 transitions. [2019-09-10 08:05:44,280 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 522 transitions. Word has length 88 [2019-09-10 08:05:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:44,280 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 522 transitions. [2019-09-10 08:05:44,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:05:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 522 transitions. [2019-09-10 08:05:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:44,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:44,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:44,282 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1156320813, now seen corresponding path program 1 times [2019-09-10 08:05:44,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:45,109 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:05:45,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:45,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:05:45,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:45,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:05:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:05:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:45,111 INFO L87 Difference]: Start difference. First operand 434 states and 522 transitions. Second operand 17 states. [2019-09-10 08:05:45,890 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:05:46,071 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:05:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:48,373 INFO L93 Difference]: Finished difference Result 802 states and 1001 transitions. [2019-09-10 08:05:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:05:48,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-10 08:05:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:48,378 INFO L225 Difference]: With dead ends: 802 [2019-09-10 08:05:48,378 INFO L226 Difference]: Without dead ends: 802 [2019-09-10 08:05:48,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:05:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-10 08:05:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 434. [2019-09-10 08:05:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 08:05:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 520 transitions. [2019-09-10 08:05:48,386 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 520 transitions. Word has length 88 [2019-09-10 08:05:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:48,386 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 520 transitions. [2019-09-10 08:05:48,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:05:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 520 transitions. [2019-09-10 08:05:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:48,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:48,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:48,388 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1020462135, now seen corresponding path program 1 times [2019-09-10 08:05:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:48,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:49,715 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:05:49,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:49,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:05:49,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:49,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:05:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:05:49,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:05:49,716 INFO L87 Difference]: Start difference. First operand 434 states and 520 transitions. Second operand 22 states. [2019-09-10 08:05:50,738 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:05:51,021 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:05:51,328 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:05:51,513 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:05:51,707 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:05:51,896 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:05:52,055 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:05:52,234 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:05:52,489 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:05:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:54,582 INFO L93 Difference]: Finished difference Result 757 states and 930 transitions. [2019-09-10 08:05:54,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:05:54,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-10 08:05:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:54,588 INFO L225 Difference]: With dead ends: 757 [2019-09-10 08:05:54,588 INFO L226 Difference]: Without dead ends: 757 [2019-09-10 08:05:54,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:05:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-10 08:05:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 441. [2019-09-10 08:05:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-10 08:05:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 527 transitions. [2019-09-10 08:05:54,597 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 527 transitions. Word has length 88 [2019-09-10 08:05:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:54,597 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 527 transitions. [2019-09-10 08:05:54,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:05:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 527 transitions. [2019-09-10 08:05:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:05:54,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:54,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:54,599 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1790204216, now seen corresponding path program 1 times [2019-09-10 08:05:54,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,476 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:05:56,643 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:05:56,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:56,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:05:56,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:56,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:05:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:05:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:05:56,645 INFO L87 Difference]: Start difference. First operand 441 states and 527 transitions. Second operand 26 states. [2019-09-10 08:05:56,818 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:05:57,506 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-09-10 08:05:57,652 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-09-10 08:05:57,954 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:58,228 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 08:05:58,548 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-09-10 08:05:58,984 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-09-10 08:05:59,242 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:05:59,488 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:05:59,759 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:06:03,060 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:04,231 INFO L93 Difference]: Finished difference Result 779 states and 929 transitions. [2019-09-10 08:06:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:06:04,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-09-10 08:06:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:04,235 INFO L225 Difference]: With dead ends: 779 [2019-09-10 08:06:04,235 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 08:06:04,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:06:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 08:06:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 452. [2019-09-10 08:06:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-10 08:06:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 543 transitions. [2019-09-10 08:06:04,244 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 543 transitions. Word has length 89 [2019-09-10 08:06:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:04,244 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 543 transitions. [2019-09-10 08:06:04,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:06:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 543 transitions. [2019-09-10 08:06:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:04,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:04,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:04,246 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -363234600, now seen corresponding path program 1 times [2019-09-10 08:06:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:04,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:05,016 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:06:05,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:05,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:06:05,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:05,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:06:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:06:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:06:05,018 INFO L87 Difference]: Start difference. First operand 452 states and 543 transitions. Second operand 17 states. [2019-09-10 08:06:05,733 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:06:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:07,621 INFO L93 Difference]: Finished difference Result 765 states and 957 transitions. [2019-09-10 08:06:07,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:06:07,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-10 08:06:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:07,623 INFO L225 Difference]: With dead ends: 765 [2019-09-10 08:06:07,623 INFO L226 Difference]: Without dead ends: 765 [2019-09-10 08:06:07,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:06:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-10 08:06:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 431. [2019-09-10 08:06:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-10 08:06:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 514 transitions. [2019-09-10 08:06:07,631 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 514 transitions. Word has length 89 [2019-09-10 08:06:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:07,631 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 514 transitions. [2019-09-10 08:06:07,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:06:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 514 transitions. [2019-09-10 08:06:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:07,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:07,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:07,632 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash -138543399, now seen corresponding path program 1 times [2019-09-10 08:06:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:07,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:08,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:08,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:06:08,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:08,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:06:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:06:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:06:08,085 INFO L87 Difference]: Start difference. First operand 431 states and 514 transitions. Second operand 11 states. [2019-09-10 08:06:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:08,934 INFO L93 Difference]: Finished difference Result 668 states and 824 transitions. [2019-09-10 08:06:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:08,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 08:06:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:08,936 INFO L225 Difference]: With dead ends: 668 [2019-09-10 08:06:08,936 INFO L226 Difference]: Without dead ends: 668 [2019-09-10 08:06:08,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-09-10 08:06:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 419. [2019-09-10 08:06:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-10 08:06:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 500 transitions. [2019-09-10 08:06:08,943 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 500 transitions. Word has length 89 [2019-09-10 08:06:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:08,944 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 500 transitions. [2019-09-10 08:06:08,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:06:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 500 transitions. [2019-09-10 08:06:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:08,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:08,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:08,947 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -303870206, now seen corresponding path program 1 times [2019-09-10 08:06:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:08,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:09,341 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:06:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:06:09,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:09,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:06:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:06:09,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:06:09,346 INFO L87 Difference]: Start difference. First operand 419 states and 500 transitions. Second operand 11 states. [2019-09-10 08:06:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:10,401 INFO L93 Difference]: Finished difference Result 1054 states and 1387 transitions. [2019-09-10 08:06:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:10,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 08:06:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:10,404 INFO L225 Difference]: With dead ends: 1054 [2019-09-10 08:06:10,404 INFO L226 Difference]: Without dead ends: 1054 [2019-09-10 08:06:10,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:06:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-09-10 08:06:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 407. [2019-09-10 08:06:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-10 08:06:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 485 transitions. [2019-09-10 08:06:10,413 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 485 transitions. Word has length 89 [2019-09-10 08:06:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:10,413 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 485 transitions. [2019-09-10 08:06:10,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:06:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 485 transitions. [2019-09-10 08:06:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:10,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:10,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:10,414 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -957518029, now seen corresponding path program 1 times [2019-09-10 08:06:10,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:10,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:10,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:10,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:10,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:10,975 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:06:10,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:10,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:06:10,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:10,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:06:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:06:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:10,977 INFO L87 Difference]: Start difference. First operand 407 states and 485 transitions. Second operand 14 states. [2019-09-10 08:06:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:12,885 INFO L93 Difference]: Finished difference Result 703 states and 851 transitions. [2019-09-10 08:06:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:06:12,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-10 08:06:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:12,888 INFO L225 Difference]: With dead ends: 703 [2019-09-10 08:06:12,889 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 08:06:12,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:06:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 08:06:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 399. [2019-09-10 08:06:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-10 08:06:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 474 transitions. [2019-09-10 08:06:12,896 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 474 transitions. Word has length 89 [2019-09-10 08:06:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:12,896 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 474 transitions. [2019-09-10 08:06:12,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:06:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 474 transitions. [2019-09-10 08:06:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:12,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:12,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:12,898 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1065628564, now seen corresponding path program 1 times [2019-09-10 08:06:12,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:12,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:12,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:13,481 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:06:13,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:13,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:06:13,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:13,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:06:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:06:13,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:13,483 INFO L87 Difference]: Start difference. First operand 399 states and 474 transitions. Second operand 14 states. [2019-09-10 08:06:14,172 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:06:14,319 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:06:14,468 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:06:14,610 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:06:14,766 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:06:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:15,948 INFO L93 Difference]: Finished difference Result 629 states and 746 transitions. [2019-09-10 08:06:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:15,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-10 08:06:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:15,951 INFO L225 Difference]: With dead ends: 629 [2019-09-10 08:06:15,951 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 08:06:15,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 08:06:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2019-09-10 08:06:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-10 08:06:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 467 transitions. [2019-09-10 08:06:15,959 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 467 transitions. Word has length 89 [2019-09-10 08:06:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:15,959 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 467 transitions. [2019-09-10 08:06:15,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:06:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 467 transitions. [2019-09-10 08:06:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:15,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:15,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:15,961 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 841334007, now seen corresponding path program 1 times [2019-09-10 08:06:15,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:15,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:15,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:15,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:16,510 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:06:16,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:16,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:16,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:16,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:16,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:16,512 INFO L87 Difference]: Start difference. First operand 393 states and 467 transitions. Second operand 12 states. [2019-09-10 08:06:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:17,283 INFO L93 Difference]: Finished difference Result 798 states and 1031 transitions. [2019-09-10 08:06:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:17,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 08:06:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:17,285 INFO L225 Difference]: With dead ends: 798 [2019-09-10 08:06:17,285 INFO L226 Difference]: Without dead ends: 798 [2019-09-10 08:06:17,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:06:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-10 08:06:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 338. [2019-09-10 08:06:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-10 08:06:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 404 transitions. [2019-09-10 08:06:17,292 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 404 transitions. Word has length 89 [2019-09-10 08:06:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:17,292 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 404 transitions. [2019-09-10 08:06:17,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 404 transitions. [2019-09-10 08:06:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:17,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:17,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:17,293 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2096385733, now seen corresponding path program 1 times [2019-09-10 08:06:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:17,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:17,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:17,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:17,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:17,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:17,999 INFO L87 Difference]: Start difference. First operand 338 states and 404 transitions. Second operand 16 states. [2019-09-10 08:06:19,016 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:06:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:20,620 INFO L93 Difference]: Finished difference Result 1069 states and 1399 transitions. [2019-09-10 08:06:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:06:20,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-10 08:06:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:20,623 INFO L225 Difference]: With dead ends: 1069 [2019-09-10 08:06:20,624 INFO L226 Difference]: Without dead ends: 1069 [2019-09-10 08:06:20,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:06:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-09-10 08:06:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 310. [2019-09-10 08:06:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 08:06:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 369 transitions. [2019-09-10 08:06:20,631 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 369 transitions. Word has length 89 [2019-09-10 08:06:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:20,631 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 369 transitions. [2019-09-10 08:06:20,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:06:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 369 transitions. [2019-09-10 08:06:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:06:20,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:20,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:20,632 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2061266405, now seen corresponding path program 1 times [2019-09-10 08:06:20,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:20,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:20,979 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:06:20,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:20,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:06:20,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:20,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:06:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:06:20,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:06:20,981 INFO L87 Difference]: Start difference. First operand 310 states and 369 transitions. Second operand 11 states. [2019-09-10 08:06:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:22,052 INFO L93 Difference]: Finished difference Result 906 states and 1210 transitions. [2019-09-10 08:06:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:22,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-10 08:06:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:22,055 INFO L225 Difference]: With dead ends: 906 [2019-09-10 08:06:22,055 INFO L226 Difference]: Without dead ends: 906 [2019-09-10 08:06:22,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:06:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-10 08:06:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 270. [2019-09-10 08:06:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-10 08:06:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 319 transitions. [2019-09-10 08:06:22,063 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 319 transitions. Word has length 90 [2019-09-10 08:06:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:22,063 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 319 transitions. [2019-09-10 08:06:22,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:06:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 319 transitions. [2019-09-10 08:06:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:06:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:22,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:22,065 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1853534946, now seen corresponding path program 1 times [2019-09-10 08:06:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:22,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:22,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:22,525 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:06:22,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:22,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:22,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:22,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:22,526 INFO L87 Difference]: Start difference. First operand 270 states and 319 transitions. Second operand 12 states. [2019-09-10 08:06:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:23,835 INFO L93 Difference]: Finished difference Result 690 states and 902 transitions. [2019-09-10 08:06:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:23,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 08:06:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:23,837 INFO L225 Difference]: With dead ends: 690 [2019-09-10 08:06:23,837 INFO L226 Difference]: Without dead ends: 690 [2019-09-10 08:06:23,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:06:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-10 08:06:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 246. [2019-09-10 08:06:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-10 08:06:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 292 transitions. [2019-09-10 08:06:23,843 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 292 transitions. Word has length 90 [2019-09-10 08:06:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:23,843 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 292 transitions. [2019-09-10 08:06:23,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 292 transitions. [2019-09-10 08:06:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:06:23,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:23,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:23,844 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1759645528, now seen corresponding path program 1 times [2019-09-10 08:06:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:23,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:23,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:24,625 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:06:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:24,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:24,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:24,626 INFO L87 Difference]: Start difference. First operand 246 states and 292 transitions. Second operand 16 states. [2019-09-10 08:06:25,329 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:06:25,468 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:06:25,605 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:06:25,737 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 08:06:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:26,669 INFO L93 Difference]: Finished difference Result 460 states and 547 transitions. [2019-09-10 08:06:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:06:26,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-10 08:06:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:26,671 INFO L225 Difference]: With dead ends: 460 [2019-09-10 08:06:26,671 INFO L226 Difference]: Without dead ends: 460 [2019-09-10 08:06:26,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:06:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-10 08:06:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 271. [2019-09-10 08:06:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-10 08:06:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 322 transitions. [2019-09-10 08:06:26,675 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 322 transitions. Word has length 90 [2019-09-10 08:06:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:26,675 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 322 transitions. [2019-09-10 08:06:26,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:06:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 322 transitions. [2019-09-10 08:06:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:06:26,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:26,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:26,676 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -576618081, now seen corresponding path program 1 times [2019-09-10 08:06:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:26,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:27,381 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:06:27,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:27,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:06:27,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:27,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:06:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:06:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:27,383 INFO L87 Difference]: Start difference. First operand 271 states and 322 transitions. Second operand 15 states. [2019-09-10 08:06:28,059 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:06:28,202 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:06:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:28,982 INFO L93 Difference]: Finished difference Result 513 states and 656 transitions. [2019-09-10 08:06:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:28,982 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-10 08:06:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:28,984 INFO L225 Difference]: With dead ends: 513 [2019-09-10 08:06:28,984 INFO L226 Difference]: Without dead ends: 513 [2019-09-10 08:06:28,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-10 08:06:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 265. [2019-09-10 08:06:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-10 08:06:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 315 transitions. [2019-09-10 08:06:28,990 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 315 transitions. Word has length 90 [2019-09-10 08:06:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:28,990 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 315 transitions. [2019-09-10 08:06:28,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:06:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 315 transitions. [2019-09-10 08:06:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:06:28,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:28,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:28,992 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:28,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1327171516, now seen corresponding path program 1 times [2019-09-10 08:06:28,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:28,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:28,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:28,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:29,497 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:06:29,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:29,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:29,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:29,498 INFO L87 Difference]: Start difference. First operand 265 states and 315 transitions. Second operand 12 states. [2019-09-10 08:06:30,055 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-10 08:06:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:30,612 INFO L93 Difference]: Finished difference Result 408 states and 491 transitions. [2019-09-10 08:06:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:30,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 08:06:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:30,614 INFO L225 Difference]: With dead ends: 408 [2019-09-10 08:06:30,614 INFO L226 Difference]: Without dead ends: 408 [2019-09-10 08:06:30,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:06:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-10 08:06:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 261. [2019-09-10 08:06:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 08:06:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 310 transitions. [2019-09-10 08:06:30,620 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 310 transitions. Word has length 90 [2019-09-10 08:06:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:30,620 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 310 transitions. [2019-09-10 08:06:30,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 310 transitions. [2019-09-10 08:06:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:06:30,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:30,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:30,621 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash -863961032, now seen corresponding path program 1 times [2019-09-10 08:06:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:30,784 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:06:30,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:30,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:30,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:30,785 INFO L87 Difference]: Start difference. First operand 261 states and 310 transitions. Second operand 9 states. [2019-09-10 08:06:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:31,568 INFO L93 Difference]: Finished difference Result 379 states and 462 transitions. [2019-09-10 08:06:31,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:31,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 08:06:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:31,570 INFO L225 Difference]: With dead ends: 379 [2019-09-10 08:06:31,571 INFO L226 Difference]: Without dead ends: 379 [2019-09-10 08:06:31,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:06:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-10 08:06:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 261. [2019-09-10 08:06:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 08:06:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2019-09-10 08:06:31,575 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 91 [2019-09-10 08:06:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:31,575 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2019-09-10 08:06:31,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2019-09-10 08:06:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:06:31,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:31,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:31,576 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2010479467, now seen corresponding path program 1 times [2019-09-10 08:06:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:31,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:32,245 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:06:32,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:32,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:06:32,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:32,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:06:32,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:06:32,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:06:32,246 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand 13 states. [2019-09-10 08:06:32,811 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 08:06:32,973 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 08:06:33,205 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-09-10 08:06:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:33,888 INFO L93 Difference]: Finished difference Result 642 states and 845 transitions. [2019-09-10 08:06:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:06:33,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-10 08:06:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:33,891 INFO L225 Difference]: With dead ends: 642 [2019-09-10 08:06:33,891 INFO L226 Difference]: Without dead ends: 642 [2019-09-10 08:06:33,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:06:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-10 08:06:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 205. [2019-09-10 08:06:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 08:06:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2019-09-10 08:06:33,896 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 91 [2019-09-10 08:06:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:33,897 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2019-09-10 08:06:33,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:06:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2019-09-10 08:06:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:06:33,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:33,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:33,898 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash -767603588, now seen corresponding path program 1 times [2019-09-10 08:06:33,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:33,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:34,058 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:06:34,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:34,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:34,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:34,060 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand 9 states. [2019-09-10 08:06:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:35,040 INFO L93 Difference]: Finished difference Result 309 states and 380 transitions. [2019-09-10 08:06:35,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:06:35,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 08:06:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:35,042 INFO L225 Difference]: With dead ends: 309 [2019-09-10 08:06:35,042 INFO L226 Difference]: Without dead ends: 309 [2019-09-10 08:06:35,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:06:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-10 08:06:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 205. [2019-09-10 08:06:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 08:06:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2019-09-10 08:06:35,047 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 92 [2019-09-10 08:06:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2019-09-10 08:06:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2019-09-10 08:06:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:06:35,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:35,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:35,048 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1562795773, now seen corresponding path program 1 times [2019-09-10 08:06:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:35,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:35,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:35,800 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:06:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:35,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:35,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:35,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:35,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:35,802 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand 16 states. [2019-09-10 08:06:36,547 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:06:36,698 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:06:36,845 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:06:36,984 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:06:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:38,049 INFO L93 Difference]: Finished difference Result 632 states and 830 transitions. [2019-09-10 08:06:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:06:38,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2019-09-10 08:06:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:38,051 INFO L225 Difference]: With dead ends: 632 [2019-09-10 08:06:38,051 INFO L226 Difference]: Without dead ends: 632 [2019-09-10 08:06:38,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:06:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-10 08:06:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 233. [2019-09-10 08:06:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-10 08:06:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2019-09-10 08:06:38,057 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 93 [2019-09-10 08:06:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:38,057 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2019-09-10 08:06:38,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:06:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2019-09-10 08:06:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:06:38,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:38,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:38,058 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -333235878, now seen corresponding path program 1 times [2019-09-10 08:06:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:38,550 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:06:38,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:38,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:38,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:38,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:38,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:38,551 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2019-09-10 08:06:39,048 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:06:39,187 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:06:39,374 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-10 08:06:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:40,027 INFO L93 Difference]: Finished difference Result 622 states and 819 transitions. [2019-09-10 08:06:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:40,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-10 08:06:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:40,029 INFO L225 Difference]: With dead ends: 622 [2019-09-10 08:06:40,029 INFO L226 Difference]: Without dead ends: 622 [2019-09-10 08:06:40,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-10 08:06:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 199. [2019-09-10 08:06:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 08:06:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2019-09-10 08:06:40,034 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 94 [2019-09-10 08:06:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:40,035 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2019-09-10 08:06:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2019-09-10 08:06:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:06:40,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:40,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:40,036 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -442414623, now seen corresponding path program 1 times [2019-09-10 08:06:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:40,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:40,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:40,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:40,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:41,280 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:06:41,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:06:41,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:41,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:06:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:06:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:06:41,281 INFO L87 Difference]: Start difference. First operand 199 states and 238 transitions. Second operand 22 states. [2019-09-10 08:06:42,153 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:42,399 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:06:42,705 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 08:06:42,906 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:06:43,095 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:06:43,279 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:06:43,434 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:06:43,593 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:06:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:45,663 INFO L93 Difference]: Finished difference Result 546 states and 695 transitions. [2019-09-10 08:06:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:06:45,663 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 94 [2019-09-10 08:06:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:45,665 INFO L225 Difference]: With dead ends: 546 [2019-09-10 08:06:45,665 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 08:06:45,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:06:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 08:06:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 211. [2019-09-10 08:06:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 08:06:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2019-09-10 08:06:45,670 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 94 [2019-09-10 08:06:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:45,671 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2019-09-10 08:06:45,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:06:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2019-09-10 08:06:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:06:45,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:45,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:45,672 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 596288672, now seen corresponding path program 1 times [2019-09-10 08:06:45,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:45,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:46,304 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:06:46,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:06:46,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:46,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:06:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:06:46,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:46,306 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 15 states. [2019-09-10 08:06:47,279 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:06:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:47,751 INFO L93 Difference]: Finished difference Result 325 states and 398 transitions. [2019-09-10 08:06:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:06:47,753 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-09-10 08:06:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:47,754 INFO L225 Difference]: With dead ends: 325 [2019-09-10 08:06:47,754 INFO L226 Difference]: Without dead ends: 319 [2019-09-10 08:06:47,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:06:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-10 08:06:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 204. [2019-09-10 08:06:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-10 08:06:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2019-09-10 08:06:47,758 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 95 [2019-09-10 08:06:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:47,758 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2019-09-10 08:06:47,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:06:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2019-09-10 08:06:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:06:47,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:47,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:47,760 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1383966999, now seen corresponding path program 1 times [2019-09-10 08:06:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:48,259 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:06:48,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:48,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:06:48,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:48,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:06:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:06:48,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:48,260 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand 14 states. [2019-09-10 08:06:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:49,656 INFO L93 Difference]: Finished difference Result 466 states and 609 transitions. [2019-09-10 08:06:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:06:49,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2019-09-10 08:06:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:49,657 INFO L225 Difference]: With dead ends: 466 [2019-09-10 08:06:49,657 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 08:06:49,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:06:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 08:06:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 165. [2019-09-10 08:06:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-10 08:06:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2019-09-10 08:06:49,661 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 95 [2019-09-10 08:06:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:49,661 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2019-09-10 08:06:49,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:06:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2019-09-10 08:06:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:06:49,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:49,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:49,662 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -467440922, now seen corresponding path program 1 times [2019-09-10 08:06:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:49,733 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:06:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:49,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:49,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:49,734 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 3 states. [2019-09-10 08:06:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:49,769 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2019-09-10 08:06:49,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:49,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:06:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:49,770 INFO L225 Difference]: With dead ends: 226 [2019-09-10 08:06:49,770 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 08:06:49,771 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:06:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 08:06:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2019-09-10 08:06:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-10 08:06:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2019-09-10 08:06:49,775 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 122 [2019-09-10 08:06:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:49,775 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2019-09-10 08:06:49,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2019-09-10 08:06:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:49,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:49,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:49,776 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1042185839, now seen corresponding path program 1 times [2019-09-10 08:06:49,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:49,902 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:06:49,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:49,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:49,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:49,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:49,904 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand 7 states. [2019-09-10 08:06:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:50,358 INFO L93 Difference]: Finished difference Result 488 states and 654 transitions. [2019-09-10 08:06:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:50,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 08:06:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:50,360 INFO L225 Difference]: With dead ends: 488 [2019-09-10 08:06:50,360 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 08:06:50,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 08:06:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 256. [2019-09-10 08:06:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-10 08:06:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 329 transitions. [2019-09-10 08:06:50,366 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 329 transitions. Word has length 124 [2019-09-10 08:06:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:50,366 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 329 transitions. [2019-09-10 08:06:50,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 329 transitions. [2019-09-10 08:06:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:50,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:50,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:50,368 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash -611885514, now seen corresponding path program 1 times [2019-09-10 08:06:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:50,456 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:06:50,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:50,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:50,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:50,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:50,458 INFO L87 Difference]: Start difference. First operand 256 states and 329 transitions. Second operand 3 states. [2019-09-10 08:06:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:50,488 INFO L93 Difference]: Finished difference Result 394 states and 518 transitions. [2019-09-10 08:06:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:50,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:06:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:50,489 INFO L225 Difference]: With dead ends: 394 [2019-09-10 08:06:50,489 INFO L226 Difference]: Without dead ends: 394 [2019-09-10 08:06:50,489 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:06:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-10 08:06:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-09-10 08:06:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-10 08:06:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 517 transitions. [2019-09-10 08:06:50,494 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 517 transitions. Word has length 124 [2019-09-10 08:06:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:50,494 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 517 transitions. [2019-09-10 08:06:50,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 517 transitions. [2019-09-10 08:06:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:50,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:50,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:50,495 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash -545392002, now seen corresponding path program 1 times [2019-09-10 08:06:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:50,607 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:06:50,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:50,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:50,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:50,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:50,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:50,609 INFO L87 Difference]: Start difference. First operand 392 states and 517 transitions. Second operand 3 states. [2019-09-10 08:06:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:50,652 INFO L93 Difference]: Finished difference Result 543 states and 723 transitions. [2019-09-10 08:06:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:50,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:06:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:50,653 INFO L225 Difference]: With dead ends: 543 [2019-09-10 08:06:50,653 INFO L226 Difference]: Without dead ends: 543 [2019-09-10 08:06:50,654 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:06:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-10 08:06:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2019-09-10 08:06:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 08:06:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 722 transitions. [2019-09-10 08:06:50,660 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 722 transitions. Word has length 124 [2019-09-10 08:06:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:50,660 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 722 transitions. [2019-09-10 08:06:50,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 722 transitions. [2019-09-10 08:06:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:50,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:50,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:50,662 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:50,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:50,662 INFO L82 PathProgramCache]: Analyzing trace with hash -850819473, now seen corresponding path program 1 times [2019-09-10 08:06:50,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:50,792 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:06:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:50,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:50,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:50,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:50,793 INFO L87 Difference]: Start difference. First operand 541 states and 722 transitions. Second operand 7 states. [2019-09-10 08:06:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:51,305 INFO L93 Difference]: Finished difference Result 1740 states and 2366 transitions. [2019-09-10 08:06:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:51,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 08:06:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:51,307 INFO L225 Difference]: With dead ends: 1740 [2019-09-10 08:06:51,307 INFO L226 Difference]: Without dead ends: 1740 [2019-09-10 08:06:51,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-09-10 08:06:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1040. [2019-09-10 08:06:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-09-10 08:06:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1421 transitions. [2019-09-10 08:06:51,320 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1421 transitions. Word has length 124 [2019-09-10 08:06:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:51,320 INFO L475 AbstractCegarLoop]: Abstraction has 1040 states and 1421 transitions. [2019-09-10 08:06:51,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1421 transitions. [2019-09-10 08:06:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:51,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:51,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:51,322 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1444234351, now seen corresponding path program 1 times [2019-09-10 08:06:51,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:51,437 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:06:51,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:51,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:51,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:51,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:51,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:51,438 INFO L87 Difference]: Start difference. First operand 1040 states and 1421 transitions. Second operand 7 states. [2019-09-10 08:06:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:51,938 INFO L93 Difference]: Finished difference Result 3294 states and 4520 transitions. [2019-09-10 08:06:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:51,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 08:06:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:51,942 INFO L225 Difference]: With dead ends: 3294 [2019-09-10 08:06:51,942 INFO L226 Difference]: Without dead ends: 3294 [2019-09-10 08:06:51,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-09-10 08:06:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2098. [2019-09-10 08:06:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2019-09-10 08:06:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2903 transitions. [2019-09-10 08:06:51,973 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2903 transitions. Word has length 124 [2019-09-10 08:06:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:51,974 INFO L475 AbstractCegarLoop]: Abstraction has 2098 states and 2903 transitions. [2019-09-10 08:06:51,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2903 transitions. [2019-09-10 08:06:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:51,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:51,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:51,976 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -154008977, now seen corresponding path program 1 times [2019-09-10 08:06:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:52,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:52,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:52,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:52,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:52,085 INFO L87 Difference]: Start difference. First operand 2098 states and 2903 transitions. Second operand 7 states. [2019-09-10 08:06:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:52,596 INFO L93 Difference]: Finished difference Result 7200 states and 9962 transitions. [2019-09-10 08:06:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:52,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 08:06:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:52,603 INFO L225 Difference]: With dead ends: 7200 [2019-09-10 08:06:52,603 INFO L226 Difference]: Without dead ends: 7200 [2019-09-10 08:06:52,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-09-10 08:06:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 4334. [2019-09-10 08:06:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4334 states. [2019-09-10 08:06:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 6035 transitions. [2019-09-10 08:06:52,665 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 6035 transitions. Word has length 124 [2019-09-10 08:06:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:52,665 INFO L475 AbstractCegarLoop]: Abstraction has 4334 states and 6035 transitions. [2019-09-10 08:06:52,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 6035 transitions. [2019-09-10 08:06:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:06:52,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:52,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:52,668 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1325383791, now seen corresponding path program 1 times [2019-09-10 08:06:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:52,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:52,792 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:06:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:52,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:52,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:52,793 INFO L87 Difference]: Start difference. First operand 4334 states and 6035 transitions. Second operand 7 states. [2019-09-10 08:06:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:53,309 INFO L93 Difference]: Finished difference Result 12292 states and 17081 transitions. [2019-09-10 08:06:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:06:53,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 08:06:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,320 INFO L225 Difference]: With dead ends: 12292 [2019-09-10 08:06:53,320 INFO L226 Difference]: Without dead ends: 12292 [2019-09-10 08:06:53,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12292 states. [2019-09-10 08:06:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12292 to 7198. [2019-09-10 08:06:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7198 states. [2019-09-10 08:06:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 10043 transitions. [2019-09-10 08:06:53,472 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 10043 transitions. Word has length 124 [2019-09-10 08:06:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:53,473 INFO L475 AbstractCegarLoop]: Abstraction has 7198 states and 10043 transitions. [2019-09-10 08:06:53,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 10043 transitions. [2019-09-10 08:06:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:06:53,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:53,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:53,475 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1768680915, now seen corresponding path program 1 times [2019-09-10 08:06:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:53,567 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:06:53,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:53,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:53,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:53,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:53,568 INFO L87 Difference]: Start difference. First operand 7198 states and 10043 transitions. Second operand 3 states. [2019-09-10 08:06:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:53,602 INFO L93 Difference]: Finished difference Result 6768 states and 9324 transitions. [2019-09-10 08:06:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:53,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:06:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,610 INFO L225 Difference]: With dead ends: 6768 [2019-09-10 08:06:53,610 INFO L226 Difference]: Without dead ends: 6768 [2019-09-10 08:06:53,610 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:06:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-09-10 08:06:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 5154. [2019-09-10 08:06:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5154 states. [2019-09-10 08:06:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 7091 transitions. [2019-09-10 08:06:53,670 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 7091 transitions. Word has length 125 [2019-09-10 08:06:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:53,670 INFO L475 AbstractCegarLoop]: Abstraction has 5154 states and 7091 transitions. [2019-09-10 08:06:53,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 7091 transitions. [2019-09-10 08:06:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:06:53,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:53,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:53,672 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:53,672 INFO L82 PathProgramCache]: Analyzing trace with hash 233216673, now seen corresponding path program 1 times [2019-09-10 08:06:53,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:53,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:53,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:53,745 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:06:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:53,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:53,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:53,746 INFO L87 Difference]: Start difference. First operand 5154 states and 7091 transitions. Second operand 3 states. [2019-09-10 08:06:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:53,776 INFO L93 Difference]: Finished difference Result 4940 states and 6708 transitions. [2019-09-10 08:06:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:53,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:06:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,780 INFO L225 Difference]: With dead ends: 4940 [2019-09-10 08:06:53,780 INFO L226 Difference]: Without dead ends: 4940 [2019-09-10 08:06:53,780 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:06:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2019-09-10 08:06:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4602. [2019-09-10 08:06:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4602 states. [2019-09-10 08:06:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6305 transitions. [2019-09-10 08:06:53,813 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6305 transitions. Word has length 126 [2019-09-10 08:06:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:53,813 INFO L475 AbstractCegarLoop]: Abstraction has 4602 states and 6305 transitions. [2019-09-10 08:06:53,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6305 transitions. [2019-09-10 08:06:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:06:53,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:53,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:53,815 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1710481623, now seen corresponding path program 1 times [2019-09-10 08:06:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:53,880 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:06:53,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:53,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:53,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:53,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:53,881 INFO L87 Difference]: Start difference. First operand 4602 states and 6305 transitions. Second operand 3 states. [2019-09-10 08:06:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:53,909 INFO L93 Difference]: Finished difference Result 5072 states and 6920 transitions. [2019-09-10 08:06:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:53,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 08:06:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,915 INFO L225 Difference]: With dead ends: 5072 [2019-09-10 08:06:53,915 INFO L226 Difference]: Without dead ends: 5072 [2019-09-10 08:06:53,916 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:06:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-09-10 08:06:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5070. [2019-09-10 08:06:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5070 states. [2019-09-10 08:06:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 6919 transitions. [2019-09-10 08:06:53,948 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 6919 transitions. Word has length 127 [2019-09-10 08:06:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:53,948 INFO L475 AbstractCegarLoop]: Abstraction has 5070 states and 6919 transitions. [2019-09-10 08:06:53,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 6919 transitions. [2019-09-10 08:06:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:06:53,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:53,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:53,950 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash -113713814, now seen corresponding path program 1 times [2019-09-10 08:06:53,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:54,054 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:06:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:54,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:06:54,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:54,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:06:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:06:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:06:54,056 INFO L87 Difference]: Start difference. First operand 5070 states and 6919 transitions. Second operand 6 states. [2019-09-10 08:06:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:54,149 INFO L93 Difference]: Finished difference Result 7623 states and 10319 transitions. [2019-09-10 08:06:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:06:54,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 08:06:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:54,156 INFO L225 Difference]: With dead ends: 7623 [2019-09-10 08:06:54,156 INFO L226 Difference]: Without dead ends: 7623 [2019-09-10 08:06:54,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2019-09-10 08:06:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 5124. [2019-09-10 08:06:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-09-10 08:06:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6955 transitions. [2019-09-10 08:06:54,219 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6955 transitions. Word has length 127 [2019-09-10 08:06:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:54,219 INFO L475 AbstractCegarLoop]: Abstraction has 5124 states and 6955 transitions. [2019-09-10 08:06:54,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:06:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6955 transitions. [2019-09-10 08:06:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:06:54,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:54,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:54,223 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash -36770884, now seen corresponding path program 1 times [2019-09-10 08:06:54,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:06:54,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:54,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:06:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:06:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:06:54,337 INFO L87 Difference]: Start difference. First operand 5124 states and 6955 transitions. Second operand 3 states. [2019-09-10 08:06:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:54,373 INFO L93 Difference]: Finished difference Result 8576 states and 11612 transitions. [2019-09-10 08:06:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:06:54,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:06:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:54,381 INFO L225 Difference]: With dead ends: 8576 [2019-09-10 08:06:54,381 INFO L226 Difference]: Without dead ends: 8576 [2019-09-10 08:06:54,381 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:06:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2019-09-10 08:06:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 8094. [2019-09-10 08:06:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8094 states. [2019-09-10 08:06:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 11031 transitions. [2019-09-10 08:06:54,480 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 11031 transitions. Word has length 158 [2019-09-10 08:06:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:54,480 INFO L475 AbstractCegarLoop]: Abstraction has 8094 states and 11031 transitions. [2019-09-10 08:06:54,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:06:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 11031 transitions. [2019-09-10 08:06:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:06:54,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:54,484 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:54,484 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash 257185900, now seen corresponding path program 1 times [2019-09-10 08:06:54,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:54,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:54,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:54,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:54,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:06:54,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-09-10 08:06:54,637 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4194], [4199], [4202], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:06:54,685 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:06:54,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:06:55,008 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:56,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:56,288 INFO L272 AbstractInterpreter]: Visited 142 different actions 567 times. Merged at 49 different actions 386 times. Widened at 22 different actions 84 times. Performed 2526 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 14 different actions. Largest state had 449 variables. [2019-09-10 08:06:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:56,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:56,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:56,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:06:56,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:56,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:06:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:56,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:06:56,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:06:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:06:56,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:06:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:06:57,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:06:57,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:06:57,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:57,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:57,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:57,065 INFO L87 Difference]: Start difference. First operand 8094 states and 11031 transitions. Second operand 7 states. [2019-09-10 08:06:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:57,321 INFO L93 Difference]: Finished difference Result 40042 states and 54550 transitions. [2019-09-10 08:06:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:06:57,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 08:06:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:57,405 INFO L225 Difference]: With dead ends: 40042 [2019-09-10 08:06:57,405 INFO L226 Difference]: Without dead ends: 40042 [2019-09-10 08:06:57,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40042 states. [2019-09-10 08:06:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40042 to 13182. [2019-09-10 08:06:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13182 states. [2019-09-10 08:06:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13182 states to 13182 states and 17907 transitions. [2019-09-10 08:06:57,743 INFO L78 Accepts]: Start accepts. Automaton has 13182 states and 17907 transitions. Word has length 159 [2019-09-10 08:06:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:57,743 INFO L475 AbstractCegarLoop]: Abstraction has 13182 states and 17907 transitions. [2019-09-10 08:06:57,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13182 states and 17907 transitions. [2019-09-10 08:06:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:06:57,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:57,749 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:57,749 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1635819412, now seen corresponding path program 1 times [2019-09-10 08:06:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:57,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:57,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:57,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:06:57,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-09-10 08:06:57,941 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:06:57,954 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:06:57,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:06:58,657 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:59,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:59,845 INFO L272 AbstractInterpreter]: Visited 142 different actions 582 times. Merged at 49 different actions 399 times. Widened at 20 different actions 73 times. Performed 2533 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2533 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 449 variables. [2019-09-10 08:06:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:59,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:59,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:59,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:06:59,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:59,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:07:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:00,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:07:00,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:07:00,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:07:00,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:07:00,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:07:00,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:00,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:00,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:07:00,730 INFO L87 Difference]: Start difference. First operand 13182 states and 17907 transitions. Second operand 7 states. [2019-09-10 08:07:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:00,961 INFO L93 Difference]: Finished difference Result 44864 states and 61027 transitions. [2019-09-10 08:07:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:00,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 08:07:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:01,051 INFO L225 Difference]: With dead ends: 44864 [2019-09-10 08:07:01,051 INFO L226 Difference]: Without dead ends: 44864 [2019-09-10 08:07:01,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:07:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44864 states. [2019-09-10 08:07:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44864 to 20790. [2019-09-10 08:07:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20790 states. [2019-09-10 08:07:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 28161 transitions. [2019-09-10 08:07:01,434 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 28161 transitions. Word has length 159 [2019-09-10 08:07:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:01,434 INFO L475 AbstractCegarLoop]: Abstraction has 20790 states and 28161 transitions. [2019-09-10 08:07:01,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 28161 transitions. [2019-09-10 08:07:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:07:01,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:01,439 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:01,440 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash 540383852, now seen corresponding path program 1 times [2019-09-10 08:07:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:01,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:01,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:01,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:01,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:01,654 INFO L87 Difference]: Start difference. First operand 20790 states and 28161 transitions. Second operand 3 states. [2019-09-10 08:07:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:01,715 INFO L93 Difference]: Finished difference Result 19172 states and 25462 transitions. [2019-09-10 08:07:01,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 08:07:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:01,750 INFO L225 Difference]: With dead ends: 19172 [2019-09-10 08:07:01,750 INFO L226 Difference]: Without dead ends: 19172 [2019-09-10 08:07:01,751 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:07:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19172 states. [2019-09-10 08:07:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19172 to 18630. [2019-09-10 08:07:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18630 states. [2019-09-10 08:07:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18630 states to 18630 states and 24831 transitions. [2019-09-10 08:07:01,966 INFO L78 Accepts]: Start accepts. Automaton has 18630 states and 24831 transitions. Word has length 159 [2019-09-10 08:07:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:01,966 INFO L475 AbstractCegarLoop]: Abstraction has 18630 states and 24831 transitions. [2019-09-10 08:07:01,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18630 states and 24831 transitions. [2019-09-10 08:07:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:07:01,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:01,970 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:01,970 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 705646096, now seen corresponding path program 1 times [2019-09-10 08:07:01,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:01,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:01,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:02,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:02,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:02,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:02,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:02,076 INFO L87 Difference]: Start difference. First operand 18630 states and 24831 transitions. Second operand 3 states. [2019-09-10 08:07:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:02,138 INFO L93 Difference]: Finished difference Result 22708 states and 29740 transitions. [2019-09-10 08:07:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:02,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 08:07:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:02,167 INFO L225 Difference]: With dead ends: 22708 [2019-09-10 08:07:02,167 INFO L226 Difference]: Without dead ends: 22708 [2019-09-10 08:07:02,167 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:07:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22708 states. [2019-09-10 08:07:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22708 to 21706. [2019-09-10 08:07:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21706 states. [2019-09-10 08:07:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21706 states to 21706 states and 28539 transitions. [2019-09-10 08:07:02,420 INFO L78 Accepts]: Start accepts. Automaton has 21706 states and 28539 transitions. Word has length 160 [2019-09-10 08:07:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:02,421 INFO L475 AbstractCegarLoop]: Abstraction has 21706 states and 28539 transitions. [2019-09-10 08:07:02,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 21706 states and 28539 transitions. [2019-09-10 08:07:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:07:02,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:02,425 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:02,425 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1342590488, now seen corresponding path program 1 times [2019-09-10 08:07:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:02,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:02,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:02,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:02,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 08:07:02,798 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4260], [4265], [4268], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:07:02,803 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:02,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:02,934 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:04,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:04,335 INFO L272 AbstractInterpreter]: Visited 150 different actions 820 times. Merged at 57 different actions 586 times. Widened at 24 different actions 104 times. Performed 3303 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3303 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 68 fixpoints after 18 different actions. Largest state had 451 variables. [2019-09-10 08:07:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:04,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:04,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:04,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:07:04,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:04,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:04,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:07:04,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:07:04,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:07:05,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:07:05,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 20 [2019-09-10 08:07:05,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:05,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:07:05,116 INFO L87 Difference]: Start difference. First operand 21706 states and 28539 transitions. Second operand 7 states. [2019-09-10 08:07:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:05,310 INFO L93 Difference]: Finished difference Result 52308 states and 69060 transitions. [2019-09-10 08:07:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:05,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:07:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:05,366 INFO L225 Difference]: With dead ends: 52308 [2019-09-10 08:07:05,366 INFO L226 Difference]: Without dead ends: 52308 [2019-09-10 08:07:05,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:07:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52308 states. [2019-09-10 08:07:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52308 to 27026. [2019-09-10 08:07:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27026 states. [2019-09-10 08:07:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27026 states to 27026 states and 35515 transitions. [2019-09-10 08:07:05,802 INFO L78 Accepts]: Start accepts. Automaton has 27026 states and 35515 transitions. Word has length 161 [2019-09-10 08:07:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:05,803 INFO L475 AbstractCegarLoop]: Abstraction has 27026 states and 35515 transitions. [2019-09-10 08:07:05,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27026 states and 35515 transitions. [2019-09-10 08:07:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:07:05,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:05,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:05,808 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash -255652840, now seen corresponding path program 1 times [2019-09-10 08:07:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:05,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:05,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:06,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:06,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:06,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 08:07:06,024 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4238], [4243], [4246], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:07:06,028 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:06,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:06,919 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:07,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:07,956 INFO L272 AbstractInterpreter]: Visited 150 different actions 900 times. Merged at 57 different actions 658 times. Widened at 25 different actions 132 times. Performed 3569 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 16 different actions. Largest state had 451 variables. [2019-09-10 08:07:07,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:07,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:07,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:07,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:07,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:07,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:07:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:08,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:07:08,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:07:08,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:07:08,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:07:08,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:07:08,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:08,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:07:08,637 INFO L87 Difference]: Start difference. First operand 27026 states and 35515 transitions. Second operand 7 states. [2019-09-10 08:07:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:08,907 INFO L93 Difference]: Finished difference Result 57826 states and 76312 transitions. [2019-09-10 08:07:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:08,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:07:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:08,976 INFO L225 Difference]: With dead ends: 57826 [2019-09-10 08:07:08,976 INFO L226 Difference]: Without dead ends: 57826 [2019-09-10 08:07:08,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:07:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57826 states. [2019-09-10 08:07:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57826 to 32346. [2019-09-10 08:07:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32346 states. [2019-09-10 08:07:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32346 states to 32346 states and 42491 transitions. [2019-09-10 08:07:09,541 INFO L78 Accepts]: Start accepts. Automaton has 32346 states and 42491 transitions. Word has length 161 [2019-09-10 08:07:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:09,542 INFO L475 AbstractCegarLoop]: Abstraction has 32346 states and 42491 transitions. [2019-09-10 08:07:09,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 32346 states and 42491 transitions. [2019-09-10 08:07:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:07:09,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:09,545 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:09,545 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1223739928, now seen corresponding path program 1 times [2019-09-10 08:07:09,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:09,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:09,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:07:09,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:09,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:09,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:09,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:09,703 INFO L87 Difference]: Start difference. First operand 32346 states and 42491 transitions. Second operand 7 states. [2019-09-10 08:07:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:09,976 INFO L93 Difference]: Finished difference Result 63344 states and 83564 transitions. [2019-09-10 08:07:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:09,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:07:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:10,036 INFO L225 Difference]: With dead ends: 63344 [2019-09-10 08:07:10,036 INFO L226 Difference]: Without dead ends: 63344 [2019-09-10 08:07:10,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:07:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63344 states. [2019-09-10 08:07:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63344 to 37666. [2019-09-10 08:07:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-09-10 08:07:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 49467 transitions. [2019-09-10 08:07:10,442 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 49467 transitions. Word has length 161 [2019-09-10 08:07:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:10,442 INFO L475 AbstractCegarLoop]: Abstraction has 37666 states and 49467 transitions. [2019-09-10 08:07:10,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 49467 transitions. [2019-09-10 08:07:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:07:10,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:10,446 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:10,447 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash -624673372, now seen corresponding path program 1 times [2019-09-10 08:07:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:10,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:10,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:10,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:10,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:10,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-10 08:07:10,787 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2327], [2329], [2332], [2336], [2338], [2343], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:07:10,793 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:10,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:10,924 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:12,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:12,257 INFO L272 AbstractInterpreter]: Visited 150 different actions 1088 times. Merged at 57 different actions 815 times. Widened at 28 different actions 175 times. Performed 4194 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 129 fixpoints after 26 different actions. Largest state had 451 variables. [2019-09-10 08:07:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:12,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:12,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:12,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:12,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:07:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:12,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 2443 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:07:12,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:12,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:12,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:12,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:13,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:13,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:07:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:07:16,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:07:16,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:07:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:07:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:07:16,565 INFO L87 Difference]: Start difference. First operand 37666 states and 49467 transitions. Second operand 21 states. [2019-09-10 08:07:17,063 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-10 08:07:19,285 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:07:19,718 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:19,891 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:07:20,539 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:07:21,028 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:07:21,349 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:21,492 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:07:21,649 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:07:21,803 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:22,002 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:22,145 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:07:22,305 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:22,470 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:22,631 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:07:23,013 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:23,183 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:23,375 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:07:23,559 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:23,896 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 08:07:24,139 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:24,349 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:07:24,504 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:24,832 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:24,984 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:25,268 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:07:25,567 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 08:07:26,465 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:07:26,663 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:26,848 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:07:27,031 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:07:27,420 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:27,730 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:07:27,954 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:28,143 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:07:28,343 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:28,552 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:07:28,723 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:07:28,894 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:07:29,233 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:07:29,387 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:07:29,542 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:29,711 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:30,069 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:07:30,336 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:07:30,499 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:07:30,654 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:07:30,843 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:31,033 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:07:31,230 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:07:31,421 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:31,586 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:07:31,787 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:31,971 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:32,138 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:07:32,287 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:07:32,712 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:07:32,883 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:07:33,210 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:07:33,417 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:33,634 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:33,810 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:34,045 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:34,244 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:07:34,508 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:07:34,710 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:07:34,926 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:35,157 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:35,355 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:35,542 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:35,738 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:07:36,193 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:07:36,552 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:07:36,730 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:07:36,908 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:07:37,073 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:07:37,528 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:37,693 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:37,921 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:07:38,121 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:07:38,340 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:38,582 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:07:38,751 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:38,953 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:39,132 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:07:39,336 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:07:39,518 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:39,749 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:39,936 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:40,083 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:07:40,242 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:07:40,602 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:07:40,766 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:07:40,953 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:07:41,152 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:07:41,325 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:41,518 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:41,675 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 08:07:42,002 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:42,270 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:07:42,428 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:07:42,620 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:42,856 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:43,013 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:07:43,185 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:07:43,364 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:43,601 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:07:43,820 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:07:43,985 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:07:44,190 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:44,381 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:44,675 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:07:44,841 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:45,156 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:07:45,366 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:07:45,538 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:07:46,140 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:46,414 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:07:46,661 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:07:46,839 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:07:47,037 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:47,321 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:07:47,504 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:07:47,718 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:47,925 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:07:48,078 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:07:48,273 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:48,497 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:48,683 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:07:48,908 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:07:49,049 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:07:49,213 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:07:49,528 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:07:49,864 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:50,033 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:07:50,237 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:07:50,438 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:07:50,627 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:50,928 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:51,136 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:07:51,500 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:07:51,735 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:07:51,993 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:07:52,212 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:52,391 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:07:52,608 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:07:52,817 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:53,061 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:07:53,238 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:07:53,428 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:07:53,640 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:54,003 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:54,220 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:07:54,470 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:07:54,638 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:54,857 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:07:55,085 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:07:55,289 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:07:55,467 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:55,700 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:07:55,864 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:07:56,076 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:56,301 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:07:56,466 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:56,699 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:07:56,929 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:57,257 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:07:57,591 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:07:57,913 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:07:58,066 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:58,294 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:58,488 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:07:58,685 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:07:58,865 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:07:59,073 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:07:59,251 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:07:59,717 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:07:59,940 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:00,102 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:08:00,411 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:08:00,571 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:08:00,760 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:08:00,937 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:01,278 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:01,482 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:01,655 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:01,881 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:02,071 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:02,268 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:02,422 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:02,591 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:02,753 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:08:02,950 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:03,266 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:03,436 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:03,766 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:03,963 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:04,137 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:04,490 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:08:04,955 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:08:05,198 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:08:05,443 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:05,626 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:08:05,851 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:08:06,093 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:06,362 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-10 08:08:06,620 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:08:07,067 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:08:09,517 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:09,700 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:09,885 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:08:10,271 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:10,509 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:10,804 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:08:10,952 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:08:11,149 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:11,323 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:11,487 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:08:11,632 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:08:11,934 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:12,106 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:08:12,279 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:12,524 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:08:12,918 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:13,270 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:08:13,473 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:13,671 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:08:13,854 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:14,148 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:08:14,313 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:08:14,490 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:14,643 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:08:14,827 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:14,997 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:08:15,304 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:08:15,604 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:08:15,778 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:08:15,967 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:16,240 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:08:16,523 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:08:16,844 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:17,142 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:08:17,308 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:08:17,469 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:08:17,650 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:17,975 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:08:19,986 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:20,439 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:20,803 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 08:08:21,019 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:21,231 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:08:21,443 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:08:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:22,662 INFO L93 Difference]: Finished difference Result 897761 states and 1151181 transitions. [2019-09-10 08:08:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:08:22,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2019-09-10 08:08:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:24,061 INFO L225 Difference]: With dead ends: 897761 [2019-09-10 08:08:24,061 INFO L226 Difference]: Without dead ends: 897761 [2019-09-10 08:08:24,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 262 SyntacticMatches, 45 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52162 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=15654, Invalid=110016, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:08:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897761 states. [2019-09-10 08:08:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897761 to 186522. [2019-09-10 08:08:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186522 states. [2019-09-10 08:08:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186522 states to 186522 states and 243478 transitions. [2019-09-10 08:08:38,454 INFO L78 Accepts]: Start accepts. Automaton has 186522 states and 243478 transitions. Word has length 162 [2019-09-10 08:08:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:38,455 INFO L475 AbstractCegarLoop]: Abstraction has 186522 states and 243478 transitions. [2019-09-10 08:08:38,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:08:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 186522 states and 243478 transitions. [2019-09-10 08:08:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:08:38,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:38,473 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:38,473 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash -693952735, now seen corresponding path program 1 times [2019-09-10 08:08:38,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:38,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:38,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:38,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:38,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:38,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 08:08:38,774 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4194], [4199], [4202], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:08:38,777 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:38,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:38,867 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:39,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:39,742 INFO L272 AbstractInterpreter]: Visited 152 different actions 941 times. Merged at 59 different actions 695 times. Widened at 27 different actions 154 times. Performed 3699 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3699 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 77 fixpoints after 19 different actions. Largest state had 451 variables. [2019-09-10 08:08:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:39,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:39,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:39,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:39,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:40,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 2448 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:08:40,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:40,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:40,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:40,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:40,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:41,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2019-09-10 08:08:41,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:41,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:08:41,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:08:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:08:41,120 INFO L87 Difference]: Start difference. First operand 186522 states and 243478 transitions. Second operand 19 states. [2019-09-10 08:08:45,233 WARN L188 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-09-10 08:08:45,499 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:08:47,650 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 08:08:47,800 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:08:54,470 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:08:54,635 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:08:54,999 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:08:55,173 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:08:55,839 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:08:55,996 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:08:56,153 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 08:08:58,612 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:09:00,383 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 08:09:00,643 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 08:09:04,176 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:09:04,940 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 08:09:08,030 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 08:09:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:23,662 INFO L93 Difference]: Finished difference Result 1591198 states and 2049855 transitions. [2019-09-10 08:09:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-10 08:09:23,663 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 163 [2019-09-10 08:09:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:25,847 INFO L225 Difference]: With dead ends: 1591198 [2019-09-10 08:09:25,847 INFO L226 Difference]: Without dead ends: 1591198 [2019-09-10 08:09:25,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26519 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=8901, Invalid=56891, Unknown=0, NotChecked=0, Total=65792 [2019-09-10 08:09:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591198 states. [2019-09-10 08:09:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591198 to 451738. [2019-09-10 08:09:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451738 states. [2019-09-10 08:09:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451738 states to 451738 states and 588532 transitions. [2019-09-10 08:09:47,697 INFO L78 Accepts]: Start accepts. Automaton has 451738 states and 588532 transitions. Word has length 163 [2019-09-10 08:09:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:47,697 INFO L475 AbstractCegarLoop]: Abstraction has 451738 states and 588532 transitions. [2019-09-10 08:09:47,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:09:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 451738 states and 588532 transitions. [2019-09-10 08:09:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:09:47,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:47,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:47,730 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2002734071, now seen corresponding path program 1 times [2019-09-10 08:09:47,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:47,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:47,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:47,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:09:47,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:47,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:09:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:09:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:09:47,826 INFO L87 Difference]: Start difference. First operand 451738 states and 588532 transitions. Second operand 3 states. [2019-09-10 08:09:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:50,658 INFO L93 Difference]: Finished difference Result 410096 states and 522599 transitions. [2019-09-10 08:09:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:09:50,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:09:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:51,160 INFO L225 Difference]: With dead ends: 410096 [2019-09-10 08:09:51,160 INFO L226 Difference]: Without dead ends: 410096 [2019-09-10 08:09:51,160 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:09:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410096 states. [2019-09-10 08:09:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410096 to 384364. [2019-09-10 08:09:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384364 states. [2019-09-10 08:10:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384364 states to 384364 states and 494530 transitions. [2019-09-10 08:10:05,965 INFO L78 Accepts]: Start accepts. Automaton has 384364 states and 494530 transitions. Word has length 164 [2019-09-10 08:10:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:05,965 INFO L475 AbstractCegarLoop]: Abstraction has 384364 states and 494530 transitions. [2019-09-10 08:10:05,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 384364 states and 494530 transitions. [2019-09-10 08:10:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:10:05,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:05,983 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:05,983 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1773606458, now seen corresponding path program 1 times [2019-09-10 08:10:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:05,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:05,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:10:06,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:06,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:06,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:06,185 INFO L87 Difference]: Start difference. First operand 384364 states and 494530 transitions. Second operand 9 states. [2019-09-10 08:10:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:08,575 INFO L93 Difference]: Finished difference Result 550948 states and 707467 transitions. [2019-09-10 08:10:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:10:08,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-09-10 08:10:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:09,245 INFO L225 Difference]: With dead ends: 550948 [2019-09-10 08:10:09,245 INFO L226 Difference]: Without dead ends: 550948 [2019-09-10 08:10:09,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:10:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550948 states. [2019-09-10 08:10:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550948 to 384364. [2019-09-10 08:10:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384364 states. [2019-09-10 08:10:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384364 states to 384364 states and 494526 transitions. [2019-09-10 08:10:19,538 INFO L78 Accepts]: Start accepts. Automaton has 384364 states and 494526 transitions. Word has length 164 [2019-09-10 08:10:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:19,538 INFO L475 AbstractCegarLoop]: Abstraction has 384364 states and 494526 transitions. [2019-09-10 08:10:19,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 384364 states and 494526 transitions. [2019-09-10 08:10:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:10:19,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:19,552 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:19,553 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1543740154, now seen corresponding path program 1 times [2019-09-10 08:10:19,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:20,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:20,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:20,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-09-10 08:10:20,865 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3939], [3942], [3968], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4216], [4221], [4224], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:10:20,868 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:20,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:20,946 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:21,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:21,964 INFO L272 AbstractInterpreter]: Visited 154 different actions 960 times. Merged at 59 different actions 712 times. Widened at 24 different actions 144 times. Performed 3792 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 20 different actions. Largest state had 451 variables. [2019-09-10 08:10:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:21,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:21,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:21,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:10:21,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:21,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:10:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:22,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:10:22,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:22,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:22,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:23,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:23,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:30,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:30,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:10:30,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:10:30,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:10:30,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:10:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:10:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:10:30,448 INFO L87 Difference]: Start difference. First operand 384364 states and 494526 transitions. Second operand 20 states. [2019-09-10 08:10:30,822 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:10:31,472 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:10:31,801 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:10:32,278 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:32,481 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:10:33,001 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:10:33,172 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:10:33,627 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:10:34,007 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:34,269 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:34,502 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:34,812 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:10:35,192 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:35,555 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:10:35,795 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:10:36,032 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:36,300 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:10:36,736 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:10:37,059 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:10:38,249 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:10:38,600 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:10:38,921 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:10:39,695 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:10:39,925 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:10:40,208 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:40,534 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:40,917 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:10:41,168 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:10:41,463 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:41,856 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:10:42,188 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:10:42,383 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:10:42,726 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:10:43,188 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:10:45,161 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:45,389 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:10:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:48,600 INFO L93 Difference]: Finished difference Result 2008638 states and 2558085 transitions. [2019-09-10 08:10:48,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:10:48,601 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 165 [2019-09-10 08:10:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:00,810 INFO L225 Difference]: With dead ends: 2008638 [2019-09-10 08:11:00,811 INFO L226 Difference]: Without dead ends: 2008638 [2019-09-10 08:11:00,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 286 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:11:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008638 states. [2019-09-10 08:11:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008638 to 914500. [2019-09-10 08:11:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914500 states. [2019-09-10 08:11:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914500 states to 914500 states and 1175554 transitions. [2019-09-10 08:11:29,175 INFO L78 Accepts]: Start accepts. Automaton has 914500 states and 1175554 transitions. Word has length 165 [2019-09-10 08:11:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:29,175 INFO L475 AbstractCegarLoop]: Abstraction has 914500 states and 1175554 transitions. [2019-09-10 08:11:29,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:11:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 914500 states and 1175554 transitions. [2019-09-10 08:11:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:11:29,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:29,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:29,223 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:29,223 INFO L82 PathProgramCache]: Analyzing trace with hash 793946873, now seen corresponding path program 1 times [2019-09-10 08:11:29,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:29,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:29,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:29,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:29,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:29,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:11:29,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2019-09-10 08:11:29,530 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3457], [3495], [3497], [3501], [3849], [3933], [3936], [3939], [3942], [3968], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4216], [4221], [4224], [4230], [4232], [4235], [4238], [4243], [4246], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:11:29,533 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:11:29,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:11:29,619 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:11:38,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:11:38,777 INFO L272 AbstractInterpreter]: Visited 155 different actions 863 times. Merged at 59 different actions 626 times. Widened at 23 different actions 113 times. Performed 3425 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 71 fixpoints after 18 different actions. Largest state had 451 variables. [2019-09-10 08:11:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:38,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:11:38,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:38,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:11:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:38,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:11:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:39,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 2449 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:11:39,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:11:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:39,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:11:39,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:39,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:40,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:11:40,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2019-09-10 08:11:40,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:11:40,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:11:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:11:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:11:40,803 INFO L87 Difference]: Start difference. First operand 914500 states and 1175554 transitions. Second operand 19 states. [2019-09-10 08:11:42,772 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-10 08:11:44,992 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-09-10 08:11:45,669 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-10 08:12:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:17,591 INFO L93 Difference]: Finished difference Result 3715567 states and 4693802 transitions. [2019-09-10 08:12:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 08:12:17,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 166 [2019-09-10 08:12:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:24,084 INFO L225 Difference]: With dead ends: 3715567 [2019-09-10 08:12:24,085 INFO L226 Difference]: Without dead ends: 3715567 [2019-09-10 08:12:24,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 288 SyntacticMatches, 26 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7710 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3504, Invalid=17376, Unknown=0, NotChecked=0, Total=20880 [2019-09-10 08:12:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715567 states. [2019-09-10 08:13:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715567 to 914424. [2019-09-10 08:13:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914424 states. [2019-09-10 08:13:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914424 states to 914424 states and 1175474 transitions. [2019-09-10 08:13:23,079 INFO L78 Accepts]: Start accepts. Automaton has 914424 states and 1175474 transitions. Word has length 166 [2019-09-10 08:13:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:23,079 INFO L475 AbstractCegarLoop]: Abstraction has 914424 states and 1175474 transitions. [2019-09-10 08:13:23,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:13:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 914424 states and 1175474 transitions. [2019-09-10 08:13:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:13:23,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:23,104 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:23,104 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1324893919, now seen corresponding path program 1 times [2019-09-10 08:13:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:23,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:23,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:30,712 WARN L188 SmtUtils]: Spent 7.45 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 08:13:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:30,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:30,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:30,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2019-09-10 08:13:30,883 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3939], [3942], [3968], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4216], [4219], [4230], [4232], [4235], [4238], [4243], [4246], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:13:30,887 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:30,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:30,967 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:31,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:31,716 INFO L272 AbstractInterpreter]: Visited 155 different actions 983 times. Merged at 60 different actions 734 times. Widened at 22 different actions 110 times. Performed 3907 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3907 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 76 fixpoints after 19 different actions. Largest state had 451 variables. [2019-09-10 08:13:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:31,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:31,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:31,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:13:31,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:31,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:13:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:32,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:13:32,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:32,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:32,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:35,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:35,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:13:35,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:35,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:13:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:13:35,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:13:35,326 INFO L87 Difference]: Start difference. First operand 914424 states and 1175474 transitions. Second operand 20 states. [2019-09-10 08:13:35,473 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:13:35,861 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 08:13:36,269 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:13:36,576 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:13:37,158 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:37,449 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:37,699 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:13:37,879 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:13:38,306 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:13:38,869 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:39,153 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:39,408 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:13:39,877 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:13:40,306 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:40,669 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:13:40,922 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:13:41,197 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:41,501 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:13:41,770 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:13:42,392 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:43,316 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:13:43,573 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:13:43,977 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:13:45,397 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:13:45,676 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:13:46,063 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:13:46,326 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:46,610 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:13:46,852 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:13:47,219 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:13:47,864 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:13:48,279 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:13:48,525 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:13:48,755 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:13:49,083 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:13:49,472 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:13:49,964 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:14:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:23,626 INFO L93 Difference]: Finished difference Result 4722492 states and 5999207 transitions. [2019-09-10 08:14:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:14:23,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 166 [2019-09-10 08:14:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:32,584 INFO L225 Difference]: With dead ends: 4722492 [2019-09-10 08:14:32,585 INFO L226 Difference]: Without dead ends: 4722492 [2019-09-10 08:14:32,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 289 SyntacticMatches, 30 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=1174, Invalid=2986, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:14:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722492 states.