java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:13:24,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:13:24,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:13:24,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:13:24,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:13:24,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:13:24,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:13:24,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:13:24,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:13:24,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:13:24,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:13:24,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:13:24,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:13:24,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:13:24,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:13:24,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:13:24,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:13:24,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:13:24,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:13:24,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:13:24,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:13:24,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:13:24,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:13:24,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:13:24,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:13:24,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:13:24,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:13:24,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:13:24,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:13:24,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:13:24,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:13:24,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:13:24,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:13:24,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:13:24,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:13:24,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:13:24,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:13:24,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:13:24,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:13:24,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:13:24,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:13:24,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:13:24,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:13:24,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:13:24,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:13:24,684 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:13:24,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:13:24,685 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:13:24,686 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:13:24,686 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:13:24,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:13:24,686 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:13:24,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:13:24,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:13:24,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:13:24,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:13:24,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:13:24,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:13:24,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:13:24,690 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:13:24,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:13:24,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:13:24,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:13:24,691 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:13:24,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:13:24,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:24,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:13:24,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:13:24,693 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:13:24,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:13:24,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:13:24,693 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:13:24,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:13:24,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:13:24,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:13:24,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:13:24,778 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:13:24,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:13:24,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045772306/57e74a23cfd84529a4f6e05fd54e503a/FLAG85f2909ca [2019-09-10 07:13:25,893 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:13:25,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:13:25,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045772306/57e74a23cfd84529a4f6e05fd54e503a/FLAG85f2909ca [2019-09-10 07:13:26,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045772306/57e74a23cfd84529a4f6e05fd54e503a [2019-09-10 07:13:26,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:13:26,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:13:26,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:26,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:13:26,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:13:26,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:26" (1/1) ... [2019-09-10 07:13:26,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5599da21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:26, skipping insertion in model container [2019-09-10 07:13:26,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:26" (1/1) ... [2019-09-10 07:13:26,154 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:13:26,524 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:13:29,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:29,728 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:13:31,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:31,547 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:13:31,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31 WrapperNode [2019-09-10 07:13:31,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:31,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:13:31,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:13:31,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:13:31,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:31,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:31,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:31,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:31,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:31,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:32,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... [2019-09-10 07:13:32,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:13:32,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:13:32,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:13:32,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:13:32,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:32,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:13:32,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:13:32,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:13:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:13:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:13:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:13:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:13:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:13:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:13:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:13:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:13:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:13:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:13:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:13:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:13:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:13:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:13:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:13:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:13:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:13:32,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:13:45,202 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:13:45,203 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:13:45,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:45 BoogieIcfgContainer [2019-09-10 07:13:45,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:13:45,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:13:45,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:13:45,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:13:45,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:13:26" (1/3) ... [2019-09-10 07:13:45,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95a644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:45, skipping insertion in model container [2019-09-10 07:13:45,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:31" (2/3) ... [2019-09-10 07:13:45,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95a644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:45, skipping insertion in model container [2019-09-10 07:13:45,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:45" (3/3) ... [2019-09-10 07:13:45,216 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:13:45,226 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:13:45,237 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-09-10 07:13:45,254 INFO L252 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-09-10 07:13:45,282 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:13:45,282 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:13:45,282 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:13:45,282 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:13:45,282 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:13:45,282 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:13:45,283 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:13:45,283 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:13:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states. [2019-09-10 07:13:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:45,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:45,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:45,429 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1291767050, now seen corresponding path program 1 times [2019-09-10 07:13:45,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:46,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:46,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:46,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:46,338 INFO L87 Difference]: Start difference. First operand 6188 states. Second operand 5 states. [2019-09-10 07:13:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:53,037 INFO L93 Difference]: Finished difference Result 5831 states and 10300 transitions. [2019-09-10 07:13:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:53,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 07:13:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:53,123 INFO L225 Difference]: With dead ends: 5831 [2019-09-10 07:13:53,124 INFO L226 Difference]: Without dead ends: 5819 [2019-09-10 07:13:53,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2019-09-10 07:13:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5789. [2019-09-10 07:13:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5789 states. [2019-09-10 07:13:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7691 transitions. [2019-09-10 07:13:53,475 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7691 transitions. Word has length 81 [2019-09-10 07:13:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:53,478 INFO L475 AbstractCegarLoop]: Abstraction has 5789 states and 7691 transitions. [2019-09-10 07:13:53,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7691 transitions. [2019-09-10 07:13:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:13:53,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:53,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:53,509 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash -801511020, now seen corresponding path program 1 times [2019-09-10 07:13:53,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:53,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:54,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:54,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:13:54,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:54,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:13:54,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:13:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:13:54,069 INFO L87 Difference]: Start difference. First operand 5789 states and 7691 transitions. Second operand 9 states. [2019-09-10 07:14:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:07,513 INFO L93 Difference]: Finished difference Result 6477 states and 8667 transitions. [2019-09-10 07:14:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:14:07,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 07:14:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:07,548 INFO L225 Difference]: With dead ends: 6477 [2019-09-10 07:14:07,549 INFO L226 Difference]: Without dead ends: 6477 [2019-09-10 07:14:07,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:14:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6477 states. [2019-09-10 07:14:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6477 to 5789. [2019-09-10 07:14:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5789 states. [2019-09-10 07:14:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7690 transitions. [2019-09-10 07:14:07,710 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7690 transitions. Word has length 82 [2019-09-10 07:14:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:07,711 INFO L475 AbstractCegarLoop]: Abstraction has 5789 states and 7690 transitions. [2019-09-10 07:14:07,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7690 transitions. [2019-09-10 07:14:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:14:07,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:07,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:07,726 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1546143278, now seen corresponding path program 1 times [2019-09-10 07:14:07,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:07,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:07,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:07,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:07,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:07,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:07,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:07,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:07,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:07,937 INFO L87 Difference]: Start difference. First operand 5789 states and 7690 transitions. Second operand 5 states. [2019-09-10 07:14:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:14,318 INFO L93 Difference]: Finished difference Result 7764 states and 10350 transitions. [2019-09-10 07:14:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:14,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 07:14:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:14,354 INFO L225 Difference]: With dead ends: 7764 [2019-09-10 07:14:14,355 INFO L226 Difference]: Without dead ends: 7764 [2019-09-10 07:14:14,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2019-09-10 07:14:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 7740. [2019-09-10 07:14:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7740 states. [2019-09-10 07:14:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7740 states to 7740 states and 10337 transitions. [2019-09-10 07:14:14,508 INFO L78 Accepts]: Start accepts. Automaton has 7740 states and 10337 transitions. Word has length 82 [2019-09-10 07:14:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:14,509 INFO L475 AbstractCegarLoop]: Abstraction has 7740 states and 10337 transitions. [2019-09-10 07:14:14,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:14:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7740 states and 10337 transitions. [2019-09-10 07:14:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:14:14,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:14,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:14,526 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 517430368, now seen corresponding path program 1 times [2019-09-10 07:14:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:14,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:15,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:15,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:14:15,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:15,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:14:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:14:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:14:15,152 INFO L87 Difference]: Start difference. First operand 7740 states and 10337 transitions. Second operand 12 states. [2019-09-10 07:14:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:23,168 INFO L93 Difference]: Finished difference Result 18453 states and 26234 transitions. [2019-09-10 07:14:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:14:23,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 07:14:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:23,225 INFO L225 Difference]: With dead ends: 18453 [2019-09-10 07:14:23,225 INFO L226 Difference]: Without dead ends: 18453 [2019-09-10 07:14:23,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:14:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18453 states. [2019-09-10 07:14:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18453 to 7703. [2019-09-10 07:14:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-09-10 07:14:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10287 transitions. [2019-09-10 07:14:23,458 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10287 transitions. Word has length 83 [2019-09-10 07:14:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 7703 states and 10287 transitions. [2019-09-10 07:14:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:14:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10287 transitions. [2019-09-10 07:14:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:14:23,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:23,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:23,481 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1731159645, now seen corresponding path program 1 times [2019-09-10 07:14:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:23,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:23,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:23,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:23,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:23,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:23,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:23,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:23,681 INFO L87 Difference]: Start difference. First operand 7703 states and 10287 transitions. Second operand 5 states. [2019-09-10 07:14:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:29,439 INFO L93 Difference]: Finished difference Result 9708 states and 12853 transitions. [2019-09-10 07:14:29,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:29,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:14:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:29,460 INFO L225 Difference]: With dead ends: 9708 [2019-09-10 07:14:29,461 INFO L226 Difference]: Without dead ends: 9708 [2019-09-10 07:14:29,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states. [2019-09-10 07:14:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 9682. [2019-09-10 07:14:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-09-10 07:14:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 12837 transitions. [2019-09-10 07:14:29,638 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 12837 transitions. Word has length 83 [2019-09-10 07:14:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:29,640 INFO L475 AbstractCegarLoop]: Abstraction has 9682 states and 12837 transitions. [2019-09-10 07:14:29,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:14:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 12837 transitions. [2019-09-10 07:14:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:14:29,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:29,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:29,661 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash 960563928, now seen corresponding path program 1 times [2019-09-10 07:14:29,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:29,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:29,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:29,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:29,867 INFO L87 Difference]: Start difference. First operand 9682 states and 12837 transitions. Second operand 5 states. [2019-09-10 07:14:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:34,329 INFO L93 Difference]: Finished difference Result 11635 states and 15701 transitions. [2019-09-10 07:14:34,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:34,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:14:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:34,351 INFO L225 Difference]: With dead ends: 11635 [2019-09-10 07:14:34,352 INFO L226 Difference]: Without dead ends: 11635 [2019-09-10 07:14:34,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11635 states. [2019-09-10 07:14:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11635 to 11606. [2019-09-10 07:14:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11606 states. [2019-09-10 07:14:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11606 states to 11606 states and 15682 transitions. [2019-09-10 07:14:34,551 INFO L78 Accepts]: Start accepts. Automaton has 11606 states and 15682 transitions. Word has length 83 [2019-09-10 07:14:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:34,555 INFO L475 AbstractCegarLoop]: Abstraction has 11606 states and 15682 transitions. [2019-09-10 07:14:34,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:14:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 11606 states and 15682 transitions. [2019-09-10 07:14:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:14:34,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:34,577 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 07:14:34,587 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -738216084, now seen corresponding path program 1 times [2019-09-10 07:14:34,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:34,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:34,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:14:34,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:34,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:14:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:14:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:14:34,823 INFO L87 Difference]: Start difference. First operand 11606 states and 15682 transitions. Second operand 6 states. [2019-09-10 07:14:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:39,613 INFO L93 Difference]: Finished difference Result 19477 states and 26510 transitions. [2019-09-10 07:14:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:39,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:14:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:39,645 INFO L225 Difference]: With dead ends: 19477 [2019-09-10 07:14:39,645 INFO L226 Difference]: Without dead ends: 19477 [2019-09-10 07:14:39,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:14:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19477 states. [2019-09-10 07:14:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19477 to 19445. [2019-09-10 07:14:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19445 states. [2019-09-10 07:14:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19445 states to 19445 states and 26492 transitions. [2019-09-10 07:14:39,985 INFO L78 Accepts]: Start accepts. Automaton has 19445 states and 26492 transitions. Word has length 84 [2019-09-10 07:14:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:39,985 INFO L475 AbstractCegarLoop]: Abstraction has 19445 states and 26492 transitions. [2019-09-10 07:14:39,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:14:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19445 states and 26492 transitions. [2019-09-10 07:14:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:14:40,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:40,003 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 07:14:40,004 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1264971505, now seen corresponding path program 1 times [2019-09-10 07:14:40,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:40,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:40,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:40,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:40,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:40,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:40,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:40,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:40,349 INFO L87 Difference]: Start difference. First operand 19445 states and 26492 transitions. Second operand 10 states. [2019-09-10 07:14:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:53,457 INFO L93 Difference]: Finished difference Result 52628 states and 76434 transitions. [2019-09-10 07:14:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:14:53,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-09-10 07:14:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:53,517 INFO L225 Difference]: With dead ends: 52628 [2019-09-10 07:14:53,518 INFO L226 Difference]: Without dead ends: 52628 [2019-09-10 07:14:53,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:14:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52628 states. [2019-09-10 07:14:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52628 to 19452. [2019-09-10 07:14:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-09-10 07:14:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 26499 transitions. [2019-09-10 07:14:54,301 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 26499 transitions. Word has length 84 [2019-09-10 07:14:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:54,302 INFO L475 AbstractCegarLoop]: Abstraction has 19452 states and 26499 transitions. [2019-09-10 07:14:54,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 26499 transitions. [2019-09-10 07:14:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:14:54,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:54,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:54,320 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash -150978572, now seen corresponding path program 1 times [2019-09-10 07:14:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:54,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:54,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:55,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:55,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:14:55,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:55,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:14:55,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:14:55,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:55,135 INFO L87 Difference]: Start difference. First operand 19452 states and 26499 transitions. Second operand 15 states. [2019-09-10 07:14:56,017 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:14:58,727 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:15:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:06,051 INFO L93 Difference]: Finished difference Result 57185 states and 83185 transitions. [2019-09-10 07:15:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:15:06,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-10 07:15:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:06,119 INFO L225 Difference]: With dead ends: 57185 [2019-09-10 07:15:06,120 INFO L226 Difference]: Without dead ends: 57185 [2019-09-10 07:15:06,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:15:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57185 states. [2019-09-10 07:15:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57185 to 19448. [2019-09-10 07:15:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-10 07:15:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26494 transitions. [2019-09-10 07:15:06,599 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26494 transitions. Word has length 85 [2019-09-10 07:15:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:06,599 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26494 transitions. [2019-09-10 07:15:06,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:15:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26494 transitions. [2019-09-10 07:15:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:15:06,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:06,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:06,614 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -131175961, now seen corresponding path program 1 times [2019-09-10 07:15:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:06,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:06,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:06,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:06,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:06,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:06,860 INFO L87 Difference]: Start difference. First operand 19448 states and 26494 transitions. Second operand 9 states. [2019-09-10 07:15:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:15,126 INFO L93 Difference]: Finished difference Result 29394 states and 41040 transitions. [2019-09-10 07:15:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:15:15,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:15:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:15,162 INFO L225 Difference]: With dead ends: 29394 [2019-09-10 07:15:15,162 INFO L226 Difference]: Without dead ends: 29394 [2019-09-10 07:15:15,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:15:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29394 states. [2019-09-10 07:15:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29394 to 19448. [2019-09-10 07:15:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-10 07:15:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26493 transitions. [2019-09-10 07:15:15,736 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26493 transitions. Word has length 85 [2019-09-10 07:15:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:15,736 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26493 transitions. [2019-09-10 07:15:15,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26493 transitions. [2019-09-10 07:15:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:15:15,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:15,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:15,746 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1225382710, now seen corresponding path program 1 times [2019-09-10 07:15:15,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:15,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:15,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 07:15:15,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:15,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:15,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:15,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:15,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:15,981 INFO L87 Difference]: Start difference. First operand 19448 states and 26493 transitions. Second operand 9 states. [2019-09-10 07:15:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:24,664 INFO L93 Difference]: Finished difference Result 30571 states and 43080 transitions. [2019-09-10 07:15:24,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:15:24,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 07:15:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:24,693 INFO L225 Difference]: With dead ends: 30571 [2019-09-10 07:15:24,693 INFO L226 Difference]: Without dead ends: 30571 [2019-09-10 07:15:24,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:15:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30571 states. [2019-09-10 07:15:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30571 to 19448. [2019-09-10 07:15:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-10 07:15:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26491 transitions. [2019-09-10 07:15:24,958 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26491 transitions. Word has length 86 [2019-09-10 07:15:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:24,958 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26491 transitions. [2019-09-10 07:15:24,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26491 transitions. [2019-09-10 07:15:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:15:24,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:24,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:24,967 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash 337059138, now seen corresponding path program 1 times [2019-09-10 07:15:24,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:24,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:24,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:25,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:25,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:25,283 INFO L87 Difference]: Start difference. First operand 19448 states and 26491 transitions. Second operand 10 states. [2019-09-10 07:15:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:38,585 INFO L93 Difference]: Finished difference Result 52603 states and 76345 transitions. [2019-09-10 07:15:38,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:15:38,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-09-10 07:15:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:38,640 INFO L225 Difference]: With dead ends: 52603 [2019-09-10 07:15:38,640 INFO L226 Difference]: Without dead ends: 52603 [2019-09-10 07:15:38,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:15:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52603 states. [2019-09-10 07:15:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52603 to 19455. [2019-09-10 07:15:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-09-10 07:15:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 26498 transitions. [2019-09-10 07:15:39,079 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 26498 transitions. Word has length 86 [2019-09-10 07:15:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 19455 states and 26498 transitions. [2019-09-10 07:15:39,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 26498 transitions. [2019-09-10 07:15:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:15:39,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:39,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:39,090 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -197149534, now seen corresponding path program 1 times [2019-09-10 07:15:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:39,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:39,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:39,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:39,375 INFO L87 Difference]: Start difference. First operand 19455 states and 26498 transitions. Second operand 10 states. [2019-09-10 07:15:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:53,500 INFO L93 Difference]: Finished difference Result 45805 states and 66072 transitions. [2019-09-10 07:15:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:15:53,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-09-10 07:15:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:53,556 INFO L225 Difference]: With dead ends: 45805 [2019-09-10 07:15:53,556 INFO L226 Difference]: Without dead ends: 45805 [2019-09-10 07:15:53,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:15:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45805 states. [2019-09-10 07:15:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45805 to 19406. [2019-09-10 07:15:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19406 states. [2019-09-10 07:15:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 26428 transitions. [2019-09-10 07:15:54,029 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 26428 transitions. Word has length 86 [2019-09-10 07:15:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:54,029 INFO L475 AbstractCegarLoop]: Abstraction has 19406 states and 26428 transitions. [2019-09-10 07:15:54,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 26428 transitions. [2019-09-10 07:15:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:15:54,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:54,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:54,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -259498320, now seen corresponding path program 1 times [2019-09-10 07:15:54,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:54,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:54,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:54,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:54,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:54,562 INFO L87 Difference]: Start difference. First operand 19406 states and 26428 transitions. Second operand 13 states. [2019-09-10 07:15:55,017 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:15:55,154 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:15:55,356 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:15:55,877 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:15:56,300 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 07:15:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:59,592 INFO L93 Difference]: Finished difference Result 45023 states and 65259 transitions. [2019-09-10 07:15:59,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:15:59,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-09-10 07:15:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:59,636 INFO L225 Difference]: With dead ends: 45023 [2019-09-10 07:15:59,637 INFO L226 Difference]: Without dead ends: 45023 [2019-09-10 07:15:59,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45023 states. [2019-09-10 07:16:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45023 to 19374. [2019-09-10 07:16:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-10 07:16:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26389 transitions. [2019-09-10 07:16:00,176 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26389 transitions. Word has length 86 [2019-09-10 07:16:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:00,176 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26389 transitions. [2019-09-10 07:16:00,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:16:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26389 transitions. [2019-09-10 07:16:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:00,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:00,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:00,190 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1761274596, now seen corresponding path program 1 times [2019-09-10 07:16:00,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:00,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:00,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:00,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:00,416 INFO L87 Difference]: Start difference. First operand 19374 states and 26389 transitions. Second operand 9 states. [2019-09-10 07:16:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:10,483 INFO L93 Difference]: Finished difference Result 40718 states and 58445 transitions. [2019-09-10 07:16:10,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:16:10,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:16:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:10,526 INFO L225 Difference]: With dead ends: 40718 [2019-09-10 07:16:10,526 INFO L226 Difference]: Without dead ends: 40718 [2019-09-10 07:16:10,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:16:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40718 states. [2019-09-10 07:16:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40718 to 19374. [2019-09-10 07:16:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-10 07:16:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26387 transitions. [2019-09-10 07:16:10,887 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26387 transitions. Word has length 87 [2019-09-10 07:16:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:10,887 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26387 transitions. [2019-09-10 07:16:10,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26387 transitions. [2019-09-10 07:16:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:10,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:10,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:10,901 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash -973081306, now seen corresponding path program 1 times [2019-09-10 07:16:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:10,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:10,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:10,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:11,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:11,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:11,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:11,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:11,208 INFO L87 Difference]: Start difference. First operand 19374 states and 26387 transitions. Second operand 9 states. [2019-09-10 07:16:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:21,068 INFO L93 Difference]: Finished difference Result 45048 states and 65923 transitions. [2019-09-10 07:16:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:16:21,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:16:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:21,107 INFO L225 Difference]: With dead ends: 45048 [2019-09-10 07:16:21,107 INFO L226 Difference]: Without dead ends: 45048 [2019-09-10 07:16:21,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:16:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45048 states. [2019-09-10 07:16:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45048 to 19374. [2019-09-10 07:16:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-10 07:16:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26385 transitions. [2019-09-10 07:16:21,397 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26385 transitions. Word has length 87 [2019-09-10 07:16:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:21,397 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26385 transitions. [2019-09-10 07:16:21,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26385 transitions. [2019-09-10 07:16:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:21,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:21,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:21,406 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash -618593868, now seen corresponding path program 1 times [2019-09-10 07:16:21,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:21,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:21,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:21,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:16:21,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:21,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:16:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:16:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:16:21,811 INFO L87 Difference]: Start difference. First operand 19374 states and 26385 transitions. Second operand 12 states. [2019-09-10 07:16:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:28,656 INFO L93 Difference]: Finished difference Result 45578 states and 65752 transitions. [2019-09-10 07:16:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:16:28,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 07:16:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:28,699 INFO L225 Difference]: With dead ends: 45578 [2019-09-10 07:16:28,699 INFO L226 Difference]: Without dead ends: 45578 [2019-09-10 07:16:28,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:16:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45578 states. [2019-09-10 07:16:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45578 to 19370. [2019-09-10 07:16:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-10 07:16:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26381 transitions. [2019-09-10 07:16:29,302 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26381 transitions. Word has length 87 [2019-09-10 07:16:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:29,303 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26381 transitions. [2019-09-10 07:16:29,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:16:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26381 transitions. [2019-09-10 07:16:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:29,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:29,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:29,314 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 933067154, now seen corresponding path program 1 times [2019-09-10 07:16:29,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:29,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:29,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:29,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:29,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:29,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:29,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:29,567 INFO L87 Difference]: Start difference. First operand 19370 states and 26381 transitions. Second operand 9 states. [2019-09-10 07:16:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:38,071 INFO L93 Difference]: Finished difference Result 31697 states and 45222 transitions. [2019-09-10 07:16:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:16:38,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:16:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:38,102 INFO L225 Difference]: With dead ends: 31697 [2019-09-10 07:16:38,102 INFO L226 Difference]: Without dead ends: 31697 [2019-09-10 07:16:38,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:16:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31697 states. [2019-09-10 07:16:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31697 to 19370. [2019-09-10 07:16:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-10 07:16:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26380 transitions. [2019-09-10 07:16:38,561 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26380 transitions. Word has length 87 [2019-09-10 07:16:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:38,562 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26380 transitions. [2019-09-10 07:16:38,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26380 transitions. [2019-09-10 07:16:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:38,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:38,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:38,573 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash 259041370, now seen corresponding path program 1 times [2019-09-10 07:16:38,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:38,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:38,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:38,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:38,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:38,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:38,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:38,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:38,783 INFO L87 Difference]: Start difference. First operand 19370 states and 26380 transitions. Second operand 9 states. [2019-09-10 07:16:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:48,520 INFO L93 Difference]: Finished difference Result 45044 states and 65917 transitions. [2019-09-10 07:16:48,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:16:48,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:16:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:48,567 INFO L225 Difference]: With dead ends: 45044 [2019-09-10 07:16:48,567 INFO L226 Difference]: Without dead ends: 45044 [2019-09-10 07:16:48,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:16:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45044 states. [2019-09-10 07:16:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45044 to 19370. [2019-09-10 07:16:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-10 07:16:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26379 transitions. [2019-09-10 07:16:49,148 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26379 transitions. Word has length 87 [2019-09-10 07:16:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:49,148 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26379 transitions. [2019-09-10 07:16:49,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26379 transitions. [2019-09-10 07:16:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:49,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:49,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:49,158 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2069024480, now seen corresponding path program 1 times [2019-09-10 07:16:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:49,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:49,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:49,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:49,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:49,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:49,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:49,353 INFO L87 Difference]: Start difference. First operand 19370 states and 26379 transitions. Second operand 9 states. [2019-09-10 07:16:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:58,017 INFO L93 Difference]: Finished difference Result 40709 states and 58431 transitions. [2019-09-10 07:16:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:16:58,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:16:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:58,053 INFO L225 Difference]: With dead ends: 40709 [2019-09-10 07:16:58,053 INFO L226 Difference]: Without dead ends: 40709 [2019-09-10 07:16:58,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:16:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40709 states. [2019-09-10 07:16:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40709 to 19370. [2019-09-10 07:16:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-10 07:16:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26378 transitions. [2019-09-10 07:16:58,379 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26378 transitions. Word has length 87 [2019-09-10 07:16:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:58,380 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26378 transitions. [2019-09-10 07:16:58,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26378 transitions. [2019-09-10 07:16:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:58,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:58,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:58,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 198764564, now seen corresponding path program 1 times [2019-09-10 07:16:58,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:58,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:58,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:58,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:58,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:58,617 INFO L87 Difference]: Start difference. First operand 19370 states and 26378 transitions. Second operand 10 states. [2019-09-10 07:17:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:12,913 INFO L93 Difference]: Finished difference Result 45769 states and 66021 transitions. [2019-09-10 07:17:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:17:12,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:17:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:12,957 INFO L225 Difference]: With dead ends: 45769 [2019-09-10 07:17:12,957 INFO L226 Difference]: Without dead ends: 45769 [2019-09-10 07:17:12,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:17:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45769 states. [2019-09-10 07:17:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45769 to 19370. [2019-09-10 07:17:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-10 07:17:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26377 transitions. [2019-09-10 07:17:13,404 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26377 transitions. Word has length 87 [2019-09-10 07:17:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:13,404 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26377 transitions. [2019-09-10 07:17:13,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:17:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26377 transitions. [2019-09-10 07:17:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:13,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:13,413 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 07:17:13,414 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 546832817, now seen corresponding path program 1 times [2019-09-10 07:17:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:13,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:13,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:13,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:13,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:13,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:13,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:13,521 INFO L87 Difference]: Start difference. First operand 19370 states and 26377 transitions. Second operand 3 states. [2019-09-10 07:17:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:13,789 INFO L93 Difference]: Finished difference Result 18806 states and 26113 transitions. [2019-09-10 07:17:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:13,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:13,812 INFO L225 Difference]: With dead ends: 18806 [2019-09-10 07:17:13,812 INFO L226 Difference]: Without dead ends: 18806 [2019-09-10 07:17:13,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18806 states. [2019-09-10 07:17:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18806 to 18792. [2019-09-10 07:17:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-09-10 07:17:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 26106 transitions. [2019-09-10 07:17:13,971 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 26106 transitions. Word has length 88 [2019-09-10 07:17:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:13,971 INFO L475 AbstractCegarLoop]: Abstraction has 18792 states and 26106 transitions. [2019-09-10 07:17:13,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 26106 transitions. [2019-09-10 07:17:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:13,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:13,979 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 07:17:13,979 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash -382656533, now seen corresponding path program 1 times [2019-09-10 07:17:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:13,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:13,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:14,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:14,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:14,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:14,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:14,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:14,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:14,091 INFO L87 Difference]: Start difference. First operand 18792 states and 26106 transitions. Second operand 3 states. [2019-09-10 07:17:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:14,329 INFO L93 Difference]: Finished difference Result 29350 states and 41183 transitions. [2019-09-10 07:17:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:14,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:14,362 INFO L225 Difference]: With dead ends: 29350 [2019-09-10 07:17:14,362 INFO L226 Difference]: Without dead ends: 29350 [2019-09-10 07:17:14,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29350 states. [2019-09-10 07:17:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29350 to 29336. [2019-09-10 07:17:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29336 states. [2019-09-10 07:17:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29336 states to 29336 states and 41176 transitions. [2019-09-10 07:17:14,609 INFO L78 Accepts]: Start accepts. Automaton has 29336 states and 41176 transitions. Word has length 88 [2019-09-10 07:17:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:14,609 INFO L475 AbstractCegarLoop]: Abstraction has 29336 states and 41176 transitions. [2019-09-10 07:17:14,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29336 states and 41176 transitions. [2019-09-10 07:17:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:14,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:14,620 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 07:17:14,621 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1486761653, now seen corresponding path program 1 times [2019-09-10 07:17:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:14,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:14,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:14,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:14,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:14,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:14,751 INFO L87 Difference]: Start difference. First operand 29336 states and 41176 transitions. Second operand 3 states. [2019-09-10 07:17:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:15,078 INFO L93 Difference]: Finished difference Result 48063 states and 67627 transitions. [2019-09-10 07:17:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:15,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:15,120 INFO L225 Difference]: With dead ends: 48063 [2019-09-10 07:17:15,120 INFO L226 Difference]: Without dead ends: 48063 [2019-09-10 07:17:15,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48063 states. [2019-09-10 07:17:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48063 to 48034. [2019-09-10 07:17:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-09-10 07:17:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 67607 transitions. [2019-09-10 07:17:15,549 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 67607 transitions. Word has length 88 [2019-09-10 07:17:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:15,550 INFO L475 AbstractCegarLoop]: Abstraction has 48034 states and 67607 transitions. [2019-09-10 07:17:15,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 67607 transitions. [2019-09-10 07:17:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:15,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:15,565 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 07:17:15,566 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1651671834, now seen corresponding path program 1 times [2019-09-10 07:17:15,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:15,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:15,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:15,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:15,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:15,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:15,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:15,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:15,683 INFO L87 Difference]: Start difference. First operand 48034 states and 67607 transitions. Second operand 3 states. [2019-09-10 07:17:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:15,899 INFO L93 Difference]: Finished difference Result 57590 states and 82152 transitions. [2019-09-10 07:17:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:15,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:15,968 INFO L225 Difference]: With dead ends: 57590 [2019-09-10 07:17:15,969 INFO L226 Difference]: Without dead ends: 57590 [2019-09-10 07:17:15,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57590 states. [2019-09-10 07:17:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57590 to 46535. [2019-09-10 07:17:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46535 states. [2019-09-10 07:17:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46535 states to 46535 states and 66215 transitions. [2019-09-10 07:17:16,408 INFO L78 Accepts]: Start accepts. Automaton has 46535 states and 66215 transitions. Word has length 88 [2019-09-10 07:17:16,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:16,408 INFO L475 AbstractCegarLoop]: Abstraction has 46535 states and 66215 transitions. [2019-09-10 07:17:16,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 46535 states and 66215 transitions. [2019-09-10 07:17:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:16,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:16,420 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 07:17:16,421 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1164909041, now seen corresponding path program 1 times [2019-09-10 07:17:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:16,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:16,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:16,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:16,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:16,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:16,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:16,524 INFO L87 Difference]: Start difference. First operand 46535 states and 66215 transitions. Second operand 3 states. [2019-09-10 07:17:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:17,058 INFO L93 Difference]: Finished difference Result 47063 states and 68240 transitions. [2019-09-10 07:17:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:17,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:17,099 INFO L225 Difference]: With dead ends: 47063 [2019-09-10 07:17:17,099 INFO L226 Difference]: Without dead ends: 47063 [2019-09-10 07:17:17,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47063 states. [2019-09-10 07:17:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47063 to 38475. [2019-09-10 07:17:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38475 states. [2019-09-10 07:17:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38475 states to 38475 states and 55708 transitions. [2019-09-10 07:17:17,428 INFO L78 Accepts]: Start accepts. Automaton has 38475 states and 55708 transitions. Word has length 88 [2019-09-10 07:17:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:17,428 INFO L475 AbstractCegarLoop]: Abstraction has 38475 states and 55708 transitions. [2019-09-10 07:17:17,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 38475 states and 55708 transitions. [2019-09-10 07:17:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:17,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:17,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:17,437 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 860766840, now seen corresponding path program 1 times [2019-09-10 07:17:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:17,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:17,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:17,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:17,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:17:17,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:17,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:17:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:17:17,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:17:17,936 INFO L87 Difference]: Start difference. First operand 38475 states and 55708 transitions. Second operand 13 states. [2019-09-10 07:17:18,418 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:17:18,602 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:17:19,460 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 07:17:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:22,184 INFO L93 Difference]: Finished difference Result 119299 states and 176983 transitions. [2019-09-10 07:17:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:17:22,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-10 07:17:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:22,317 INFO L225 Difference]: With dead ends: 119299 [2019-09-10 07:17:22,317 INFO L226 Difference]: Without dead ends: 119299 [2019-09-10 07:17:22,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:17:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119299 states. [2019-09-10 07:17:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119299 to 38462. [2019-09-10 07:17:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38462 states. [2019-09-10 07:17:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38462 states to 38462 states and 55695 transitions. [2019-09-10 07:17:23,136 INFO L78 Accepts]: Start accepts. Automaton has 38462 states and 55695 transitions. Word has length 88 [2019-09-10 07:17:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:23,136 INFO L475 AbstractCegarLoop]: Abstraction has 38462 states and 55695 transitions. [2019-09-10 07:17:23,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:17:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38462 states and 55695 transitions. [2019-09-10 07:17:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:23,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:23,144 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 07:17:23,145 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1288774228, now seen corresponding path program 1 times [2019-09-10 07:17:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:23,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:23,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:23,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:17:23,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:23,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:17:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:17:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:23,344 INFO L87 Difference]: Start difference. First operand 38462 states and 55695 transitions. Second operand 9 states. [2019-09-10 07:17:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:31,300 INFO L93 Difference]: Finished difference Result 91966 states and 135542 transitions. [2019-09-10 07:17:31,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:17:31,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:17:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:31,417 INFO L225 Difference]: With dead ends: 91966 [2019-09-10 07:17:31,417 INFO L226 Difference]: Without dead ends: 91966 [2019-09-10 07:17:31,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:17:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91966 states. [2019-09-10 07:17:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91966 to 38446. [2019-09-10 07:17:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38446 states. [2019-09-10 07:17:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38446 states to 38446 states and 55671 transitions. [2019-09-10 07:17:32,036 INFO L78 Accepts]: Start accepts. Automaton has 38446 states and 55671 transitions. Word has length 88 [2019-09-10 07:17:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:32,036 INFO L475 AbstractCegarLoop]: Abstraction has 38446 states and 55671 transitions. [2019-09-10 07:17:32,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:17:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38446 states and 55671 transitions. [2019-09-10 07:17:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:17:32,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:32,046 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 07:17:32,046 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1923738534, now seen corresponding path program 1 times [2019-09-10 07:17:32,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:32,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:32,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:32,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:32,157 INFO L87 Difference]: Start difference. First operand 38446 states and 55671 transitions. Second operand 3 states. [2019-09-10 07:17:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:32,456 INFO L93 Difference]: Finished difference Result 66365 states and 96336 transitions. [2019-09-10 07:17:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:32,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:17:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:32,528 INFO L225 Difference]: With dead ends: 66365 [2019-09-10 07:17:32,528 INFO L226 Difference]: Without dead ends: 66365 [2019-09-10 07:17:32,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66365 states. [2019-09-10 07:17:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66365 to 57191. [2019-09-10 07:17:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57191 states. [2019-09-10 07:17:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57191 states to 57191 states and 82624 transitions. [2019-09-10 07:17:33,123 INFO L78 Accepts]: Start accepts. Automaton has 57191 states and 82624 transitions. Word has length 88 [2019-09-10 07:17:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:33,124 INFO L475 AbstractCegarLoop]: Abstraction has 57191 states and 82624 transitions. [2019-09-10 07:17:33,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 57191 states and 82624 transitions. [2019-09-10 07:17:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:17:33,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:33,136 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 07:17:33,137 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -556215029, now seen corresponding path program 1 times [2019-09-10 07:17:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:33,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:33,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:33,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:33,233 INFO L87 Difference]: Start difference. First operand 57191 states and 82624 transitions. Second operand 3 states. [2019-09-10 07:17:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:33,747 INFO L93 Difference]: Finished difference Result 64695 states and 94358 transitions. [2019-09-10 07:17:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:33,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:17:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:33,817 INFO L225 Difference]: With dead ends: 64695 [2019-09-10 07:17:33,817 INFO L226 Difference]: Without dead ends: 64695 [2019-09-10 07:17:33,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64695 states. [2019-09-10 07:17:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64695 to 51718. [2019-09-10 07:17:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51718 states. [2019-09-10 07:17:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51718 states to 51718 states and 75528 transitions. [2019-09-10 07:17:34,336 INFO L78 Accepts]: Start accepts. Automaton has 51718 states and 75528 transitions. Word has length 89 [2019-09-10 07:17:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:34,337 INFO L475 AbstractCegarLoop]: Abstraction has 51718 states and 75528 transitions. [2019-09-10 07:17:34,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 51718 states and 75528 transitions. [2019-09-10 07:17:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:17:34,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:34,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:34,345 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1120036254, now seen corresponding path program 1 times [2019-09-10 07:17:34,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:34,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:34,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:34,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:17:34,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:34,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:17:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:17:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:17:34,614 INFO L87 Difference]: Start difference. First operand 51718 states and 75528 transitions. Second operand 10 states. [2019-09-10 07:17:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:45,367 INFO L93 Difference]: Finished difference Result 189633 states and 280097 transitions. [2019-09-10 07:17:45,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:17:45,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:17:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:45,600 INFO L225 Difference]: With dead ends: 189633 [2019-09-10 07:17:45,600 INFO L226 Difference]: Without dead ends: 189633 [2019-09-10 07:17:45,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:17:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189633 states. [2019-09-10 07:17:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189633 to 51689. [2019-09-10 07:17:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51689 states. [2019-09-10 07:17:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51689 states to 51689 states and 75489 transitions. [2019-09-10 07:17:47,216 INFO L78 Accepts]: Start accepts. Automaton has 51689 states and 75489 transitions. Word has length 89 [2019-09-10 07:17:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:47,217 INFO L475 AbstractCegarLoop]: Abstraction has 51689 states and 75489 transitions. [2019-09-10 07:17:47,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:17:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 51689 states and 75489 transitions. [2019-09-10 07:17:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:17:47,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:47,225 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 07:17:47,225 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash 79328490, now seen corresponding path program 1 times [2019-09-10 07:17:47,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:47,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:47,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:47,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:47,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:17:47,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:47,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:17:47,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:17:47,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:17:47,476 INFO L87 Difference]: Start difference. First operand 51689 states and 75489 transitions. Second operand 10 states. [2019-09-10 07:17:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:56,249 INFO L93 Difference]: Finished difference Result 121054 states and 178232 transitions. [2019-09-10 07:17:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:17:56,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:17:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:56,392 INFO L225 Difference]: With dead ends: 121054 [2019-09-10 07:17:56,392 INFO L226 Difference]: Without dead ends: 121054 [2019-09-10 07:17:56,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:17:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121054 states. [2019-09-10 07:17:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121054 to 51689. [2019-09-10 07:17:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51689 states. [2019-09-10 07:17:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51689 states to 51689 states and 75488 transitions. [2019-09-10 07:17:59,080 INFO L78 Accepts]: Start accepts. Automaton has 51689 states and 75488 transitions. Word has length 89 [2019-09-10 07:17:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:59,081 INFO L475 AbstractCegarLoop]: Abstraction has 51689 states and 75488 transitions. [2019-09-10 07:17:59,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:17:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 51689 states and 75488 transitions. [2019-09-10 07:17:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:17:59,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:59,088 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 07:17:59,089 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2031970327, now seen corresponding path program 1 times [2019-09-10 07:17:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:59,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:59,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:59,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:59,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:59,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:59,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:59,189 INFO L87 Difference]: Start difference. First operand 51689 states and 75488 transitions. Second operand 3 states. [2019-09-10 07:17:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:59,528 INFO L93 Difference]: Finished difference Result 83535 states and 123751 transitions. [2019-09-10 07:17:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:59,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:17:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:59,611 INFO L225 Difference]: With dead ends: 83535 [2019-09-10 07:17:59,611 INFO L226 Difference]: Without dead ends: 83535 [2019-09-10 07:17:59,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83535 states. [2019-09-10 07:18:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83535 to 65343. [2019-09-10 07:18:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65343 states. [2019-09-10 07:18:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65343 states to 65343 states and 96604 transitions. [2019-09-10 07:18:00,270 INFO L78 Accepts]: Start accepts. Automaton has 65343 states and 96604 transitions. Word has length 89 [2019-09-10 07:18:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:00,270 INFO L475 AbstractCegarLoop]: Abstraction has 65343 states and 96604 transitions. [2019-09-10 07:18:00,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65343 states and 96604 transitions. [2019-09-10 07:18:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:00,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:00,276 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 07:18:00,277 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash -548796576, now seen corresponding path program 1 times [2019-09-10 07:18:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:00,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:00,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:18:00,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:00,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:18:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:18:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:18:00,524 INFO L87 Difference]: Start difference. First operand 65343 states and 96604 transitions. Second operand 10 states. [2019-09-10 07:18:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:09,521 INFO L93 Difference]: Finished difference Result 160251 states and 237357 transitions. [2019-09-10 07:18:09,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:18:09,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:18:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:09,725 INFO L225 Difference]: With dead ends: 160251 [2019-09-10 07:18:09,725 INFO L226 Difference]: Without dead ends: 160251 [2019-09-10 07:18:09,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:18:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160251 states. [2019-09-10 07:18:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160251 to 65343. [2019-09-10 07:18:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65343 states. [2019-09-10 07:18:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65343 states to 65343 states and 96603 transitions. [2019-09-10 07:18:10,763 INFO L78 Accepts]: Start accepts. Automaton has 65343 states and 96603 transitions. Word has length 89 [2019-09-10 07:18:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:10,763 INFO L475 AbstractCegarLoop]: Abstraction has 65343 states and 96603 transitions. [2019-09-10 07:18:10,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:18:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 65343 states and 96603 transitions. [2019-09-10 07:18:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:10,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:10,770 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 07:18:10,770 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1907591815, now seen corresponding path program 1 times [2019-09-10 07:18:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:10,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:10,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:10,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:18:10,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:10,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:18:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:18:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:18:10,949 INFO L87 Difference]: Start difference. First operand 65343 states and 96603 transitions. Second operand 9 states. [2019-09-10 07:18:17,343 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-10 07:18:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:17,935 INFO L93 Difference]: Finished difference Result 160319 states and 237481 transitions. [2019-09-10 07:18:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:18:17,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:18:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:18,111 INFO L225 Difference]: With dead ends: 160319 [2019-09-10 07:18:18,112 INFO L226 Difference]: Without dead ends: 160319 [2019-09-10 07:18:18,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:18:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160319 states. [2019-09-10 07:18:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160319 to 65343. [2019-09-10 07:18:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65343 states. [2019-09-10 07:18:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65343 states to 65343 states and 96602 transitions. [2019-09-10 07:18:19,146 INFO L78 Accepts]: Start accepts. Automaton has 65343 states and 96602 transitions. Word has length 89 [2019-09-10 07:18:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:19,147 INFO L475 AbstractCegarLoop]: Abstraction has 65343 states and 96602 transitions. [2019-09-10 07:18:19,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:18:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 65343 states and 96602 transitions. [2019-09-10 07:18:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:19,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:19,152 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 07:18:19,152 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2132150307, now seen corresponding path program 1 times [2019-09-10 07:18:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:19,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:19,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:19,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:18:19,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:19,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:18:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:18:19,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:18:19,388 INFO L87 Difference]: Start difference. First operand 65343 states and 96602 transitions. Second operand 10 states. [2019-09-10 07:18:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:29,803 INFO L93 Difference]: Finished difference Result 254013 states and 376779 transitions. [2019-09-10 07:18:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:18:29,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:18:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:30,100 INFO L225 Difference]: With dead ends: 254013 [2019-09-10 07:18:30,100 INFO L226 Difference]: Without dead ends: 254013 [2019-09-10 07:18:30,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:18:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254013 states. [2019-09-10 07:18:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254013 to 65343. [2019-09-10 07:18:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65343 states. [2019-09-10 07:18:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65343 states to 65343 states and 96601 transitions. [2019-09-10 07:18:31,661 INFO L78 Accepts]: Start accepts. Automaton has 65343 states and 96601 transitions. Word has length 89 [2019-09-10 07:18:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:31,662 INFO L475 AbstractCegarLoop]: Abstraction has 65343 states and 96601 transitions. [2019-09-10 07:18:31,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:18:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 65343 states and 96601 transitions. [2019-09-10 07:18:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:31,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:31,667 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 07:18:31,667 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash 578069868, now seen corresponding path program 1 times [2019-09-10 07:18:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:31,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:31,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:31,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:18:31,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:31,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:18:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:18:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:18:31,845 INFO L87 Difference]: Start difference. First operand 65343 states and 96601 transitions. Second operand 9 states. [2019-09-10 07:18:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:38,529 INFO L93 Difference]: Finished difference Result 148124 states and 219987 transitions. [2019-09-10 07:18:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:18:38,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:18:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:38,690 INFO L225 Difference]: With dead ends: 148124 [2019-09-10 07:18:38,690 INFO L226 Difference]: Without dead ends: 148124 [2019-09-10 07:18:38,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:18:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148124 states. [2019-09-10 07:18:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148124 to 65343. [2019-09-10 07:18:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65343 states. [2019-09-10 07:18:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65343 states to 65343 states and 96600 transitions. [2019-09-10 07:18:39,750 INFO L78 Accepts]: Start accepts. Automaton has 65343 states and 96600 transitions. Word has length 89 [2019-09-10 07:18:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:39,751 INFO L475 AbstractCegarLoop]: Abstraction has 65343 states and 96600 transitions. [2019-09-10 07:18:39,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:18:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 65343 states and 96600 transitions. [2019-09-10 07:18:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:39,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:39,757 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 07:18:39,757 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -448122327, now seen corresponding path program 1 times [2019-09-10 07:18:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:39,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:39,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:39,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:39,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:39,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:39,860 INFO L87 Difference]: Start difference. First operand 65343 states and 96600 transitions. Second operand 4 states. [2019-09-10 07:18:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:39,993 INFO L93 Difference]: Finished difference Result 65641 states and 97024 transitions. [2019-09-10 07:18:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:39,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:18:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:40,058 INFO L225 Difference]: With dead ends: 65641 [2019-09-10 07:18:40,058 INFO L226 Difference]: Without dead ends: 65641 [2019-09-10 07:18:40,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65641 states. [2019-09-10 07:18:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65641 to 65341. [2019-09-10 07:18:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65341 states. [2019-09-10 07:18:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65341 states to 65341 states and 96595 transitions. [2019-09-10 07:18:40,955 INFO L78 Accepts]: Start accepts. Automaton has 65341 states and 96595 transitions. Word has length 89 [2019-09-10 07:18:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:40,955 INFO L475 AbstractCegarLoop]: Abstraction has 65341 states and 96595 transitions. [2019-09-10 07:18:40,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 65341 states and 96595 transitions. [2019-09-10 07:18:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:40,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:40,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 07:18:40,961 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1412507950, now seen corresponding path program 1 times [2019-09-10 07:18:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:40,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:41,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:41,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:41,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:41,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:41,065 INFO L87 Difference]: Start difference. First operand 65341 states and 96595 transitions. Second operand 4 states. [2019-09-10 07:18:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:41,201 INFO L93 Difference]: Finished difference Result 65639 states and 97019 transitions. [2019-09-10 07:18:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:41,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:18:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:41,265 INFO L225 Difference]: With dead ends: 65639 [2019-09-10 07:18:41,265 INFO L226 Difference]: Without dead ends: 65639 [2019-09-10 07:18:41,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65639 states. [2019-09-10 07:18:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65639 to 65339. [2019-09-10 07:18:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65339 states. [2019-09-10 07:18:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65339 states to 65339 states and 96590 transitions. [2019-09-10 07:18:41,821 INFO L78 Accepts]: Start accepts. Automaton has 65339 states and 96590 transitions. Word has length 89 [2019-09-10 07:18:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:41,821 INFO L475 AbstractCegarLoop]: Abstraction has 65339 states and 96590 transitions. [2019-09-10 07:18:41,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65339 states and 96590 transitions. [2019-09-10 07:18:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:41,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:41,827 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 07:18:41,827 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1311245454, now seen corresponding path program 1 times [2019-09-10 07:18:41,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:41,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:41,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:41,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:41,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:41,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:41,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:41,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:41,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:41,953 INFO L87 Difference]: Start difference. First operand 65339 states and 96590 transitions. Second operand 4 states. [2019-09-10 07:18:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:42,091 INFO L93 Difference]: Finished difference Result 65637 states and 97014 transitions. [2019-09-10 07:18:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:42,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:18:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:42,152 INFO L225 Difference]: With dead ends: 65637 [2019-09-10 07:18:42,152 INFO L226 Difference]: Without dead ends: 65637 [2019-09-10 07:18:42,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65637 states. [2019-09-10 07:18:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65637 to 65337. [2019-09-10 07:18:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65337 states. [2019-09-10 07:18:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65337 states to 65337 states and 96585 transitions. [2019-09-10 07:18:42,693 INFO L78 Accepts]: Start accepts. Automaton has 65337 states and 96585 transitions. Word has length 89 [2019-09-10 07:18:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:42,693 INFO L475 AbstractCegarLoop]: Abstraction has 65337 states and 96585 transitions. [2019-09-10 07:18:42,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 65337 states and 96585 transitions. [2019-09-10 07:18:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:42,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:42,699 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 07:18:42,699 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1575891830, now seen corresponding path program 1 times [2019-09-10 07:18:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:42,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:42,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:42,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:42,817 INFO L87 Difference]: Start difference. First operand 65337 states and 96585 transitions. Second operand 4 states. [2019-09-10 07:18:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:42,991 INFO L93 Difference]: Finished difference Result 65635 states and 97011 transitions. [2019-09-10 07:18:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:42,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:18:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:43,053 INFO L225 Difference]: With dead ends: 65635 [2019-09-10 07:18:43,053 INFO L226 Difference]: Without dead ends: 65635 [2019-09-10 07:18:43,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65635 states. [2019-09-10 07:18:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65635 to 65335. [2019-09-10 07:18:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65335 states. [2019-09-10 07:18:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65335 states to 65335 states and 96582 transitions. [2019-09-10 07:18:43,938 INFO L78 Accepts]: Start accepts. Automaton has 65335 states and 96582 transitions. Word has length 89 [2019-09-10 07:18:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:43,938 INFO L475 AbstractCegarLoop]: Abstraction has 65335 states and 96582 transitions. [2019-09-10 07:18:43,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65335 states and 96582 transitions. [2019-09-10 07:18:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:18:43,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:43,944 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 07:18:43,944 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash -728604911, now seen corresponding path program 1 times [2019-09-10 07:18:43,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:43,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:43,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:44,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:44,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:44,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:44,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:44,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:44,040 INFO L87 Difference]: Start difference. First operand 65335 states and 96582 transitions. Second operand 4 states. [2019-09-10 07:18:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:44,197 INFO L93 Difference]: Finished difference Result 65633 states and 97008 transitions. [2019-09-10 07:18:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:44,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:18:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:44,259 INFO L225 Difference]: With dead ends: 65633 [2019-09-10 07:18:44,259 INFO L226 Difference]: Without dead ends: 65633 [2019-09-10 07:18:44,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65633 states. [2019-09-10 07:18:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65633 to 65333. [2019-09-10 07:18:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65333 states. [2019-09-10 07:18:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65333 states to 65333 states and 96579 transitions. [2019-09-10 07:18:44,825 INFO L78 Accepts]: Start accepts. Automaton has 65333 states and 96579 transitions. Word has length 89 [2019-09-10 07:18:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:44,825 INFO L475 AbstractCegarLoop]: Abstraction has 65333 states and 96579 transitions. [2019-09-10 07:18:44,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65333 states and 96579 transitions. [2019-09-10 07:18:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:18:44,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:44,831 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 07:18:44,831 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 870337478, now seen corresponding path program 1 times [2019-09-10 07:18:44,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:44,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:44,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:45,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:45,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:18:45,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:45,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:18:45,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:18:45,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:18:45,389 INFO L87 Difference]: Start difference. First operand 65333 states and 96579 transitions. Second operand 13 states. [2019-09-10 07:18:45,969 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:18:46,165 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:18:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:50,749 INFO L93 Difference]: Finished difference Result 195628 states and 289858 transitions. [2019-09-10 07:18:50,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:18:50,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-10 07:18:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:50,964 INFO L225 Difference]: With dead ends: 195628 [2019-09-10 07:18:50,964 INFO L226 Difference]: Without dead ends: 195628 [2019-09-10 07:18:50,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:18:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195628 states. [2019-09-10 07:18:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195628 to 65329. [2019-09-10 07:18:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65329 states. [2019-09-10 07:18:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65329 states to 65329 states and 96574 transitions. [2019-09-10 07:18:52,487 INFO L78 Accepts]: Start accepts. Automaton has 65329 states and 96574 transitions. Word has length 90 [2019-09-10 07:18:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:52,487 INFO L475 AbstractCegarLoop]: Abstraction has 65329 states and 96574 transitions. [2019-09-10 07:18:52,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:18:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 65329 states and 96574 transitions. [2019-09-10 07:18:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:18:52,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:52,493 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 07:18:52,493 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -752182709, now seen corresponding path program 1 times [2019-09-10 07:18:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:52,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:53,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:53,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:18:53,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:53,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:18:53,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:18:53,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:18:53,067 INFO L87 Difference]: Start difference. First operand 65329 states and 96574 transitions. Second operand 16 states. [2019-09-10 07:18:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:58,259 INFO L93 Difference]: Finished difference Result 75046 states and 110805 transitions. [2019-09-10 07:18:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:18:58,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-10 07:18:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:58,335 INFO L225 Difference]: With dead ends: 75046 [2019-09-10 07:18:58,335 INFO L226 Difference]: Without dead ends: 75046 [2019-09-10 07:18:58,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:18:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75046 states. [2019-09-10 07:18:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75046 to 65314. [2019-09-10 07:18:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65314 states. [2019-09-10 07:18:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65314 states to 65314 states and 96552 transitions. [2019-09-10 07:18:59,339 INFO L78 Accepts]: Start accepts. Automaton has 65314 states and 96552 transitions. Word has length 90 [2019-09-10 07:18:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:59,339 INFO L475 AbstractCegarLoop]: Abstraction has 65314 states and 96552 transitions. [2019-09-10 07:18:59,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:18:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65314 states and 96552 transitions. [2019-09-10 07:18:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:18:59,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:59,346 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 07:18:59,346 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1322137636, now seen corresponding path program 1 times [2019-09-10 07:18:59,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:59,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:59,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:59,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:59,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:59,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:59,455 INFO L87 Difference]: Start difference. First operand 65314 states and 96552 transitions. Second operand 3 states. [2019-09-10 07:18:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:59,885 INFO L93 Difference]: Finished difference Result 119198 states and 175219 transitions. [2019-09-10 07:18:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:59,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:18:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:00,031 INFO L225 Difference]: With dead ends: 119198 [2019-09-10 07:19:00,031 INFO L226 Difference]: Without dead ends: 119198 [2019-09-10 07:19:00,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119198 states. [2019-09-10 07:19:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119198 to 119196. [2019-09-10 07:19:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119196 states. [2019-09-10 07:19:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119196 states to 119196 states and 175218 transitions. [2019-09-10 07:19:01,188 INFO L78 Accepts]: Start accepts. Automaton has 119196 states and 175218 transitions. Word has length 90 [2019-09-10 07:19:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:01,188 INFO L475 AbstractCegarLoop]: Abstraction has 119196 states and 175218 transitions. [2019-09-10 07:19:01,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 119196 states and 175218 transitions. [2019-09-10 07:19:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:19:01,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:01,193 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 07:19:01,193 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1712431659, now seen corresponding path program 1 times [2019-09-10 07:19:01,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:01,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:01,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:01,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:19:01,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:01,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:19:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:19:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:19:01,380 INFO L87 Difference]: Start difference. First operand 119196 states and 175218 transitions. Second operand 9 states. [2019-09-10 07:19:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:09,418 INFO L93 Difference]: Finished difference Result 296750 states and 435295 transitions. [2019-09-10 07:19:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:19:09,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:19:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:09,789 INFO L225 Difference]: With dead ends: 296750 [2019-09-10 07:19:09,790 INFO L226 Difference]: Without dead ends: 296750 [2019-09-10 07:19:09,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:19:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296750 states. [2019-09-10 07:19:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296750 to 119196. [2019-09-10 07:19:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119196 states. [2019-09-10 07:19:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119196 states to 119196 states and 175217 transitions. [2019-09-10 07:19:14,958 INFO L78 Accepts]: Start accepts. Automaton has 119196 states and 175217 transitions. Word has length 90 [2019-09-10 07:19:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:14,958 INFO L475 AbstractCegarLoop]: Abstraction has 119196 states and 175217 transitions. [2019-09-10 07:19:14,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:19:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 119196 states and 175217 transitions. [2019-09-10 07:19:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:19:14,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:14,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:14,964 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1944179055, now seen corresponding path program 1 times [2019-09-10 07:19:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:14,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:14,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:15,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:19:15,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:15,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:19:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:19:15,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:19:15,166 INFO L87 Difference]: Start difference. First operand 119196 states and 175217 transitions. Second operand 9 states. [2019-09-10 07:19:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:21,608 INFO L93 Difference]: Finished difference Result 152871 states and 222992 transitions. [2019-09-10 07:19:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:19:21,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:19:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:21,802 INFO L225 Difference]: With dead ends: 152871 [2019-09-10 07:19:21,803 INFO L226 Difference]: Without dead ends: 152871 [2019-09-10 07:19:21,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:19:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152871 states. [2019-09-10 07:19:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152871 to 119196. [2019-09-10 07:19:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119196 states. [2019-09-10 07:19:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119196 states to 119196 states and 175216 transitions. [2019-09-10 07:19:23,785 INFO L78 Accepts]: Start accepts. Automaton has 119196 states and 175216 transitions. Word has length 90 [2019-09-10 07:19:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:23,785 INFO L475 AbstractCegarLoop]: Abstraction has 119196 states and 175216 transitions. [2019-09-10 07:19:23,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:19:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 119196 states and 175216 transitions. [2019-09-10 07:19:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:19:23,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:23,790 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 07:19:23,790 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -249745386, now seen corresponding path program 1 times [2019-09-10 07:19:23,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:23,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:23,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:23,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:23,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:19:24,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:24,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:19:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:19:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:24,006 INFO L87 Difference]: Start difference. First operand 119196 states and 175216 transitions. Second operand 10 states. [2019-09-10 07:19:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:34,532 INFO L93 Difference]: Finished difference Result 244955 states and 357762 transitions. [2019-09-10 07:19:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:19:34,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 07:19:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:34,818 INFO L225 Difference]: With dead ends: 244955 [2019-09-10 07:19:34,818 INFO L226 Difference]: Without dead ends: 244955 [2019-09-10 07:19:34,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:19:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244955 states. [2019-09-10 07:19:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244955 to 119196. [2019-09-10 07:19:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119196 states. [2019-09-10 07:19:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119196 states to 119196 states and 175215 transitions. [2019-09-10 07:19:39,846 INFO L78 Accepts]: Start accepts. Automaton has 119196 states and 175215 transitions. Word has length 90 [2019-09-10 07:19:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:39,846 INFO L475 AbstractCegarLoop]: Abstraction has 119196 states and 175215 transitions. [2019-09-10 07:19:39,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:19:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 119196 states and 175215 transitions. [2019-09-10 07:19:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:19:39,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:39,851 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 07:19:39,851 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1919961716, now seen corresponding path program 1 times [2019-09-10 07:19:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:40,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:40,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:19:40,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:40,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:19:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:19:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:40,066 INFO L87 Difference]: Start difference. First operand 119196 states and 175215 transitions. Second operand 10 states. [2019-09-10 07:19:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:48,946 INFO L93 Difference]: Finished difference Result 296563 states and 435077 transitions. [2019-09-10 07:19:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:19:48,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 07:19:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:49,297 INFO L225 Difference]: With dead ends: 296563 [2019-09-10 07:19:49,297 INFO L226 Difference]: Without dead ends: 296563 [2019-09-10 07:19:49,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:19:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296563 states. [2019-09-10 07:19:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296563 to 119196. [2019-09-10 07:19:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119196 states. [2019-09-10 07:19:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119196 states to 119196 states and 175214 transitions. [2019-09-10 07:19:54,383 INFO L78 Accepts]: Start accepts. Automaton has 119196 states and 175214 transitions. Word has length 90 [2019-09-10 07:19:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:54,383 INFO L475 AbstractCegarLoop]: Abstraction has 119196 states and 175214 transitions. [2019-09-10 07:19:54,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:19:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 119196 states and 175214 transitions. [2019-09-10 07:19:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:19:54,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:54,389 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 07:19:54,389 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash 857235093, now seen corresponding path program 1 times [2019-09-10 07:19:54,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:54,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:54,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:54,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:54,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:19:54,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:54,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:19:54,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:19:54,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:19:54,541 INFO L87 Difference]: Start difference. First operand 119196 states and 175214 transitions. Second operand 9 states. [2019-09-10 07:20:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:01,540 INFO L93 Difference]: Finished difference Result 296651 states and 435209 transitions. [2019-09-10 07:20:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:01,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:20:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:01,917 INFO L225 Difference]: With dead ends: 296651 [2019-09-10 07:20:01,918 INFO L226 Difference]: Without dead ends: 296651 [2019-09-10 07:20:01,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296651 states. [2019-09-10 07:20:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296651 to 119192. [2019-09-10 07:20:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119192 states. [2019-09-10 07:20:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119192 states to 119192 states and 175208 transitions. [2019-09-10 07:20:07,143 INFO L78 Accepts]: Start accepts. Automaton has 119192 states and 175208 transitions. Word has length 90 [2019-09-10 07:20:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:07,144 INFO L475 AbstractCegarLoop]: Abstraction has 119192 states and 175208 transitions. [2019-09-10 07:20:07,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:20:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 119192 states and 175208 transitions. [2019-09-10 07:20:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:20:07,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:07,148 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 07:20:07,149 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash -359830038, now seen corresponding path program 1 times [2019-09-10 07:20:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:07,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:20:07,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:07,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:20:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:20:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:20:07,320 INFO L87 Difference]: Start difference. First operand 119192 states and 175208 transitions. Second operand 9 states. [2019-09-10 07:20:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:14,104 INFO L93 Difference]: Finished difference Result 296649 states and 435206 transitions. [2019-09-10 07:20:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:14,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:20:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:14,453 INFO L225 Difference]: With dead ends: 296649 [2019-09-10 07:20:14,453 INFO L226 Difference]: Without dead ends: 296649 [2019-09-10 07:20:14,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296649 states. [2019-09-10 07:20:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296649 to 119190. [2019-09-10 07:20:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119190 states. [2019-09-10 07:20:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119190 states to 119190 states and 175205 transitions. [2019-09-10 07:20:19,518 INFO L78 Accepts]: Start accepts. Automaton has 119190 states and 175205 transitions. Word has length 90 [2019-09-10 07:20:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:19,518 INFO L475 AbstractCegarLoop]: Abstraction has 119190 states and 175205 transitions. [2019-09-10 07:20:19,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:20:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 119190 states and 175205 transitions. [2019-09-10 07:20:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:20:19,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:19,524 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 07:20:19,524 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1284691969, now seen corresponding path program 1 times [2019-09-10 07:20:19,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:19,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:19,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:19,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:20:19,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:19,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:20:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:20:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:20:19,696 INFO L87 Difference]: Start difference. First operand 119190 states and 175205 transitions. Second operand 9 states. [2019-09-10 07:20:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:27,557 INFO L93 Difference]: Finished difference Result 296645 states and 435200 transitions. [2019-09-10 07:20:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:27,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:20:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:27,911 INFO L225 Difference]: With dead ends: 296645 [2019-09-10 07:20:27,911 INFO L226 Difference]: Without dead ends: 296645 [2019-09-10 07:20:27,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296645 states. [2019-09-10 07:20:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296645 to 119188. [2019-09-10 07:20:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119188 states. [2019-09-10 07:20:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119188 states to 119188 states and 175202 transitions. [2019-09-10 07:20:30,619 INFO L78 Accepts]: Start accepts. Automaton has 119188 states and 175202 transitions. Word has length 90 [2019-09-10 07:20:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:30,619 INFO L475 AbstractCegarLoop]: Abstraction has 119188 states and 175202 transitions. [2019-09-10 07:20:30,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:20:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 119188 states and 175202 transitions. [2019-09-10 07:20:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:20:30,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:30,625 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 07:20:30,625 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1015945507, now seen corresponding path program 1 times [2019-09-10 07:20:30,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:30,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:30,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:30,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:30,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:31,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:20:31,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:31,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:20:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:20:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:20:31,435 INFO L87 Difference]: Start difference. First operand 119188 states and 175202 transitions. Second operand 17 states. [2019-09-10 07:20:34,411 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 07:20:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:42,886 INFO L93 Difference]: Finished difference Result 222146 states and 325696 transitions. [2019-09-10 07:20:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:20:42,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-09-10 07:20:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:43,148 INFO L225 Difference]: With dead ends: 222146 [2019-09-10 07:20:43,149 INFO L226 Difference]: Without dead ends: 222146 [2019-09-10 07:20:43,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:20:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222146 states. [2019-09-10 07:20:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222146 to 119184. [2019-09-10 07:20:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:20:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175197 transitions. [2019-09-10 07:20:44,605 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175197 transitions. Word has length 91 [2019-09-10 07:20:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175197 transitions. [2019-09-10 07:20:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:20:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175197 transitions. [2019-09-10 07:20:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:20:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:44,610 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 07:20:44,611 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2072899820, now seen corresponding path program 1 times [2019-09-10 07:20:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:44,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:44,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:44,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:20:44,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:44,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:20:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:20:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:20:44,813 INFO L87 Difference]: Start difference. First operand 119184 states and 175197 transitions. Second operand 10 states. [2019-09-10 07:20:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:55,239 INFO L93 Difference]: Finished difference Result 244061 states and 356492 transitions. [2019-09-10 07:20:55,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:20:55,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:20:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:55,544 INFO L225 Difference]: With dead ends: 244061 [2019-09-10 07:20:55,544 INFO L226 Difference]: Without dead ends: 244061 [2019-09-10 07:20:55,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:20:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244061 states. [2019-09-10 07:20:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244061 to 119184. [2019-09-10 07:20:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:20:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175196 transitions. [2019-09-10 07:20:58,001 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175196 transitions. Word has length 91 [2019-09-10 07:20:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:58,001 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175196 transitions. [2019-09-10 07:20:58,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:20:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175196 transitions. [2019-09-10 07:20:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:20:58,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:58,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:20:58,007 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash -960711643, now seen corresponding path program 1 times [2019-09-10 07:20:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:58,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:58,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 07:20:58,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:20:58,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:58,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:20:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:20:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:20:58,179 INFO L87 Difference]: Start difference. First operand 119184 states and 175196 transitions. Second operand 9 states. [2019-09-10 07:21:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:06,859 INFO L93 Difference]: Finished difference Result 296020 states and 434259 transitions. [2019-09-10 07:21:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:21:06,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:21:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:07,208 INFO L225 Difference]: With dead ends: 296020 [2019-09-10 07:21:07,208 INFO L226 Difference]: Without dead ends: 296020 [2019-09-10 07:21:07,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:21:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296020 states. [2019-09-10 07:21:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296020 to 119184. [2019-09-10 07:21:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:21:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175195 transitions. [2019-09-10 07:21:09,477 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175195 transitions. Word has length 91 [2019-09-10 07:21:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:09,477 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175195 transitions. [2019-09-10 07:21:09,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175195 transitions. [2019-09-10 07:21:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:21:09,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:09,484 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 07:21:09,484 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1367768899, now seen corresponding path program 1 times [2019-09-10 07:21:09,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:09,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:09,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:09,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:09,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:21:09,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:09,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:21:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:21:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:21:09,711 INFO L87 Difference]: Start difference. First operand 119184 states and 175195 transitions. Second operand 10 states. [2019-09-10 07:21:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:19,104 INFO L93 Difference]: Finished difference Result 295669 states and 433807 transitions. [2019-09-10 07:21:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:21:19,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:21:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:19,478 INFO L225 Difference]: With dead ends: 295669 [2019-09-10 07:21:19,478 INFO L226 Difference]: Without dead ends: 295669 [2019-09-10 07:21:19,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:21:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295669 states. [2019-09-10 07:21:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295669 to 119184. [2019-09-10 07:21:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:21:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175194 transitions. [2019-09-10 07:21:24,754 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175194 transitions. Word has length 91 [2019-09-10 07:21:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:24,755 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175194 transitions. [2019-09-10 07:21:24,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:21:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175194 transitions. [2019-09-10 07:21:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:21:24,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:24,761 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 07:21:24,761 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1916792283, now seen corresponding path program 1 times [2019-09-10 07:21:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:24,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:24,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:24,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:21:24,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:24,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:21:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:21:24,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:21:24,934 INFO L87 Difference]: Start difference. First operand 119184 states and 175194 transitions. Second operand 9 states. [2019-09-10 07:21:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:32,671 INFO L93 Difference]: Finished difference Result 272294 states and 400703 transitions. [2019-09-10 07:21:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:32,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:21:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:33,016 INFO L225 Difference]: With dead ends: 272294 [2019-09-10 07:21:33,016 INFO L226 Difference]: Without dead ends: 272294 [2019-09-10 07:21:33,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:21:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272294 states. [2019-09-10 07:21:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272294 to 119184. [2019-09-10 07:21:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:21:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175193 transitions. [2019-09-10 07:21:35,938 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175193 transitions. Word has length 91 [2019-09-10 07:21:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:35,939 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175193 transitions. [2019-09-10 07:21:35,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175193 transitions. [2019-09-10 07:21:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:21:35,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:35,944 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 07:21:35,944 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash -366346639, now seen corresponding path program 1 times [2019-09-10 07:21:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:35,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:36,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:36,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:21:36,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:36,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:21:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:21:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:21:36,170 INFO L87 Difference]: Start difference. First operand 119184 states and 175193 transitions. Second operand 10 states. [2019-09-10 07:21:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:46,624 INFO L93 Difference]: Finished difference Result 244061 states and 356487 transitions. [2019-09-10 07:21:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:46,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:21:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:46,938 INFO L225 Difference]: With dead ends: 244061 [2019-09-10 07:21:46,938 INFO L226 Difference]: Without dead ends: 244061 [2019-09-10 07:21:46,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:21:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244061 states. [2019-09-10 07:21:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244061 to 119184. [2019-09-10 07:21:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119184 states. [2019-09-10 07:21:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119184 states to 119184 states and 175192 transitions. [2019-09-10 07:21:52,286 INFO L78 Accepts]: Start accepts. Automaton has 119184 states and 175192 transitions. Word has length 91 [2019-09-10 07:21:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:52,286 INFO L475 AbstractCegarLoop]: Abstraction has 119184 states and 175192 transitions. [2019-09-10 07:21:52,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:21:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 119184 states and 175192 transitions. [2019-09-10 07:21:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:21:52,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:52,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, 1, 1] [2019-09-10 07:21:52,293 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1764923223, now seen corresponding path program 1 times [2019-09-10 07:21:52,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:52,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:52,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:52,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:21:52,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:52,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:21:52,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:21:52,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:21:52,824 INFO L87 Difference]: Start difference. First operand 119184 states and 175192 transitions. Second operand 12 states. [2019-09-10 07:21:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:56,752 INFO L93 Difference]: Finished difference Result 206374 states and 303367 transitions. [2019-09-10 07:21:56,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:21:56,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-09-10 07:21:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:57,029 INFO L225 Difference]: With dead ends: 206374 [2019-09-10 07:21:57,029 INFO L226 Difference]: Without dead ends: 206374 [2019-09-10 07:21:57,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:21:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206374 states. [2019-09-10 07:21:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206374 to 119138. [2019-09-10 07:21:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119138 states. [2019-09-10 07:21:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119138 states to 119138 states and 175136 transitions. [2019-09-10 07:21:59,694 INFO L78 Accepts]: Start accepts. Automaton has 119138 states and 175136 transitions. Word has length 91 [2019-09-10 07:21:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:59,695 INFO L475 AbstractCegarLoop]: Abstraction has 119138 states and 175136 transitions. [2019-09-10 07:21:59,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:21:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 119138 states and 175136 transitions. [2019-09-10 07:21:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:21:59,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:59,702 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 07:21:59,702 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1055607479, now seen corresponding path program 1 times [2019-09-10 07:21:59,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:59,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:59,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:59,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:59,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:00,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:00,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:22:00,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:00,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:22:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:22:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:22:00,356 INFO L87 Difference]: Start difference. First operand 119138 states and 175136 transitions. Second operand 18 states. [2019-09-10 07:22:00,888 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:22:01,089 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 07:22:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:08,957 INFO L93 Difference]: Finished difference Result 243415 states and 358073 transitions. [2019-09-10 07:22:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:22:08,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 07:22:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:12,223 INFO L225 Difference]: With dead ends: 243415 [2019-09-10 07:22:12,223 INFO L226 Difference]: Without dead ends: 243415 [2019-09-10 07:22:12,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:22:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243415 states. [2019-09-10 07:22:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243415 to 119122. [2019-09-10 07:22:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119122 states. [2019-09-10 07:22:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119122 states to 119122 states and 175115 transitions. [2019-09-10 07:22:14,033 INFO L78 Accepts]: Start accepts. Automaton has 119122 states and 175115 transitions. Word has length 91 [2019-09-10 07:22:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:14,034 INFO L475 AbstractCegarLoop]: Abstraction has 119122 states and 175115 transitions. [2019-09-10 07:22:14,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:22:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119122 states and 175115 transitions. [2019-09-10 07:22:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:22:14,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:14,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:22:14,040 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1920525865, now seen corresponding path program 1 times [2019-09-10 07:22:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:14,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:14,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:14,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:14,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:14,265 INFO L87 Difference]: Start difference. First operand 119122 states and 175115 transitions. Second operand 10 states. [2019-09-10 07:22:15,196 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 07:22:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:24,928 INFO L93 Difference]: Finished difference Result 244631 states and 357314 transitions. [2019-09-10 07:22:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:24,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 07:22:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:25,250 INFO L225 Difference]: With dead ends: 244631 [2019-09-10 07:22:25,250 INFO L226 Difference]: Without dead ends: 244631 [2019-09-10 07:22:25,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:22:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244631 states. [2019-09-10 07:22:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244631 to 119081. [2019-09-10 07:22:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119081 states. [2019-09-10 07:22:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119081 states to 119081 states and 175063 transitions. [2019-09-10 07:22:27,790 INFO L78 Accepts]: Start accepts. Automaton has 119081 states and 175063 transitions. Word has length 92 [2019-09-10 07:22:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:27,790 INFO L475 AbstractCegarLoop]: Abstraction has 119081 states and 175063 transitions. [2019-09-10 07:22:27,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 119081 states and 175063 transitions. [2019-09-10 07:22:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:22:27,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:27,797 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 07:22:27,797 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 760944872, now seen corresponding path program 1 times [2019-09-10 07:22:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:27,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:27,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:27,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:27,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:27,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:22:27,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:27,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:22:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:22:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:22:27,977 INFO L87 Difference]: Start difference. First operand 119081 states and 175063 transitions. Second operand 9 states. [2019-09-10 07:22:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:36,094 INFO L93 Difference]: Finished difference Result 273252 states and 402086 transitions. [2019-09-10 07:22:36,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:36,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:22:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:36,417 INFO L225 Difference]: With dead ends: 273252 [2019-09-10 07:22:36,418 INFO L226 Difference]: Without dead ends: 273252 [2019-09-10 07:22:36,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:22:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273252 states. [2019-09-10 07:22:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273252 to 119053. [2019-09-10 07:22:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119053 states. [2019-09-10 07:22:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119053 states to 119053 states and 175027 transitions. [2019-09-10 07:22:39,399 INFO L78 Accepts]: Start accepts. Automaton has 119053 states and 175027 transitions. Word has length 92 [2019-09-10 07:22:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:39,399 INFO L475 AbstractCegarLoop]: Abstraction has 119053 states and 175027 transitions. [2019-09-10 07:22:39,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:22:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 119053 states and 175027 transitions. [2019-09-10 07:22:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:22:39,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:39,405 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 07:22:39,405 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 72409817, now seen corresponding path program 1 times [2019-09-10 07:22:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:39,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:39,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:39,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:22:39,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:39,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:22:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:22:39,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:22:39,934 INFO L87 Difference]: Start difference. First operand 119053 states and 175027 transitions. Second operand 13 states. [2019-09-10 07:22:40,428 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 07:22:40,605 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:22:40,822 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:22:41,812 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:22:42,177 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 07:22:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:45,085 INFO L93 Difference]: Finished difference Result 212577 states and 311439 transitions. [2019-09-10 07:22:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:22:45,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-10 07:22:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:45,352 INFO L225 Difference]: With dead ends: 212577 [2019-09-10 07:22:45,353 INFO L226 Difference]: Without dead ends: 212577 [2019-09-10 07:22:45,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:22:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212577 states. [2019-09-10 07:22:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212577 to 119032. [2019-09-10 07:22:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119032 states. [2019-09-10 07:22:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119032 states to 119032 states and 175000 transitions. [2019-09-10 07:22:50,469 INFO L78 Accepts]: Start accepts. Automaton has 119032 states and 175000 transitions. Word has length 92 [2019-09-10 07:22:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:50,469 INFO L475 AbstractCegarLoop]: Abstraction has 119032 states and 175000 transitions. [2019-09-10 07:22:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:22:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 119032 states and 175000 transitions. [2019-09-10 07:22:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:22:50,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:50,476 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 07:22:50,477 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1539920086, now seen corresponding path program 1 times [2019-09-10 07:22:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:50,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:51,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:22:51,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:51,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:22:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:22:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:22:51,100 INFO L87 Difference]: Start difference. First operand 119032 states and 175000 transitions. Second operand 9 states. [2019-09-10 07:22:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:57,870 INFO L93 Difference]: Finished difference Result 273217 states and 402041 transitions. [2019-09-10 07:22:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:57,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:22:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:58,180 INFO L225 Difference]: With dead ends: 273217 [2019-09-10 07:22:58,180 INFO L226 Difference]: Without dead ends: 273217 [2019-09-10 07:22:58,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:22:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273217 states. [2019-09-10 07:23:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273217 to 119018. [2019-09-10 07:23:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119018 states. [2019-09-10 07:23:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119018 states to 119018 states and 174982 transitions. [2019-09-10 07:23:01,126 INFO L78 Accepts]: Start accepts. Automaton has 119018 states and 174982 transitions. Word has length 92 [2019-09-10 07:23:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:01,127 INFO L475 AbstractCegarLoop]: Abstraction has 119018 states and 174982 transitions. [2019-09-10 07:23:01,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:23:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 119018 states and 174982 transitions. [2019-09-10 07:23:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:23:01,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:01,133 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 07:23:01,134 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -212566439, now seen corresponding path program 1 times [2019-09-10 07:23:01,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:01,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:01,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:01,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:01,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:23:01,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:01,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:23:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:23:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:23:01,285 INFO L87 Difference]: Start difference. First operand 119018 states and 174982 transitions. Second operand 9 states. [2019-09-10 07:23:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:10,300 INFO L93 Difference]: Finished difference Result 296699 states and 435251 transitions. [2019-09-10 07:23:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:23:10,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:23:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:10,720 INFO L225 Difference]: With dead ends: 296699 [2019-09-10 07:23:10,720 INFO L226 Difference]: Without dead ends: 296699 [2019-09-10 07:23:10,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:23:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296699 states. [2019-09-10 07:23:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296699 to 119012. [2019-09-10 07:23:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119012 states. [2019-09-10 07:23:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119012 states to 119012 states and 174974 transitions. [2019-09-10 07:23:13,056 INFO L78 Accepts]: Start accepts. Automaton has 119012 states and 174974 transitions. Word has length 92 [2019-09-10 07:23:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:13,057 INFO L475 AbstractCegarLoop]: Abstraction has 119012 states and 174974 transitions. [2019-09-10 07:23:13,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:23:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 119012 states and 174974 transitions. [2019-09-10 07:23:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:23:13,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:13,062 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 07:23:13,063 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1496465994, now seen corresponding path program 1 times [2019-09-10 07:23:13,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:13,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:13,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:13,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:13,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:13,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:23:13,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:13,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:23:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:23:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:23:13,224 INFO L87 Difference]: Start difference. First operand 119012 states and 174974 transitions. Second operand 9 states. [2019-09-10 07:23:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:20,683 INFO L93 Difference]: Finished difference Result 296692 states and 435240 transitions. [2019-09-10 07:23:20,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:23:20,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:23:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:21,044 INFO L225 Difference]: With dead ends: 296692 [2019-09-10 07:23:21,044 INFO L226 Difference]: Without dead ends: 296692 [2019-09-10 07:23:21,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:23:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296692 states. [2019-09-10 07:23:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296692 to 119005. [2019-09-10 07:23:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119005 states. [2019-09-10 07:23:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119005 states to 119005 states and 174963 transitions. [2019-09-10 07:23:23,497 INFO L78 Accepts]: Start accepts. Automaton has 119005 states and 174963 transitions. Word has length 92 [2019-09-10 07:23:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:23,497 INFO L475 AbstractCegarLoop]: Abstraction has 119005 states and 174963 transitions. [2019-09-10 07:23:23,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:23:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 119005 states and 174963 transitions. [2019-09-10 07:23:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:23:23,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:23,503 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 07:23:23,503 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1342780197, now seen corresponding path program 1 times [2019-09-10 07:23:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:23:24,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:24,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:23:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:23:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:23:24,030 INFO L87 Difference]: Start difference. First operand 119005 states and 174963 transitions. Second operand 12 states. [2019-09-10 07:23:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:28,985 INFO L93 Difference]: Finished difference Result 208191 states and 305577 transitions. [2019-09-10 07:23:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:23:28,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-10 07:23:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:29,258 INFO L225 Difference]: With dead ends: 208191 [2019-09-10 07:23:29,259 INFO L226 Difference]: Without dead ends: 208191 [2019-09-10 07:23:29,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:23:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208191 states. [2019-09-10 07:23:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208191 to 119000. [2019-09-10 07:23:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119000 states. [2019-09-10 07:23:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119000 states to 119000 states and 174957 transitions. [2019-09-10 07:23:30,722 INFO L78 Accepts]: Start accepts. Automaton has 119000 states and 174957 transitions. Word has length 92 [2019-09-10 07:23:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:30,722 INFO L475 AbstractCegarLoop]: Abstraction has 119000 states and 174957 transitions. [2019-09-10 07:23:30,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:23:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 119000 states and 174957 transitions. [2019-09-10 07:23:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:23:30,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:30,729 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 07:23:30,729 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1657573288, now seen corresponding path program 1 times [2019-09-10 07:23:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:30,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:31,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:31,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:23:31,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:31,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:23:31,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:23:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:23:31,944 INFO L87 Difference]: Start difference. First operand 119000 states and 174957 transitions. Second operand 13 states. [2019-09-10 07:23:32,698 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-09-10 07:23:32,911 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:23:33,095 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:23:33,314 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:23:33,549 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 07:23:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:35,839 INFO L93 Difference]: Finished difference Result 178074 states and 261636 transitions. [2019-09-10 07:23:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:23:35,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 07:23:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:36,041 INFO L225 Difference]: With dead ends: 178074 [2019-09-10 07:23:36,042 INFO L226 Difference]: Without dead ends: 178074 [2019-09-10 07:23:36,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:23:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178074 states. [2019-09-10 07:23:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178074 to 118968. [2019-09-10 07:23:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118968 states. [2019-09-10 07:23:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118968 states to 118968 states and 174917 transitions. [2019-09-10 07:23:37,929 INFO L78 Accepts]: Start accepts. Automaton has 118968 states and 174917 transitions. Word has length 93 [2019-09-10 07:23:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:37,929 INFO L475 AbstractCegarLoop]: Abstraction has 118968 states and 174917 transitions. [2019-09-10 07:23:37,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:23:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 118968 states and 174917 transitions. [2019-09-10 07:23:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:23:37,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:37,936 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 07:23:37,936 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2101638741, now seen corresponding path program 1 times [2019-09-10 07:23:37,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:37,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:23:39,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:39,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:23:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:23:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:23:39,113 INFO L87 Difference]: Start difference. First operand 118968 states and 174917 transitions. Second operand 18 states. [2019-09-10 07:23:40,035 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:23:41,148 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 07:23:41,545 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-10 07:23:41,743 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:23:41,982 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:23:42,419 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:23:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:48,910 INFO L93 Difference]: Finished difference Result 221793 states and 325327 transitions. [2019-09-10 07:23:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:23:48,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-10 07:23:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:49,176 INFO L225 Difference]: With dead ends: 221793 [2019-09-10 07:23:49,176 INFO L226 Difference]: Without dead ends: 221793 [2019-09-10 07:23:49,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:23:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221793 states. [2019-09-10 07:23:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221793 to 118986. [2019-09-10 07:23:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118986 states. [2019-09-10 07:23:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118986 states to 118986 states and 174940 transitions. [2019-09-10 07:23:54,420 INFO L78 Accepts]: Start accepts. Automaton has 118986 states and 174940 transitions. Word has length 93 [2019-09-10 07:23:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:54,421 INFO L475 AbstractCegarLoop]: Abstraction has 118986 states and 174940 transitions. [2019-09-10 07:23:54,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:23:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 118986 states and 174940 transitions. [2019-09-10 07:23:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:23:54,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:54,426 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 07:23:54,426 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1037802983, now seen corresponding path program 1 times [2019-09-10 07:23:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:54,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:54,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:55,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:55,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:23:55,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:55,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:23:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:23:55,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:23:55,249 INFO L87 Difference]: Start difference. First operand 118986 states and 174940 transitions. Second operand 18 states. [2019-09-10 07:23:56,036 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:23:56,815 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 07:23:57,175 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 07:23:57,375 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:23:57,736 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:23:58,230 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:23:58,769 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:24:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:05,952 INFO L93 Difference]: Finished difference Result 179804 states and 263388 transitions. [2019-09-10 07:24:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:24:05,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-10 07:24:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:06,150 INFO L225 Difference]: With dead ends: 179804 [2019-09-10 07:24:06,150 INFO L226 Difference]: Without dead ends: 179804 [2019-09-10 07:24:06,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:24:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179804 states. [2019-09-10 07:24:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179804 to 118967. [2019-09-10 07:24:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118967 states. [2019-09-10 07:24:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118967 states to 118967 states and 174917 transitions. [2019-09-10 07:24:07,459 INFO L78 Accepts]: Start accepts. Automaton has 118967 states and 174917 transitions. Word has length 93 [2019-09-10 07:24:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:07,459 INFO L475 AbstractCegarLoop]: Abstraction has 118967 states and 174917 transitions. [2019-09-10 07:24:07,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:24:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 118967 states and 174917 transitions. [2019-09-10 07:24:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:24:07,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:07,466 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 07:24:07,466 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:07,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash -977910565, now seen corresponding path program 1 times [2019-09-10 07:24:07,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:07,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:07,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:08,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:08,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:24:08,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:08,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:24:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:24:08,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:24:08,072 INFO L87 Difference]: Start difference. First operand 118967 states and 174917 transitions. Second operand 17 states. [2019-09-10 07:24:08,802 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:24:09,342 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:24:10,018 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:24:10,697 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 07:24:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:17,459 INFO L93 Difference]: Finished difference Result 222299 states and 326058 transitions. [2019-09-10 07:24:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:24:17,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-09-10 07:24:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:17,776 INFO L225 Difference]: With dead ends: 222299 [2019-09-10 07:24:17,776 INFO L226 Difference]: Without dead ends: 222299 [2019-09-10 07:24:17,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:24:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222299 states. [2019-09-10 07:24:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222299 to 118985. [2019-09-10 07:24:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118985 states. [2019-09-10 07:24:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118985 states to 118985 states and 174940 transitions. [2019-09-10 07:24:19,949 INFO L78 Accepts]: Start accepts. Automaton has 118985 states and 174940 transitions. Word has length 93 [2019-09-10 07:24:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:19,949 INFO L475 AbstractCegarLoop]: Abstraction has 118985 states and 174940 transitions. [2019-09-10 07:24:19,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:24:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 118985 states and 174940 transitions. [2019-09-10 07:24:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:24:19,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:19,956 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 07:24:19,956 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2147217185, now seen corresponding path program 1 times [2019-09-10 07:24:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:19,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:20,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:20,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:24:20,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:20,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:24:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:24:20,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:24:20,109 INFO L87 Difference]: Start difference. First operand 118985 states and 174940 transitions. Second operand 9 states. [2019-09-10 07:24:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:28,342 INFO L93 Difference]: Finished difference Result 296667 states and 435211 transitions. [2019-09-10 07:24:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:24:28,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:24:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:28,764 INFO L225 Difference]: With dead ends: 296667 [2019-09-10 07:24:28,764 INFO L226 Difference]: Without dead ends: 296667 [2019-09-10 07:24:28,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:24:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296667 states. [2019-09-10 07:24:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296667 to 118980. [2019-09-10 07:24:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118980 states. [2019-09-10 07:24:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118980 states to 118980 states and 174934 transitions. [2019-09-10 07:24:30,847 INFO L78 Accepts]: Start accepts. Automaton has 118980 states and 174934 transitions. Word has length 93 [2019-09-10 07:24:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:30,847 INFO L475 AbstractCegarLoop]: Abstraction has 118980 states and 174934 transitions. [2019-09-10 07:24:30,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:24:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 118980 states and 174934 transitions. [2019-09-10 07:24:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:24:30,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:30,854 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 07:24:30,854 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash -360403462, now seen corresponding path program 1 times [2019-09-10 07:24:30,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:30,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:30,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:30,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:30,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:33,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:33,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:24:33,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:33,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:24:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:24:33,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:24:33,638 INFO L87 Difference]: Start difference. First operand 118980 states and 174934 transitions. Second operand 9 states. [2019-09-10 07:24:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:40,879 INFO L93 Difference]: Finished difference Result 296657 states and 435199 transitions. [2019-09-10 07:24:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:24:40,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:24:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:41,269 INFO L225 Difference]: With dead ends: 296657 [2019-09-10 07:24:41,269 INFO L226 Difference]: Without dead ends: 296657 [2019-09-10 07:24:41,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:24:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296657 states. [2019-09-10 07:24:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296657 to 118970. [2019-09-10 07:24:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118970 states. [2019-09-10 07:24:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118970 states to 118970 states and 174922 transitions. [2019-09-10 07:24:43,665 INFO L78 Accepts]: Start accepts. Automaton has 118970 states and 174922 transitions. Word has length 93 [2019-09-10 07:24:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:43,666 INFO L475 AbstractCegarLoop]: Abstraction has 118970 states and 174922 transitions. [2019-09-10 07:24:43,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:24:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 118970 states and 174922 transitions. [2019-09-10 07:24:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:24:43,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:43,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] [2019-09-10 07:24:43,672 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1988152430, now seen corresponding path program 1 times [2019-09-10 07:24:43,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:43,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:24:44,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:44,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:24:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:24:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:24:44,531 INFO L87 Difference]: Start difference. First operand 118970 states and 174922 transitions. Second operand 18 states. [2019-09-10 07:24:45,206 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:24:45,467 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:24:45,754 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:24:47,091 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:24:47,675 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:24:47,941 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:24:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:53,537 INFO L93 Difference]: Finished difference Result 243169 states and 357759 transitions. [2019-09-10 07:24:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:24:53,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-10 07:24:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:53,825 INFO L225 Difference]: With dead ends: 243169 [2019-09-10 07:24:53,825 INFO L226 Difference]: Without dead ends: 243169 [2019-09-10 07:24:53,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:24:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243169 states. [2019-09-10 07:24:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243169 to 118960. [2019-09-10 07:24:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118960 states. [2019-09-10 07:24:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118960 states to 118960 states and 174907 transitions. [2019-09-10 07:24:56,228 INFO L78 Accepts]: Start accepts. Automaton has 118960 states and 174907 transitions. Word has length 93 [2019-09-10 07:24:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:56,229 INFO L475 AbstractCegarLoop]: Abstraction has 118960 states and 174907 transitions. [2019-09-10 07:24:56,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:24:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 118960 states and 174907 transitions. [2019-09-10 07:24:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:24:56,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:56,236 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 07:24:56,236 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2141940485, now seen corresponding path program 1 times [2019-09-10 07:24:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:56,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:56,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:56,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:56,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:56,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:24:56,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:56,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:24:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:24:56,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:24:56,865 INFO L87 Difference]: Start difference. First operand 118960 states and 174907 transitions. Second operand 13 states. [2019-09-10 07:24:57,414 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2019-09-10 07:24:57,583 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-09-10 07:25:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:01,127 INFO L93 Difference]: Finished difference Result 323716 states and 476548 transitions. [2019-09-10 07:25:01,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:25:01,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-09-10 07:25:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:01,561 INFO L225 Difference]: With dead ends: 323716 [2019-09-10 07:25:01,561 INFO L226 Difference]: Without dead ends: 323716 [2019-09-10 07:25:01,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:25:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323716 states. [2019-09-10 07:25:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323716 to 118941. [2019-09-10 07:25:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118941 states. [2019-09-10 07:25:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118941 states to 118941 states and 174882 transitions. [2019-09-10 07:25:04,705 INFO L78 Accepts]: Start accepts. Automaton has 118941 states and 174882 transitions. Word has length 94 [2019-09-10 07:25:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:04,705 INFO L475 AbstractCegarLoop]: Abstraction has 118941 states and 174882 transitions. [2019-09-10 07:25:04,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:25:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 118941 states and 174882 transitions. [2019-09-10 07:25:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:25:04,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:04,713 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 07:25:04,713 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 103662884, now seen corresponding path program 1 times [2019-09-10 07:25:04,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:04,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:05,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:25:05,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:05,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:25:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:25:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:05,086 INFO L87 Difference]: Start difference. First operand 118941 states and 174882 transitions. Second operand 12 states. [2019-09-10 07:25:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:10,066 INFO L93 Difference]: Finished difference Result 365876 states and 536705 transitions. [2019-09-10 07:25:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:25:10,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-10 07:25:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:10,525 INFO L225 Difference]: With dead ends: 365876 [2019-09-10 07:25:10,525 INFO L226 Difference]: Without dead ends: 365876 [2019-09-10 07:25:10,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:25:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365876 states. [2019-09-10 07:25:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365876 to 118940. [2019-09-10 07:25:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118940 states. [2019-09-10 07:25:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118940 states to 118940 states and 174880 transitions. [2019-09-10 07:25:13,335 INFO L78 Accepts]: Start accepts. Automaton has 118940 states and 174880 transitions. Word has length 94 [2019-09-10 07:25:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:13,335 INFO L475 AbstractCegarLoop]: Abstraction has 118940 states and 174880 transitions. [2019-09-10 07:25:13,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:25:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 118940 states and 174880 transitions. [2019-09-10 07:25:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:25:13,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:13,341 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 07:25:13,341 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash -657290667, now seen corresponding path program 1 times [2019-09-10 07:25:13,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:13,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:13,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:14,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:14,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:25:14,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:14,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:25:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:25:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:25:14,250 INFO L87 Difference]: Start difference. First operand 118940 states and 174880 transitions. Second operand 18 states. [2019-09-10 07:25:14,906 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-10 07:25:15,093 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:25:15,988 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:25:16,370 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:25:16,604 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:25:16,991 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:25:17,667 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52