java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:56:08,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:56:08,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:56:08,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:56:08,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:56:08,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:56:08,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:56:08,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:56:08,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:56:08,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:56:08,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:56:08,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:56:08,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:56:08,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:56:08,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:56:08,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:56:08,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:56:08,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:56:08,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:56:08,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:56:08,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:56:08,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:56:08,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:56:08,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:56:08,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:56:08,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:56:08,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:56:08,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:56:08,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:56:08,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:56:08,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:56:08,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:56:08,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:56:08,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:56:08,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:56:08,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:56:08,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:56:08,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:56:08,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:56:08,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:56:08,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:56:08,678 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:56:08,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:56:08,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:56:08,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:56:08,703 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:56:08,704 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:56:08,704 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:56:08,705 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:56:08,705 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:56:08,705 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:56:08,705 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:56:08,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:56:08,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:56:08,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:56:08,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:56:08,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:56:08,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:56:08,710 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:56:08,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:56:08,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:56:08,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:56:08,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:56:08,711 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:56:08,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:56:08,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:56:08,712 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:56:08,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:56:08,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:56:08,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:56:08,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:56:08,780 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:56:08,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:56:08,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58d7e1f3/2575e9d75a264e799e603d3f3f4a8fab/FLAGc422f77bb [2019-09-10 07:56:09,593 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:56:09,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:56:09,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58d7e1f3/2575e9d75a264e799e603d3f3f4a8fab/FLAGc422f77bb [2019-09-10 07:56:10,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58d7e1f3/2575e9d75a264e799e603d3f3f4a8fab [2019-09-10 07:56:10,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:56:10,163 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:56:10,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:56:10,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:56:10,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:56:10,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:56:10" (1/1) ... [2019-09-10 07:56:10,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d0047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:10, skipping insertion in model container [2019-09-10 07:56:10,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:56:10" (1/1) ... [2019-09-10 07:56:10,180 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:56:10,367 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:56:11,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:56:11,662 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:56:12,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:56:12,153 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:56:12,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12 WrapperNode [2019-09-10 07:56:12,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:56:12,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:56:12,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:56:12,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:56:12,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (1/1) ... [2019-09-10 07:56:12,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:56:12,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:56:12,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:56:12,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:56:12,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (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:56:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:56:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:56:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:56:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:56:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:56:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:56:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:56:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:56:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:56:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:56:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:56:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:56:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:56:15,928 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:56:15,928 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:56:15,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:56:15 BoogieIcfgContainer [2019-09-10 07:56:15,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:56:15,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:56:15,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:56:15,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:56:15,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:56:10" (1/3) ... [2019-09-10 07:56:15,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa881d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:56:15, skipping insertion in model container [2019-09-10 07:56:15,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:56:12" (2/3) ... [2019-09-10 07:56:15,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa881d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:56:15, skipping insertion in model container [2019-09-10 07:56:15,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:56:15" (3/3) ... [2019-09-10 07:56:15,939 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:56:15,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:56:15,960 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 07:56:15,977 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 07:56:16,008 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:56:16,008 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:56:16,008 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:56:16,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:56:16,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:56:16,009 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:56:16,009 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:56:16,009 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:56:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states. [2019-09-10 07:56:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:56:16,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:16,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:16,099 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1025872216, now seen corresponding path program 1 times [2019-09-10 07:56:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:16,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:16,924 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:56:16,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:16,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:56:16,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:16,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:56:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:56:16,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:56:16,952 INFO L87 Difference]: Start difference. First operand 1198 states. Second operand 5 states. [2019-09-10 07:56:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:18,788 INFO L93 Difference]: Finished difference Result 1379 states and 2266 transitions. [2019-09-10 07:56:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:56:18,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:56:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:18,825 INFO L225 Difference]: With dead ends: 1379 [2019-09-10 07:56:18,826 INFO L226 Difference]: Without dead ends: 1367 [2019-09-10 07:56:18,827 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:56:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-09-10 07:56:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1251. [2019-09-10 07:56:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-09-10 07:56:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1633 transitions. [2019-09-10 07:56:18,948 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1633 transitions. Word has length 77 [2019-09-10 07:56:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:18,949 INFO L475 AbstractCegarLoop]: Abstraction has 1251 states and 1633 transitions. [2019-09-10 07:56:18,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:56:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1633 transitions. [2019-09-10 07:56:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:56:18,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:18,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:18,955 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash -991361587, now seen corresponding path program 1 times [2019-09-10 07:56:18,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:18,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:18,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:19,262 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:56:19,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:56:19,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:19,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:56:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:56:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:56:19,267 INFO L87 Difference]: Start difference. First operand 1251 states and 1633 transitions. Second operand 5 states. [2019-09-10 07:56:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:19,827 INFO L93 Difference]: Finished difference Result 838 states and 1096 transitions. [2019-09-10 07:56:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:56:19,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:56:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:19,834 INFO L225 Difference]: With dead ends: 838 [2019-09-10 07:56:19,834 INFO L226 Difference]: Without dead ends: 838 [2019-09-10 07:56:19,835 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:56:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-10 07:56:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-10 07:56:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-10 07:56:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1096 transitions. [2019-09-10 07:56:19,857 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1096 transitions. Word has length 77 [2019-09-10 07:56:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:19,858 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1096 transitions. [2019-09-10 07:56:19,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:56:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1096 transitions. [2019-09-10 07:56:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:56:19,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:19,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:19,862 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2088333632, now seen corresponding path program 1 times [2019-09-10 07:56:19,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:19,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:20,002 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:56:20,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:20,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:56:20,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:20,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:56:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:56:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:56:20,005 INFO L87 Difference]: Start difference. First operand 838 states and 1096 transitions. Second operand 5 states. [2019-09-10 07:56:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:20,463 INFO L93 Difference]: Finished difference Result 711 states and 939 transitions. [2019-09-10 07:56:20,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:56:20,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 07:56:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:20,468 INFO L225 Difference]: With dead ends: 711 [2019-09-10 07:56:20,468 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 07:56:20,469 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:56:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 07:56:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2019-09-10 07:56:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-09-10 07:56:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 939 transitions. [2019-09-10 07:56:20,486 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 939 transitions. Word has length 77 [2019-09-10 07:56:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:20,487 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 939 transitions. [2019-09-10 07:56:20,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:56:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 939 transitions. [2019-09-10 07:56:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:56:20,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:20,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:20,490 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2006758657, now seen corresponding path program 1 times [2019-09-10 07:56:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:20,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:20,692 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:56:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:56:20,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:20,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:56:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:56:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:56:20,695 INFO L87 Difference]: Start difference. First operand 711 states and 939 transitions. Second operand 5 states. [2019-09-10 07:56:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:21,255 INFO L93 Difference]: Finished difference Result 695 states and 919 transitions. [2019-09-10 07:56:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:56:21,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 07:56:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:21,263 INFO L225 Difference]: With dead ends: 695 [2019-09-10 07:56:21,263 INFO L226 Difference]: Without dead ends: 695 [2019-09-10 07:56:21,263 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:56:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-10 07:56:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2019-09-10 07:56:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-09-10 07:56:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 919 transitions. [2019-09-10 07:56:21,282 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 919 transitions. Word has length 79 [2019-09-10 07:56:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:21,283 INFO L475 AbstractCegarLoop]: Abstraction has 695 states and 919 transitions. [2019-09-10 07:56:21,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:56:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 919 transitions. [2019-09-10 07:56:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:56:21,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:21,285 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:56:21,286 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 748510916, now seen corresponding path program 1 times [2019-09-10 07:56:21,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:21,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:21,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:21,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:56:21,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:21,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:56:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:56:21,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:56:21,504 INFO L87 Difference]: Start difference. First operand 695 states and 919 transitions. Second operand 5 states. [2019-09-10 07:56:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:21,913 INFO L93 Difference]: Finished difference Result 591 states and 782 transitions. [2019-09-10 07:56:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:56:21,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 07:56:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:21,917 INFO L225 Difference]: With dead ends: 591 [2019-09-10 07:56:21,917 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 07:56:21,918 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:56:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 07:56:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 07:56:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 782 transitions. [2019-09-10 07:56:21,932 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 782 transitions. Word has length 81 [2019-09-10 07:56:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:21,932 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 782 transitions. [2019-09-10 07:56:21,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:56:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 782 transitions. [2019-09-10 07:56:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:56:21,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:21,934 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:56:21,935 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -763074199, now seen corresponding path program 1 times [2019-09-10 07:56:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:21,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:21,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:22,246 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:56:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:56:22,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:22,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:56:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:56:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:56:22,248 INFO L87 Difference]: Start difference. First operand 591 states and 782 transitions. Second operand 8 states. [2019-09-10 07:56:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:23,107 INFO L93 Difference]: Finished difference Result 840 states and 1086 transitions. [2019-09-10 07:56:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:56:23,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 07:56:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:23,117 INFO L225 Difference]: With dead ends: 840 [2019-09-10 07:56:23,117 INFO L226 Difference]: Without dead ends: 840 [2019-09-10 07:56:23,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:56:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-09-10 07:56:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 591. [2019-09-10 07:56:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 781 transitions. [2019-09-10 07:56:23,134 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 781 transitions. Word has length 83 [2019-09-10 07:56:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:23,136 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 781 transitions. [2019-09-10 07:56:23,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:56:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 781 transitions. [2019-09-10 07:56:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:56:23,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:23,142 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:56:23,142 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 847032169, now seen corresponding path program 1 times [2019-09-10 07:56:23,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:23,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:23,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:23,400 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:56:23,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:23,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:23,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:23,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:23,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:23,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:23,402 INFO L87 Difference]: Start difference. First operand 591 states and 781 transitions. Second operand 9 states. [2019-09-10 07:56:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:25,047 INFO L93 Difference]: Finished difference Result 923 states and 1266 transitions. [2019-09-10 07:56:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:56:25,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:56:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:25,053 INFO L225 Difference]: With dead ends: 923 [2019-09-10 07:56:25,053 INFO L226 Difference]: Without dead ends: 923 [2019-09-10 07:56:25,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:56:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-10 07:56:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 591. [2019-09-10 07:56:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 780 transitions. [2019-09-10 07:56:25,076 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 780 transitions. Word has length 83 [2019-09-10 07:56:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:25,076 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 780 transitions. [2019-09-10 07:56:25,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 780 transitions. [2019-09-10 07:56:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:56:25,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:25,079 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:56:25,080 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 560401961, now seen corresponding path program 1 times [2019-09-10 07:56:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:25,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:25,314 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:56:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:25,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:25,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:25,316 INFO L87 Difference]: Start difference. First operand 591 states and 780 transitions. Second operand 9 states. [2019-09-10 07:56:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:26,734 INFO L93 Difference]: Finished difference Result 1202 states and 1638 transitions. [2019-09-10 07:56:26,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:26,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 07:56:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:26,742 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 07:56:26,742 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 07:56:26,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 07:56:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-10 07:56:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 779 transitions. [2019-09-10 07:56:26,762 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 779 transitions. Word has length 83 [2019-09-10 07:56:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:26,762 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 779 transitions. [2019-09-10 07:56:26,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 779 transitions. [2019-09-10 07:56:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:56:26,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:26,764 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:56:26,765 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1854316557, now seen corresponding path program 1 times [2019-09-10 07:56:26,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:26,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:26,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:26,963 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:56:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:26,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:26,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:26,965 INFO L87 Difference]: Start difference. First operand 591 states and 779 transitions. Second operand 9 states. [2019-09-10 07:56:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:28,612 INFO L93 Difference]: Finished difference Result 1176 states and 1594 transitions. [2019-09-10 07:56:28,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:28,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:56:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:28,620 INFO L225 Difference]: With dead ends: 1176 [2019-09-10 07:56:28,620 INFO L226 Difference]: Without dead ends: 1176 [2019-09-10 07:56:28,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-10 07:56:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-10 07:56:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 778 transitions. [2019-09-10 07:56:28,637 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 778 transitions. Word has length 84 [2019-09-10 07:56:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:28,638 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 778 transitions. [2019-09-10 07:56:28,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 778 transitions. [2019-09-10 07:56:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:28,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:28,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:28,640 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -15576114, now seen corresponding path program 1 times [2019-09-10 07:56:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:28,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:28,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:28,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:28,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:28,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:28,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:28,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:28,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:28,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:28,816 INFO L87 Difference]: Start difference. First operand 591 states and 778 transitions. Second operand 9 states. [2019-09-10 07:56:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:30,355 INFO L93 Difference]: Finished difference Result 1202 states and 1635 transitions. [2019-09-10 07:56:30,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:30,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:30,362 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 07:56:30,362 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 07:56:30,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 07:56:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-10 07:56:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 776 transitions. [2019-09-10 07:56:30,384 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 776 transitions. Word has length 85 [2019-09-10 07:56:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:30,384 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 776 transitions. [2019-09-10 07:56:30,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 776 transitions. [2019-09-10 07:56:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:30,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:30,411 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:56:30,411 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1212918770, now seen corresponding path program 1 times [2019-09-10 07:56:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:30,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:30,635 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:56:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:30,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:30,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:30,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:30,637 INFO L87 Difference]: Start difference. First operand 591 states and 776 transitions. Second operand 9 states. [2019-09-10 07:56:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:31,915 INFO L93 Difference]: Finished difference Result 1176 states and 1590 transitions. [2019-09-10 07:56:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:31,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:31,926 INFO L225 Difference]: With dead ends: 1176 [2019-09-10 07:56:31,926 INFO L226 Difference]: Without dead ends: 1176 [2019-09-10 07:56:31,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-10 07:56:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-10 07:56:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 774 transitions. [2019-09-10 07:56:31,944 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 774 transitions. Word has length 85 [2019-09-10 07:56:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:31,944 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 774 transitions. [2019-09-10 07:56:31,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 774 transitions. [2019-09-10 07:56:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:31,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:31,946 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:56:31,947 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1860056526, now seen corresponding path program 1 times [2019-09-10 07:56:31,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:31,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:32,134 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:56:32,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:32,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:32,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:32,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:32,137 INFO L87 Difference]: Start difference. First operand 591 states and 774 transitions. Second operand 9 states. [2019-09-10 07:56:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:33,558 INFO L93 Difference]: Finished difference Result 923 states and 1258 transitions. [2019-09-10 07:56:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:56:33,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:33,563 INFO L225 Difference]: With dead ends: 923 [2019-09-10 07:56:33,564 INFO L226 Difference]: Without dead ends: 923 [2019-09-10 07:56:33,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:56:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-10 07:56:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 591. [2019-09-10 07:56:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 772 transitions. [2019-09-10 07:56:33,582 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 772 transitions. Word has length 85 [2019-09-10 07:56:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:33,582 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 772 transitions. [2019-09-10 07:56:33,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 772 transitions. [2019-09-10 07:56:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:33,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:33,584 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:56:33,584 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash 920806414, now seen corresponding path program 1 times [2019-09-10 07:56:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:33,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:33,786 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:56:33,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:33,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:33,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:33,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:33,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:33,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:33,789 INFO L87 Difference]: Start difference. First operand 591 states and 772 transitions. Second operand 9 states. [2019-09-10 07:56:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:35,326 INFO L93 Difference]: Finished difference Result 1202 states and 1629 transitions. [2019-09-10 07:56:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:35,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:35,332 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 07:56:35,332 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 07:56:35,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 07:56:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 591. [2019-09-10 07:56:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 771 transitions. [2019-09-10 07:56:35,348 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 771 transitions. Word has length 85 [2019-09-10 07:56:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:35,348 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 771 transitions. [2019-09-10 07:56:35,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 771 transitions. [2019-09-10 07:56:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:35,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:35,350 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:56:35,351 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1035004846, now seen corresponding path program 1 times [2019-09-10 07:56:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:35,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:35,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:35,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:35,514 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:56:35,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:35,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:35,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:35,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:35,516 INFO L87 Difference]: Start difference. First operand 591 states and 771 transitions. Second operand 9 states. [2019-09-10 07:56:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:36,910 INFO L93 Difference]: Finished difference Result 1176 states and 1586 transitions. [2019-09-10 07:56:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:36,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:36,916 INFO L225 Difference]: With dead ends: 1176 [2019-09-10 07:56:36,916 INFO L226 Difference]: Without dead ends: 1176 [2019-09-10 07:56:36,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-10 07:56:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 591. [2019-09-10 07:56:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 07:56:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-09-10 07:56:36,931 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 85 [2019-09-10 07:56:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:36,931 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-09-10 07:56:36,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-09-10 07:56:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:36,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:36,933 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:56:36,934 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1147266175, now seen corresponding path program 1 times [2019-09-10 07:56:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:36,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:37,105 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:56:37,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:37,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:37,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:37,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:37,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:37,107 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 9 states. [2019-09-10 07:56:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:38,365 INFO L93 Difference]: Finished difference Result 1151 states and 1542 transitions. [2019-09-10 07:56:38,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:38,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:38,371 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:38,371 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:38,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 768 transitions. [2019-09-10 07:56:38,384 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 768 transitions. Word has length 85 [2019-09-10 07:56:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:38,385 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 768 transitions. [2019-09-10 07:56:38,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 768 transitions. [2019-09-10 07:56:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:56:38,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:38,387 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:56:38,387 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash -207377138, now seen corresponding path program 1 times [2019-09-10 07:56:38,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:38,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:38,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:38,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:38,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:38,558 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:56:38,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:38,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:38,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:38,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:38,562 INFO L87 Difference]: Start difference. First operand 590 states and 768 transitions. Second operand 9 states. [2019-09-10 07:56:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:39,818 INFO L93 Difference]: Finished difference Result 1175 states and 1582 transitions. [2019-09-10 07:56:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:39,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 07:56:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:39,823 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 07:56:39,823 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 07:56:39,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 07:56:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-10 07:56:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 767 transitions. [2019-09-10 07:56:39,836 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 767 transitions. Word has length 85 [2019-09-10 07:56:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:39,837 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 767 transitions. [2019-09-10 07:56:39,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 767 transitions. [2019-09-10 07:56:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:56:39,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:39,839 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:56:39,839 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash -669368786, now seen corresponding path program 1 times [2019-09-10 07:56:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:40,025 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:56:40,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:40,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:40,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:40,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:40,027 INFO L87 Difference]: Start difference. First operand 590 states and 767 transitions. Second operand 9 states. [2019-09-10 07:56:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:41,511 INFO L93 Difference]: Finished difference Result 1151 states and 1539 transitions. [2019-09-10 07:56:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:41,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 07:56:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:41,517 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:41,517 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:41,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 765 transitions. [2019-09-10 07:56:41,529 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 765 transitions. Word has length 86 [2019-09-10 07:56:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:41,529 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 765 transitions. [2019-09-10 07:56:41,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 765 transitions. [2019-09-10 07:56:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:56:41,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:41,531 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:56:41,532 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1385395406, now seen corresponding path program 1 times [2019-09-10 07:56:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:41,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:41,702 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:56:41,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:41,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:41,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:41,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:41,704 INFO L87 Difference]: Start difference. First operand 590 states and 765 transitions. Second operand 9 states. [2019-09-10 07:56:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:43,316 INFO L93 Difference]: Finished difference Result 1151 states and 1538 transitions. [2019-09-10 07:56:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:43,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 07:56:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:43,323 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:43,323 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:43,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 764 transitions. [2019-09-10 07:56:43,334 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 764 transitions. Word has length 86 [2019-09-10 07:56:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:43,335 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 764 transitions. [2019-09-10 07:56:43,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 764 transitions. [2019-09-10 07:56:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:56:43,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:43,337 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:56:43,337 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 858512238, now seen corresponding path program 1 times [2019-09-10 07:56:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:43,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:43,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:43,511 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:56:43,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:43,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:43,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:43,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:43,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:43,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:43,512 INFO L87 Difference]: Start difference. First operand 590 states and 764 transitions. Second operand 9 states. [2019-09-10 07:56:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:45,056 INFO L93 Difference]: Finished difference Result 1151 states and 1536 transitions. [2019-09-10 07:56:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:45,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 07:56:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:45,062 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:45,062 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:45,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 763 transitions. [2019-09-10 07:56:45,074 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 763 transitions. Word has length 86 [2019-09-10 07:56:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:45,074 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 763 transitions. [2019-09-10 07:56:45,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 763 transitions. [2019-09-10 07:56:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:56:45,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:45,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:45,077 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1124465518, now seen corresponding path program 1 times [2019-09-10 07:56:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:45,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:45,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:45,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:45,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:45,247 INFO L87 Difference]: Start difference. First operand 590 states and 763 transitions. Second operand 9 states. [2019-09-10 07:56:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:46,690 INFO L93 Difference]: Finished difference Result 1151 states and 1535 transitions. [2019-09-10 07:56:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:46,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 07:56:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:46,696 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:46,696 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:46,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2019-09-10 07:56:46,729 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 86 [2019-09-10 07:56:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:46,730 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2019-09-10 07:56:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2019-09-10 07:56:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:46,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:46,732 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:56:46,732 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1332810989, now seen corresponding path program 1 times [2019-09-10 07:56:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:46,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:46,893 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:56:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:46,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:46,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:46,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:46,895 INFO L87 Difference]: Start difference. First operand 590 states and 762 transitions. Second operand 9 states. [2019-09-10 07:56:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:48,350 INFO L93 Difference]: Finished difference Result 1151 states and 1533 transitions. [2019-09-10 07:56:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:48,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:48,354 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:48,355 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:48,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 760 transitions. [2019-09-10 07:56:48,363 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 760 transitions. Word has length 87 [2019-09-10 07:56:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:48,364 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 760 transitions. [2019-09-10 07:56:48,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 760 transitions. [2019-09-10 07:56:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:48,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:48,366 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:56:48,366 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash 478571315, now seen corresponding path program 1 times [2019-09-10 07:56:48,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:48,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:48,526 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:56:48,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:48,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:48,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:48,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:48,527 INFO L87 Difference]: Start difference. First operand 590 states and 760 transitions. Second operand 9 states. [2019-09-10 07:56:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:49,750 INFO L93 Difference]: Finished difference Result 1175 states and 1572 transitions. [2019-09-10 07:56:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:49,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:49,757 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 07:56:49,757 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 07:56:49,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 07:56:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-10 07:56:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions. [2019-09-10 07:56:49,766 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 87 [2019-09-10 07:56:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:49,767 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 758 transitions. [2019-09-10 07:56:49,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions. [2019-09-10 07:56:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:49,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:49,769 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:56:49,769 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2101826515, now seen corresponding path program 1 times [2019-09-10 07:56:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:49,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:49,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:56:49,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:49,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:49,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:49,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:49,933 INFO L87 Difference]: Start difference. First operand 590 states and 758 transitions. Second operand 9 states. [2019-09-10 07:56:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:51,669 INFO L93 Difference]: Finished difference Result 1201 states and 1606 transitions. [2019-09-10 07:56:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:51,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:51,674 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:56:51,674 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:56:51,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:56:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 590. [2019-09-10 07:56:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 756 transitions. [2019-09-10 07:56:51,683 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 756 transitions. Word has length 87 [2019-09-10 07:56:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:51,683 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 756 transitions. [2019-09-10 07:56:51,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 756 transitions. [2019-09-10 07:56:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:51,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:51,685 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:56:51,685 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash 244970323, now seen corresponding path program 1 times [2019-09-10 07:56:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:51,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:51,845 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:56:51,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:51,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:51,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:51,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:51,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:51,846 INFO L87 Difference]: Start difference. First operand 590 states and 756 transitions. Second operand 9 states. [2019-09-10 07:56:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:53,300 INFO L93 Difference]: Finished difference Result 1175 states and 1566 transitions. [2019-09-10 07:56:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:53,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:53,305 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 07:56:53,305 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 07:56:53,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 07:56:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-10 07:56:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 754 transitions. [2019-09-10 07:56:53,316 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 754 transitions. Word has length 87 [2019-09-10 07:56:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:53,316 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 754 transitions. [2019-09-10 07:56:53,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 754 transitions. [2019-09-10 07:56:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:53,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:53,318 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:56:53,318 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1093485491, now seen corresponding path program 1 times [2019-09-10 07:56:53,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:53,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:53,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:53,535 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:56:53,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:53,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:53,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:53,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:53,537 INFO L87 Difference]: Start difference. First operand 590 states and 754 transitions. Second operand 9 states. [2019-09-10 07:56:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:55,042 INFO L93 Difference]: Finished difference Result 1151 states and 1525 transitions. [2019-09-10 07:56:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:55,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:55,049 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:55,049 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:55,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 752 transitions. [2019-09-10 07:56:55,059 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 752 transitions. Word has length 87 [2019-09-10 07:56:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:55,059 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 752 transitions. [2019-09-10 07:56:55,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 752 transitions. [2019-09-10 07:56:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:55,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:55,060 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:56:55,061 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1482555949, now seen corresponding path program 1 times [2019-09-10 07:56:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:55,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:55,222 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:56:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:55,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:55,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:55,224 INFO L87 Difference]: Start difference. First operand 590 states and 752 transitions. Second operand 9 states. [2019-09-10 07:56:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:56,765 INFO L93 Difference]: Finished difference Result 1151 states and 1521 transitions. [2019-09-10 07:56:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:56,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:56,771 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:56,771 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:56,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 750 transitions. [2019-09-10 07:56:56,783 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 750 transitions. Word has length 87 [2019-09-10 07:56:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:56,783 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 750 transitions. [2019-09-10 07:56:56,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 750 transitions. [2019-09-10 07:56:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:56,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:56,785 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:56:56,785 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1339772467, now seen corresponding path program 1 times [2019-09-10 07:56:56,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:56,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:56,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:56:56,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:56,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:56,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:56,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:56,945 INFO L87 Difference]: Start difference. First operand 590 states and 750 transitions. Second operand 9 states. [2019-09-10 07:56:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:58,417 INFO L93 Difference]: Finished difference Result 1151 states and 1520 transitions. [2019-09-10 07:56:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:56:58,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:56:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:58,444 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:56:58,444 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:56:58,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:56:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:56:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:56:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:56:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-09-10 07:56:58,455 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 749 transitions. Word has length 87 [2019-09-10 07:56:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:58,455 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-09-10 07:56:58,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:56:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 749 transitions. [2019-09-10 07:56:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:56:58,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:58,456 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:56:58,456 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2086137837, now seen corresponding path program 1 times [2019-09-10 07:56:58,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:58,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:58,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:58,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:56:58,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:58,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:56:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:56:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:56:58,649 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. Second operand 9 states. [2019-09-10 07:57:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:00,019 INFO L93 Difference]: Finished difference Result 1175 states and 1556 transitions. [2019-09-10 07:57:00,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:57:00,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:57:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:00,023 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 07:57:00,024 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 07:57:00,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:57:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 07:57:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 590. [2019-09-10 07:57:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:57:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 748 transitions. [2019-09-10 07:57:00,035 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 748 transitions. Word has length 87 [2019-09-10 07:57:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:00,035 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 748 transitions. [2019-09-10 07:57:00,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:57:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 748 transitions. [2019-09-10 07:57:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:57:00,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:00,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:00,037 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash 923787283, now seen corresponding path program 1 times [2019-09-10 07:57:00,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:00,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:00,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:00,192 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:57:00,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:00,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:57:00,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:00,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:57:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:57:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:57:00,193 INFO L87 Difference]: Start difference. First operand 590 states and 748 transitions. Second operand 9 states. [2019-09-10 07:57:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:01,798 INFO L93 Difference]: Finished difference Result 1151 states and 1517 transitions. [2019-09-10 07:57:01,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:57:01,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:57:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:01,803 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:57:01,803 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:57:01,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:57:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:57:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:57:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:57:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 747 transitions. [2019-09-10 07:57:01,813 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 747 transitions. Word has length 87 [2019-09-10 07:57:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:01,814 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 747 transitions. [2019-09-10 07:57:01,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:57:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 747 transitions. [2019-09-10 07:57:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:57:01,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:01,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:01,815 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1851798797, now seen corresponding path program 1 times [2019-09-10 07:57:01,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:01,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:01,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:01,969 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:57:01,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:01,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:57:01,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:01,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:57:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:57:01,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:57:01,972 INFO L87 Difference]: Start difference. First operand 590 states and 747 transitions. Second operand 9 states. [2019-09-10 07:57:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:03,526 INFO L93 Difference]: Finished difference Result 1151 states and 1515 transitions. [2019-09-10 07:57:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:57:03,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:57:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:03,529 INFO L225 Difference]: With dead ends: 1151 [2019-09-10 07:57:03,529 INFO L226 Difference]: Without dead ends: 1151 [2019-09-10 07:57:03,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:57:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-10 07:57:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 590. [2019-09-10 07:57:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:57:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 746 transitions. [2019-09-10 07:57:03,537 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 746 transitions. Word has length 87 [2019-09-10 07:57:03,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:03,538 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 746 transitions. [2019-09-10 07:57:03,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:57:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 746 transitions. [2019-09-10 07:57:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:03,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:03,539 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:57:03,540 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2120002391, now seen corresponding path program 1 times [2019-09-10 07:57:03,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:03,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:04,893 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:57:04,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:04,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:57:04,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:04,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:57:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:57:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:57:04,899 INFO L87 Difference]: Start difference. First operand 590 states and 746 transitions. Second operand 21 states. [2019-09-10 07:57:05,832 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:57:06,089 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-10 07:57:06,266 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:57:06,435 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:57:06,628 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:57:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:09,548 INFO L93 Difference]: Finished difference Result 1031 states and 1356 transitions. [2019-09-10 07:57:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:57:09,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2019-09-10 07:57:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:09,551 INFO L225 Difference]: With dead ends: 1031 [2019-09-10 07:57:09,552 INFO L226 Difference]: Without dead ends: 1031 [2019-09-10 07:57:09,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:57:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-09-10 07:57:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 605. [2019-09-10 07:57:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-10 07:57:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 766 transitions. [2019-09-10 07:57:09,561 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 766 transitions. Word has length 88 [2019-09-10 07:57:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:09,562 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 766 transitions. [2019-09-10 07:57:09,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:57:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 766 transitions. [2019-09-10 07:57:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:09,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:09,563 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:57:09,568 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 81782089, now seen corresponding path program 1 times [2019-09-10 07:57:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:09,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:10,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:10,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:57:10,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:10,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:57:10,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:57:10,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:57:10,356 INFO L87 Difference]: Start difference. First operand 605 states and 766 transitions. Second operand 17 states. [2019-09-10 07:57:10,926 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:11,965 INFO L93 Difference]: Finished difference Result 828 states and 1080 transitions. [2019-09-10 07:57:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:57:11,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-10 07:57:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:11,968 INFO L225 Difference]: With dead ends: 828 [2019-09-10 07:57:11,968 INFO L226 Difference]: Without dead ends: 828 [2019-09-10 07:57:11,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:57:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-09-10 07:57:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 558. [2019-09-10 07:57:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-10 07:57:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 704 transitions. [2019-09-10 07:57:11,977 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 704 transitions. Word has length 88 [2019-09-10 07:57:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:11,978 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 704 transitions. [2019-09-10 07:57:11,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:57:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 704 transitions. [2019-09-10 07:57:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:11,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:11,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:57:11,980 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash 384754761, now seen corresponding path program 1 times [2019-09-10 07:57:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:11,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:12,950 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:57:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:57:12,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:12,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:57:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:57:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:57:12,952 INFO L87 Difference]: Start difference. First operand 558 states and 704 transitions. Second operand 20 states. [2019-09-10 07:57:13,798 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:57:14,010 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:57:14,175 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:57:14,326 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:57:14,488 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:57:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:16,532 INFO L93 Difference]: Finished difference Result 841 states and 1083 transitions. [2019-09-10 07:57:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:57:16,532 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2019-09-10 07:57:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:16,534 INFO L225 Difference]: With dead ends: 841 [2019-09-10 07:57:16,534 INFO L226 Difference]: Without dead ends: 841 [2019-09-10 07:57:16,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:57:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-10 07:57:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 565. [2019-09-10 07:57:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-10 07:57:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 711 transitions. [2019-09-10 07:57:16,543 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 711 transitions. Word has length 88 [2019-09-10 07:57:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:16,544 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 711 transitions. [2019-09-10 07:57:16,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:57:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 711 transitions. [2019-09-10 07:57:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:16,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:16,545 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:57:16,546 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -566170359, now seen corresponding path program 1 times [2019-09-10 07:57:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:16,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:17,333 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:57:17,767 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:57:17,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:17,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:57:17,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:17,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:57:17,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:57:17,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:57:17,768 INFO L87 Difference]: Start difference. First operand 565 states and 711 transitions. Second operand 22 states. [2019-09-10 07:57:18,774 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:57:19,013 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:57:19,382 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:57:19,527 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:57:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:22,947 INFO L93 Difference]: Finished difference Result 1066 states and 1380 transitions. [2019-09-10 07:57:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:57:22,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-10 07:57:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:22,950 INFO L225 Difference]: With dead ends: 1066 [2019-09-10 07:57:22,950 INFO L226 Difference]: Without dead ends: 1066 [2019-09-10 07:57:22,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:57:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-10 07:57:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 572. [2019-09-10 07:57:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-10 07:57:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 718 transitions. [2019-09-10 07:57:22,960 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 718 transitions. Word has length 88 [2019-09-10 07:57:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:22,961 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 718 transitions. [2019-09-10 07:57:22,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:57:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 718 transitions. [2019-09-10 07:57:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:22,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:22,962 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:57:22,963 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1156320813, now seen corresponding path program 1 times [2019-09-10 07:57:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:22,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:23,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:57:23,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:57:23,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:23,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:57:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:57:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:57:23,696 INFO L87 Difference]: Start difference. First operand 572 states and 718 transitions. Second operand 17 states. [2019-09-10 07:57:24,269 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:57:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:26,528 INFO L93 Difference]: Finished difference Result 1166 states and 1533 transitions. [2019-09-10 07:57:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:57:26,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-10 07:57:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:26,532 INFO L225 Difference]: With dead ends: 1166 [2019-09-10 07:57:26,532 INFO L226 Difference]: Without dead ends: 1166 [2019-09-10 07:57:26,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:57:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-10 07:57:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 572. [2019-09-10 07:57:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-10 07:57:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 716 transitions. [2019-09-10 07:57:26,543 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 716 transitions. Word has length 88 [2019-09-10 07:57:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:26,544 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 716 transitions. [2019-09-10 07:57:26,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:57:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 716 transitions. [2019-09-10 07:57:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:57:26,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:26,545 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:57:26,546 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1020462135, now seen corresponding path program 1 times [2019-09-10 07:57:26,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:26,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:27,755 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:57:27,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:27,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:57:27,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:27,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:57:27,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:57:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:57:27,757 INFO L87 Difference]: Start difference. First operand 572 states and 716 transitions. Second operand 22 states. [2019-09-10 07:57:28,712 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:57:28,959 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:57:29,254 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:57:29,401 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:57:29,596 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:57:29,775 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:57:30,075 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:57:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:32,006 INFO L93 Difference]: Finished difference Result 826 states and 1069 transitions. [2019-09-10 07:57:32,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:57:32,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-10 07:57:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:32,009 INFO L225 Difference]: With dead ends: 826 [2019-09-10 07:57:32,010 INFO L226 Difference]: Without dead ends: 826 [2019-09-10 07:57:32,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:57:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-09-10 07:57:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 579. [2019-09-10 07:57:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-10 07:57:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 723 transitions. [2019-09-10 07:57:32,019 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 723 transitions. Word has length 88 [2019-09-10 07:57:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:32,020 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 723 transitions. [2019-09-10 07:57:32,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:57:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 723 transitions. [2019-09-10 07:57:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:32,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:32,021 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:57:32,022 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:32,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1790204216, now seen corresponding path program 1 times [2019-09-10 07:57:32,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:32,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:33,890 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:57:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 07:57:33,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:33,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:57:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:57:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:57:33,892 INFO L87 Difference]: Start difference. First operand 579 states and 723 transitions. Second operand 26 states. [2019-09-10 07:57:34,047 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 07:57:35,038 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 07:57:35,263 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:57:35,537 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-10 07:57:35,909 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2019-09-10 07:57:36,126 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:57:36,339 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:57:36,584 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:57:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:39,944 INFO L93 Difference]: Finished difference Result 773 states and 962 transitions. [2019-09-10 07:57:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:57:39,945 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-09-10 07:57:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:39,946 INFO L225 Difference]: With dead ends: 773 [2019-09-10 07:57:39,946 INFO L226 Difference]: Without dead ends: 773 [2019-09-10 07:57:39,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:57:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-10 07:57:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 590. [2019-09-10 07:57:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-10 07:57:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 739 transitions. [2019-09-10 07:57:39,953 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 739 transitions. Word has length 89 [2019-09-10 07:57:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:39,953 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 739 transitions. [2019-09-10 07:57:39,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:57:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 739 transitions. [2019-09-10 07:57:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:39,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:39,955 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:57:39,955 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash -363234600, now seen corresponding path program 1 times [2019-09-10 07:57:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:39,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:39,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:40,658 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:57:40,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:40,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:57:40,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:40,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:57:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:57:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:57:40,660 INFO L87 Difference]: Start difference. First operand 590 states and 739 transitions. Second operand 17 states. [2019-09-10 07:57:41,274 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:43,037 INFO L93 Difference]: Finished difference Result 1123 states and 1478 transitions. [2019-09-10 07:57:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:57:43,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-10 07:57:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:43,039 INFO L225 Difference]: With dead ends: 1123 [2019-09-10 07:57:43,039 INFO L226 Difference]: Without dead ends: 1123 [2019-09-10 07:57:43,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:57:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-09-10 07:57:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 559. [2019-09-10 07:57:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-10 07:57:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 695 transitions. [2019-09-10 07:57:43,048 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 695 transitions. Word has length 89 [2019-09-10 07:57:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:43,048 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 695 transitions. [2019-09-10 07:57:43,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:57:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 695 transitions. [2019-09-10 07:57:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:43,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:43,049 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:57:43,049 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -138543399, now seen corresponding path program 1 times [2019-09-10 07:57:43,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:43,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:43,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:43,421 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:57:43,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:43,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:57:43,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:43,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:57:43,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:57:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:57:43,422 INFO L87 Difference]: Start difference. First operand 559 states and 695 transitions. Second operand 11 states. [2019-09-10 07:57:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:44,146 INFO L93 Difference]: Finished difference Result 945 states and 1225 transitions. [2019-09-10 07:57:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:57:44,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 07:57:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:44,148 INFO L225 Difference]: With dead ends: 945 [2019-09-10 07:57:44,148 INFO L226 Difference]: Without dead ends: 945 [2019-09-10 07:57:44,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:57:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-10 07:57:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 531. [2019-09-10 07:57:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-10 07:57:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 661 transitions. [2019-09-10 07:57:44,158 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 661 transitions. Word has length 89 [2019-09-10 07:57:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:44,158 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 661 transitions. [2019-09-10 07:57:44,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:57:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 661 transitions. [2019-09-10 07:57:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:44,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:44,160 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:57:44,162 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -303870206, now seen corresponding path program 1 times [2019-09-10 07:57:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:44,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:44,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:44,515 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:57:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:44,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:57:44,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:44,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:57:44,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:57:44,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:57:44,516 INFO L87 Difference]: Start difference. First operand 531 states and 661 transitions. Second operand 11 states. [2019-09-10 07:57:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:45,499 INFO L93 Difference]: Finished difference Result 1698 states and 2346 transitions. [2019-09-10 07:57:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:57:45,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 07:57:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:45,502 INFO L225 Difference]: With dead ends: 1698 [2019-09-10 07:57:45,502 INFO L226 Difference]: Without dead ends: 1698 [2019-09-10 07:57:45,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:57:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-10 07:57:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 519. [2019-09-10 07:57:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-10 07:57:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 646 transitions. [2019-09-10 07:57:45,512 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 646 transitions. Word has length 89 [2019-09-10 07:57:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:45,512 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 646 transitions. [2019-09-10 07:57:45,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:57:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 646 transitions. [2019-09-10 07:57:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:45,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:45,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:45,514 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash -957518029, now seen corresponding path program 1 times [2019-09-10 07:57:45,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:45,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:45,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:45,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:45,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:45,982 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:57:45,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:45,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:57:45,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:45,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:57:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:57:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:57:45,984 INFO L87 Difference]: Start difference. First operand 519 states and 646 transitions. Second operand 14 states. [2019-09-10 07:57:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:47,872 INFO L93 Difference]: Finished difference Result 924 states and 1182 transitions. [2019-09-10 07:57:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:57:47,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-10 07:57:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:47,875 INFO L225 Difference]: With dead ends: 924 [2019-09-10 07:57:47,875 INFO L226 Difference]: Without dead ends: 918 [2019-09-10 07:57:47,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:57:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-10 07:57:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 511. [2019-09-10 07:57:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-10 07:57:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 635 transitions. [2019-09-10 07:57:47,884 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 635 transitions. Word has length 89 [2019-09-10 07:57:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:47,884 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 635 transitions. [2019-09-10 07:57:47,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:57:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 635 transitions. [2019-09-10 07:57:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:47,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:47,885 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:57:47,886 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1065628564, now seen corresponding path program 1 times [2019-09-10 07:57:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:47,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:47,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:48,464 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:57:48,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:48,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:57:48,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:48,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:57:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:57:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:57:48,465 INFO L87 Difference]: Start difference. First operand 511 states and 635 transitions. Second operand 14 states. [2019-09-10 07:57:49,221 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:57:49,351 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:57:49,482 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 07:57:49,623 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:57:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:50,855 INFO L93 Difference]: Finished difference Result 787 states and 982 transitions. [2019-09-10 07:57:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:57:50,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-10 07:57:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:50,858 INFO L225 Difference]: With dead ends: 787 [2019-09-10 07:57:50,858 INFO L226 Difference]: Without dead ends: 784 [2019-09-10 07:57:50,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:57:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-10 07:57:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 505. [2019-09-10 07:57:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 07:57:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 628 transitions. [2019-09-10 07:57:50,865 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 628 transitions. Word has length 89 [2019-09-10 07:57:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:50,865 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 628 transitions. [2019-09-10 07:57:50,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:57:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 628 transitions. [2019-09-10 07:57:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:50,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:50,866 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:57:50,866 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 841334007, now seen corresponding path program 1 times [2019-09-10 07:57:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:50,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:50,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:51,236 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:57:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:57:51,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:51,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:57:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:57:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:57:51,238 INFO L87 Difference]: Start difference. First operand 505 states and 628 transitions. Second operand 12 states. [2019-09-10 07:57:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:51,928 INFO L93 Difference]: Finished difference Result 863 states and 1165 transitions. [2019-09-10 07:57:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:57:51,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 07:57:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:51,932 INFO L225 Difference]: With dead ends: 863 [2019-09-10 07:57:51,932 INFO L226 Difference]: Without dead ends: 863 [2019-09-10 07:57:51,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:57:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-10 07:57:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 450. [2019-09-10 07:57:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-10 07:57:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 565 transitions. [2019-09-10 07:57:51,939 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 565 transitions. Word has length 89 [2019-09-10 07:57:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:51,939 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 565 transitions. [2019-09-10 07:57:51,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:57:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 565 transitions. [2019-09-10 07:57:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:57:51,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:51,940 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:57:51,940 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2096385733, now seen corresponding path program 1 times [2019-09-10 07:57:51,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:51,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:52,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:57:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:57:52,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:52,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:57:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:57:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:57:52,638 INFO L87 Difference]: Start difference. First operand 450 states and 565 transitions. Second operand 16 states. [2019-09-10 07:57:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:54,702 INFO L93 Difference]: Finished difference Result 993 states and 1351 transitions. [2019-09-10 07:57:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:57:54,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-10 07:57:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:54,705 INFO L225 Difference]: With dead ends: 993 [2019-09-10 07:57:54,705 INFO L226 Difference]: Without dead ends: 993 [2019-09-10 07:57:54,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:57:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-10 07:57:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 422. [2019-09-10 07:57:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-10 07:57:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 530 transitions. [2019-09-10 07:57:54,712 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 530 transitions. Word has length 89 [2019-09-10 07:57:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:54,713 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 530 transitions. [2019-09-10 07:57:54,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:57:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 530 transitions. [2019-09-10 07:57:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:57:54,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:54,714 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:57:54,714 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2061266405, now seen corresponding path program 1 times [2019-09-10 07:57:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:54,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:54,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:55,053 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:57:55,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:55,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:57:55,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:55,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:57:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:57:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:57:55,055 INFO L87 Difference]: Start difference. First operand 422 states and 530 transitions. Second operand 11 states. [2019-09-10 07:57:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:55,883 INFO L93 Difference]: Finished difference Result 1568 states and 2183 transitions. [2019-09-10 07:57:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:57:55,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-10 07:57:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:55,886 INFO L225 Difference]: With dead ends: 1568 [2019-09-10 07:57:55,887 INFO L226 Difference]: Without dead ends: 1568 [2019-09-10 07:57:55,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:57:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-09-10 07:57:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 382. [2019-09-10 07:57:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-10 07:57:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 476 transitions. [2019-09-10 07:57:55,897 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 476 transitions. Word has length 90 [2019-09-10 07:57:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:55,897 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 476 transitions. [2019-09-10 07:57:55,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:57:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 476 transitions. [2019-09-10 07:57:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:57:55,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:55,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:57:55,899 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:55,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1853534946, now seen corresponding path program 1 times [2019-09-10 07:57:55,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:55,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:56,321 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:57:56,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:56,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:57:56,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:56,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:57:56,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:57:56,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:57:56,322 INFO L87 Difference]: Start difference. First operand 382 states and 476 transitions. Second operand 12 states. [2019-09-10 07:57:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:57,476 INFO L93 Difference]: Finished difference Result 1177 states and 1605 transitions. [2019-09-10 07:57:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:57:57,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:57:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:57,478 INFO L225 Difference]: With dead ends: 1177 [2019-09-10 07:57:57,478 INFO L226 Difference]: Without dead ends: 1177 [2019-09-10 07:57:57,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:57:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-09-10 07:57:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 345. [2019-09-10 07:57:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-10 07:57:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 431 transitions. [2019-09-10 07:57:57,487 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 431 transitions. Word has length 90 [2019-09-10 07:57:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:57,487 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 431 transitions. [2019-09-10 07:57:57,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:57:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 431 transitions. [2019-09-10 07:57:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:57:57,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:57,488 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:57:57,489 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1759645528, now seen corresponding path program 1 times [2019-09-10 07:57:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:57,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:58,183 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:57:58,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:58,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:57:58,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:58,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:57:58,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:57:58,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:57:58,185 INFO L87 Difference]: Start difference. First operand 345 states and 431 transitions. Second operand 16 states. [2019-09-10 07:57:58,798 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:58:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:00,111 INFO L93 Difference]: Finished difference Result 608 states and 765 transitions. [2019-09-10 07:58:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:58:00,117 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-10 07:58:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:00,119 INFO L225 Difference]: With dead ends: 608 [2019-09-10 07:58:00,119 INFO L226 Difference]: Without dead ends: 608 [2019-09-10 07:58:00,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:58:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-10 07:58:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 363. [2019-09-10 07:58:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-10 07:58:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 452 transitions. [2019-09-10 07:58:00,125 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 452 transitions. Word has length 90 [2019-09-10 07:58:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:00,125 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 452 transitions. [2019-09-10 07:58:00,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:58:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 452 transitions. [2019-09-10 07:58:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:58:00,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:00,126 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:58:00,127 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash -576618081, now seen corresponding path program 1 times [2019-09-10 07:58:00,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:00,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:00,764 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:58:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:58:00,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:00,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:58:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:58:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:00,766 INFO L87 Difference]: Start difference. First operand 363 states and 452 transitions. Second operand 15 states. [2019-09-10 07:58:01,384 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:58:01,517 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:58:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:02,160 INFO L93 Difference]: Finished difference Result 559 states and 738 transitions. [2019-09-10 07:58:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:58:02,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-10 07:58:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:02,162 INFO L225 Difference]: With dead ends: 559 [2019-09-10 07:58:02,162 INFO L226 Difference]: Without dead ends: 559 [2019-09-10 07:58:02,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:58:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-10 07:58:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 357. [2019-09-10 07:58:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-10 07:58:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 445 transitions. [2019-09-10 07:58:02,167 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 445 transitions. Word has length 90 [2019-09-10 07:58:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:02,168 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 445 transitions. [2019-09-10 07:58:02,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:58:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 445 transitions. [2019-09-10 07:58:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:58:02,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:02,169 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:58:02,169 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1327171516, now seen corresponding path program 1 times [2019-09-10 07:58:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:02,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:02,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:02,603 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:58:02,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:02,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:58:02,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:02,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:58:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:58:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:58:02,604 INFO L87 Difference]: Start difference. First operand 357 states and 445 transitions. Second operand 12 states. [2019-09-10 07:58:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:03,642 INFO L93 Difference]: Finished difference Result 578 states and 734 transitions. [2019-09-10 07:58:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:58:03,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:58:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:03,644 INFO L225 Difference]: With dead ends: 578 [2019-09-10 07:58:03,645 INFO L226 Difference]: Without dead ends: 578 [2019-09-10 07:58:03,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:58:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-10 07:58:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 353. [2019-09-10 07:58:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-10 07:58:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 440 transitions. [2019-09-10 07:58:03,649 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 440 transitions. Word has length 90 [2019-09-10 07:58:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:03,650 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 440 transitions. [2019-09-10 07:58:03,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:58:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 440 transitions. [2019-09-10 07:58:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:58:03,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:03,651 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:58:03,651 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -863961032, now seen corresponding path program 1 times [2019-09-10 07:58:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:03,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:03,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:03,801 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:58:03,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:58:03,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:03,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:58:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:58:03,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:58:03,803 INFO L87 Difference]: Start difference. First operand 353 states and 440 transitions. Second operand 9 states. [2019-09-10 07:58:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:04,614 INFO L93 Difference]: Finished difference Result 558 states and 714 transitions. [2019-09-10 07:58:04,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:58:04,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:58:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:04,616 INFO L225 Difference]: With dead ends: 558 [2019-09-10 07:58:04,616 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 07:58:04,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:58:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 07:58:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 353. [2019-09-10 07:58:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-10 07:58:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 438 transitions. [2019-09-10 07:58:04,622 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 438 transitions. Word has length 91 [2019-09-10 07:58:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:04,622 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 438 transitions. [2019-09-10 07:58:04,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:58:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 438 transitions. [2019-09-10 07:58:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:58:04,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:04,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:04,623 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2010479467, now seen corresponding path program 1 times [2019-09-10 07:58:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:04,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:04,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:05,185 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:58:05,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:05,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:58:05,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:05,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:58:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:58:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:58:05,186 INFO L87 Difference]: Start difference. First operand 353 states and 438 transitions. Second operand 13 states. [2019-09-10 07:58:05,656 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 07:58:05,795 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 07:58:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:06,107 INFO L93 Difference]: Finished difference Result 624 states and 835 transitions. [2019-09-10 07:58:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:58:06,107 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-10 07:58:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:06,109 INFO L225 Difference]: With dead ends: 624 [2019-09-10 07:58:06,110 INFO L226 Difference]: Without dead ends: 624 [2019-09-10 07:58:06,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:58:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-10 07:58:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 304. [2019-09-10 07:58:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 07:58:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 382 transitions. [2019-09-10 07:58:06,115 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 382 transitions. Word has length 91 [2019-09-10 07:58:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:06,115 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 382 transitions. [2019-09-10 07:58:06,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:58:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 382 transitions. [2019-09-10 07:58:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:58:06,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:06,116 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:58:06,116 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash -767603588, now seen corresponding path program 1 times [2019-09-10 07:58:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:06,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:06,265 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:58:06,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:06,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:58:06,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:06,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:58:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:58:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:58:06,267 INFO L87 Difference]: Start difference. First operand 304 states and 382 transitions. Second operand 9 states. [2019-09-10 07:58:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:06,930 INFO L93 Difference]: Finished difference Result 488 states and 632 transitions. [2019-09-10 07:58:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:58:06,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:58:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:06,932 INFO L225 Difference]: With dead ends: 488 [2019-09-10 07:58:06,932 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 07:58:06,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:58:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 07:58:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 304. [2019-09-10 07:58:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 07:58:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 381 transitions. [2019-09-10 07:58:06,936 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 381 transitions. Word has length 92 [2019-09-10 07:58:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:06,936 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 381 transitions. [2019-09-10 07:58:06,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:58:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 381 transitions. [2019-09-10 07:58:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:58:06,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:06,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:06,937 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1562795773, now seen corresponding path program 1 times [2019-09-10 07:58:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:06,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:08,382 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:58:08,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 07:58:08,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:58:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:58:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:58:08,384 INFO L87 Difference]: Start difference. First operand 304 states and 381 transitions. Second operand 26 states. [2019-09-10 07:58:09,460 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:58:09,633 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:58:09,870 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:58:10,050 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:58:10,221 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:58:10,517 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:58:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:13,240 INFO L93 Difference]: Finished difference Result 1083 states and 1482 transitions. [2019-09-10 07:58:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:58:13,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-09-10 07:58:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:13,243 INFO L225 Difference]: With dead ends: 1083 [2019-09-10 07:58:13,244 INFO L226 Difference]: Without dead ends: 1083 [2019-09-10 07:58:13,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=399, Invalid=1953, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:58:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-09-10 07:58:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 324. [2019-09-10 07:58:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-10 07:58:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 405 transitions. [2019-09-10 07:58:13,251 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 405 transitions. Word has length 93 [2019-09-10 07:58:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:13,251 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 405 transitions. [2019-09-10 07:58:13,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:58:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 405 transitions. [2019-09-10 07:58:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:58:13,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:13,252 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:58:13,253 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash -910660000, now seen corresponding path program 1 times [2019-09-10 07:58:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:13,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:14,357 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:58:14,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:14,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:58:14,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:14,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:58:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:58:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:58:14,358 INFO L87 Difference]: Start difference. First operand 324 states and 405 transitions. Second operand 21 states. [2019-09-10 07:58:15,259 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:58:15,507 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:58:15,679 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:58:15,842 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:58:16,040 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:58:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:17,058 INFO L93 Difference]: Finished difference Result 633 states and 841 transitions. [2019-09-10 07:58:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:58:17,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 94 [2019-09-10 07:58:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:17,060 INFO L225 Difference]: With dead ends: 633 [2019-09-10 07:58:17,060 INFO L226 Difference]: Without dead ends: 633 [2019-09-10 07:58:17,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:58:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-10 07:58:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 325. [2019-09-10 07:58:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-10 07:58:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 406 transitions. [2019-09-10 07:58:17,066 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 406 transitions. Word has length 94 [2019-09-10 07:58:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:17,067 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 406 transitions. [2019-09-10 07:58:17,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:58:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 406 transitions. [2019-09-10 07:58:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:58:17,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:17,068 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:58:17,068 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash -959528058, now seen corresponding path program 1 times [2019-09-10 07:58:17,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:17,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:17,756 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:58:17,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:17,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:58:17,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:17,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:58:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:58:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:58:17,757 INFO L87 Difference]: Start difference. First operand 325 states and 406 transitions. Second operand 16 states. [2019-09-10 07:58:18,382 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:58:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:19,771 INFO L93 Difference]: Finished difference Result 1053 states and 1449 transitions. [2019-09-10 07:58:19,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:58:19,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-09-10 07:58:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:19,773 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 07:58:19,773 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 07:58:19,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:58:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 07:58:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 304. [2019-09-10 07:58:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-10 07:58:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 380 transitions. [2019-09-10 07:58:19,781 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 380 transitions. Word has length 94 [2019-09-10 07:58:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:19,781 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 380 transitions. [2019-09-10 07:58:19,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:58:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 380 transitions. [2019-09-10 07:58:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:58:19,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:19,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:19,783 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -333235878, now seen corresponding path program 1 times [2019-09-10 07:58:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:19,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:19,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:20,211 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:58:20,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:20,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:58:20,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:20,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:58:20,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:58:20,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:58:20,212 INFO L87 Difference]: Start difference. First operand 304 states and 380 transitions. Second operand 12 states. [2019-09-10 07:58:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:21,229 INFO L93 Difference]: Finished difference Result 760 states and 1026 transitions. [2019-09-10 07:58:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:58:21,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-10 07:58:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:21,231 INFO L225 Difference]: With dead ends: 760 [2019-09-10 07:58:21,231 INFO L226 Difference]: Without dead ends: 760 [2019-09-10 07:58:21,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:58:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-10 07:58:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 298. [2019-09-10 07:58:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-10 07:58:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 374 transitions. [2019-09-10 07:58:21,238 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 374 transitions. Word has length 94 [2019-09-10 07:58:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:21,238 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 374 transitions. [2019-09-10 07:58:21,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:58:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 374 transitions. [2019-09-10 07:58:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:58:21,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:21,239 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:58:21,239 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash -442414623, now seen corresponding path program 1 times [2019-09-10 07:58:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:21,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:23,214 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:58:23,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:23,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 07:58:23,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:23,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:58:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:58:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:58:23,216 INFO L87 Difference]: Start difference. First operand 298 states and 374 transitions. Second operand 28 states. [2019-09-10 07:58:23,487 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:58:24,166 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:58:24,356 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:58:24,608 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:58:24,923 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:58:25,174 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 07:58:25,460 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 07:58:25,770 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:58:26,045 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:58:26,313 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:58:26,596 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:58:26,905 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:58:27,127 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:58:27,359 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:58:27,643 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:58:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:28,999 INFO L93 Difference]: Finished difference Result 362 states and 437 transitions. [2019-09-10 07:58:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:58:28,999 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-10 07:58:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:29,000 INFO L225 Difference]: With dead ends: 362 [2019-09-10 07:58:29,000 INFO L226 Difference]: Without dead ends: 362 [2019-09-10 07:58:29,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=499, Invalid=2051, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:58:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-10 07:58:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 310. [2019-09-10 07:58:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 07:58:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 387 transitions. [2019-09-10 07:58:29,005 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 387 transitions. Word has length 94 [2019-09-10 07:58:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:29,005 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 387 transitions. [2019-09-10 07:58:29,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:58:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 387 transitions. [2019-09-10 07:58:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:58:29,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:29,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, 1, 1, 1, 1] [2019-09-10 07:58:29,006 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 596288672, now seen corresponding path program 1 times [2019-09-10 07:58:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:29,371 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:58:29,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:29,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:58:29,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:29,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:58:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:58:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:58:29,373 INFO L87 Difference]: Start difference. First operand 310 states and 387 transitions. Second operand 9 states. [2019-09-10 07:58:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:29,774 INFO L93 Difference]: Finished difference Result 664 states and 923 transitions. [2019-09-10 07:58:29,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:29,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 07:58:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:29,775 INFO L225 Difference]: With dead ends: 664 [2019-09-10 07:58:29,775 INFO L226 Difference]: Without dead ends: 664 [2019-09-10 07:58:29,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-10 07:58:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 264. [2019-09-10 07:58:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-10 07:58:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 337 transitions. [2019-09-10 07:58:29,780 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 337 transitions. Word has length 95 [2019-09-10 07:58:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:29,780 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 337 transitions. [2019-09-10 07:58:29,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:58:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 337 transitions. [2019-09-10 07:58:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 07:58:29,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:29,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:29,781 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -467440922, now seen corresponding path program 1 times [2019-09-10 07:58:29,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:29,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:29,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:29,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:29,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:29,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:29,866 INFO L87 Difference]: Start difference. First operand 264 states and 337 transitions. Second operand 3 states. [2019-09-10 07:58:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:29,898 INFO L93 Difference]: Finished difference Result 384 states and 509 transitions. [2019-09-10 07:58:29,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:29,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 07:58:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:29,899 INFO L225 Difference]: With dead ends: 384 [2019-09-10 07:58:29,900 INFO L226 Difference]: Without dead ends: 384 [2019-09-10 07:58:29,900 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:58:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-10 07:58:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-09-10 07:58:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-10 07:58:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 508 transitions. [2019-09-10 07:58:29,904 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 508 transitions. Word has length 122 [2019-09-10 07:58:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:29,905 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 508 transitions. [2019-09-10 07:58:29,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 508 transitions. [2019-09-10 07:58:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:29,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:29,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:29,906 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1042185839, now seen corresponding path program 1 times [2019-09-10 07:58:29,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:29,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:29,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:29,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:30,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:30,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:30,003 INFO L87 Difference]: Start difference. First operand 382 states and 508 transitions. Second operand 7 states. [2019-09-10 07:58:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:30,392 INFO L93 Difference]: Finished difference Result 904 states and 1243 transitions. [2019-09-10 07:58:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:30,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:58:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:30,394 INFO L225 Difference]: With dead ends: 904 [2019-09-10 07:58:30,394 INFO L226 Difference]: Without dead ends: 904 [2019-09-10 07:58:30,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-10 07:58:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 442. [2019-09-10 07:58:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 07:58:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 590 transitions. [2019-09-10 07:58:30,400 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 590 transitions. Word has length 124 [2019-09-10 07:58:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:30,400 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 590 transitions. [2019-09-10 07:58:30,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 590 transitions. [2019-09-10 07:58:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:30,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:30,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,401 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -611885514, now seen corresponding path program 1 times [2019-09-10 07:58:30,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:30,458 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:58:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:30,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:30,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:30,459 INFO L87 Difference]: Start difference. First operand 442 states and 590 transitions. Second operand 3 states. [2019-09-10 07:58:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:30,488 INFO L93 Difference]: Finished difference Result 716 states and 969 transitions. [2019-09-10 07:58:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:30,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 07:58:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:30,489 INFO L225 Difference]: With dead ends: 716 [2019-09-10 07:58:30,489 INFO L226 Difference]: Without dead ends: 716 [2019-09-10 07:58:30,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-10 07:58:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 714. [2019-09-10 07:58:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-10 07:58:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 968 transitions. [2019-09-10 07:58:30,497 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 968 transitions. Word has length 124 [2019-09-10 07:58:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:30,497 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 968 transitions. [2019-09-10 07:58:30,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 968 transitions. [2019-09-10 07:58:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:30,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:30,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:30,499 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash -545392002, now seen corresponding path program 1 times [2019-09-10 07:58:30,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:30,580 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:58:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:30,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:30,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:30,581 INFO L87 Difference]: Start difference. First operand 714 states and 968 transitions. Second operand 3 states. [2019-09-10 07:58:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:30,618 INFO L93 Difference]: Finished difference Result 1012 states and 1379 transitions. [2019-09-10 07:58:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:30,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 07:58:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:30,620 INFO L225 Difference]: With dead ends: 1012 [2019-09-10 07:58:30,620 INFO L226 Difference]: Without dead ends: 1012 [2019-09-10 07:58:30,621 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:58:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-09-10 07:58:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1010. [2019-09-10 07:58:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-09-10 07:58:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1378 transitions. [2019-09-10 07:58:30,627 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1378 transitions. Word has length 124 [2019-09-10 07:58:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:30,628 INFO L475 AbstractCegarLoop]: Abstraction has 1010 states and 1378 transitions. [2019-09-10 07:58:30,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1378 transitions. [2019-09-10 07:58:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:30,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:30,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:30,629 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash -850819473, now seen corresponding path program 1 times [2019-09-10 07:58:30,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:30,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:30,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:30,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:30,747 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:58:30,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:30,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:30,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:30,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:30,748 INFO L87 Difference]: Start difference. First operand 1010 states and 1378 transitions. Second operand 7 states. [2019-09-10 07:58:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:31,206 INFO L93 Difference]: Finished difference Result 3384 states and 4663 transitions. [2019-09-10 07:58:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:31,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:58:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:31,210 INFO L225 Difference]: With dead ends: 3384 [2019-09-10 07:58:31,210 INFO L226 Difference]: Without dead ends: 3384 [2019-09-10 07:58:31,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-09-10 07:58:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2002. [2019-09-10 07:58:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-09-10 07:58:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2776 transitions. [2019-09-10 07:58:31,231 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2776 transitions. Word has length 124 [2019-09-10 07:58:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:31,231 INFO L475 AbstractCegarLoop]: Abstraction has 2002 states and 2776 transitions. [2019-09-10 07:58:31,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2776 transitions. [2019-09-10 07:58:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:31,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:31,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:31,233 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1444234351, now seen corresponding path program 1 times [2019-09-10 07:58:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:31,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:31,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:31,382 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:58:31,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:31,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:31,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:31,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:31,384 INFO L87 Difference]: Start difference. First operand 2002 states and 2776 transitions. Second operand 7 states. [2019-09-10 07:58:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:31,846 INFO L93 Difference]: Finished difference Result 6480 states and 8971 transitions. [2019-09-10 07:58:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:31,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:58:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:31,854 INFO L225 Difference]: With dead ends: 6480 [2019-09-10 07:58:31,854 INFO L226 Difference]: Without dead ends: 6480 [2019-09-10 07:58:31,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-09-10 07:58:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 4106. [2019-09-10 07:58:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-09-10 07:58:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 5740 transitions. [2019-09-10 07:58:31,900 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 5740 transitions. Word has length 124 [2019-09-10 07:58:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:31,900 INFO L475 AbstractCegarLoop]: Abstraction has 4106 states and 5740 transitions. [2019-09-10 07:58:31,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5740 transitions. [2019-09-10 07:58:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:31,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:31,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:31,902 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash -154008977, now seen corresponding path program 1 times [2019-09-10 07:58:31,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:31,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:31,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:31,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:32,022 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:58:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:32,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:32,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:32,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:32,023 INFO L87 Difference]: Start difference. First operand 4106 states and 5740 transitions. Second operand 7 states. [2019-09-10 07:58:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:32,491 INFO L93 Difference]: Finished difference Result 14256 states and 19855 transitions. [2019-09-10 07:58:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:32,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:58:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:32,503 INFO L225 Difference]: With dead ends: 14256 [2019-09-10 07:58:32,503 INFO L226 Difference]: Without dead ends: 14256 [2019-09-10 07:58:32,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14256 states. [2019-09-10 07:58:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14256 to 8554. [2019-09-10 07:58:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8554 states. [2019-09-10 07:58:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8554 states to 8554 states and 12004 transitions. [2019-09-10 07:58:32,633 INFO L78 Accepts]: Start accepts. Automaton has 8554 states and 12004 transitions. Word has length 124 [2019-09-10 07:58:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:32,633 INFO L475 AbstractCegarLoop]: Abstraction has 8554 states and 12004 transitions. [2019-09-10 07:58:32,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8554 states and 12004 transitions. [2019-09-10 07:58:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 07:58:32,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:32,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:32,635 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1325383791, now seen corresponding path program 1 times [2019-09-10 07:58:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:32,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:32,725 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:58:32,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:32,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:32,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:32,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:32,726 INFO L87 Difference]: Start difference. First operand 8554 states and 12004 transitions. Second operand 7 states. [2019-09-10 07:58:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:33,211 INFO L93 Difference]: Finished difference Result 24368 states and 34081 transitions. [2019-09-10 07:58:33,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:58:33,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-10 07:58:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:33,232 INFO L225 Difference]: With dead ends: 24368 [2019-09-10 07:58:33,232 INFO L226 Difference]: Without dead ends: 24368 [2019-09-10 07:58:33,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:58:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24368 states. [2019-09-10 07:58:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24368 to 14234. [2019-09-10 07:58:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2019-09-10 07:58:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 20012 transitions. [2019-09-10 07:58:33,426 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 20012 transitions. Word has length 124 [2019-09-10 07:58:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:33,426 INFO L475 AbstractCegarLoop]: Abstraction has 14234 states and 20012 transitions. [2019-09-10 07:58:33,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 20012 transitions. [2019-09-10 07:58:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 07:58:33,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:33,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:33,430 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1768680915, now seen corresponding path program 1 times [2019-09-10 07:58:33,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:33,499 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:58:33,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:33,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:33,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:33,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:33,501 INFO L87 Difference]: Start difference. First operand 14234 states and 20012 transitions. Second operand 3 states. [2019-09-10 07:58:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:33,585 INFO L93 Difference]: Finished difference Result 13372 states and 18573 transitions. [2019-09-10 07:58:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:33,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 07:58:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:33,599 INFO L225 Difference]: With dead ends: 13372 [2019-09-10 07:58:33,600 INFO L226 Difference]: Without dead ends: 13372 [2019-09-10 07:58:33,600 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:58:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2019-09-10 07:58:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 10170. [2019-09-10 07:58:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2019-09-10 07:58:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 14110 transitions. [2019-09-10 07:58:33,694 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 14110 transitions. Word has length 125 [2019-09-10 07:58:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:33,695 INFO L475 AbstractCegarLoop]: Abstraction has 10170 states and 14110 transitions. [2019-09-10 07:58:33,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 14110 transitions. [2019-09-10 07:58:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:58:33,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:33,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:33,697 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash 233216673, now seen corresponding path program 1 times [2019-09-10 07:58:33,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:33,761 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:58:33,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:33,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:33,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:33,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:33,762 INFO L87 Difference]: Start difference. First operand 10170 states and 14110 transitions. Second operand 3 states. [2019-09-10 07:58:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:33,794 INFO L93 Difference]: Finished difference Result 9776 states and 13379 transitions. [2019-09-10 07:58:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:33,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:58:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:33,803 INFO L225 Difference]: With dead ends: 9776 [2019-09-10 07:58:33,803 INFO L226 Difference]: Without dead ends: 9776 [2019-09-10 07:58:33,803 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:58:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9776 states. [2019-09-10 07:58:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9776 to 9102. [2019-09-10 07:58:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9102 states. [2019-09-10 07:58:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 12574 transitions. [2019-09-10 07:58:33,869 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 12574 transitions. Word has length 126 [2019-09-10 07:58:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:33,870 INFO L475 AbstractCegarLoop]: Abstraction has 9102 states and 12574 transitions. [2019-09-10 07:58:33,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 12574 transitions. [2019-09-10 07:58:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:58:33,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:33,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:33,871 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1710481623, now seen corresponding path program 1 times [2019-09-10 07:58:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:33,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:33,929 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:58:33,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:33,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:33,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:33,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:33,931 INFO L87 Difference]: Start difference. First operand 9102 states and 12574 transitions. Second operand 3 states. [2019-09-10 07:58:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:33,969 INFO L93 Difference]: Finished difference Result 10040 states and 13809 transitions. [2019-09-10 07:58:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:33,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:58:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:33,977 INFO L225 Difference]: With dead ends: 10040 [2019-09-10 07:58:33,977 INFO L226 Difference]: Without dead ends: 10040 [2019-09-10 07:58:33,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-09-10 07:58:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 10038. [2019-09-10 07:58:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10038 states. [2019-09-10 07:58:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10038 states to 10038 states and 13808 transitions. [2019-09-10 07:58:34,050 INFO L78 Accepts]: Start accepts. Automaton has 10038 states and 13808 transitions. Word has length 127 [2019-09-10 07:58:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:34,050 INFO L475 AbstractCegarLoop]: Abstraction has 10038 states and 13808 transitions. [2019-09-10 07:58:34,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10038 states and 13808 transitions. [2019-09-10 07:58:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:58:34,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:34,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:34,051 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash -113713814, now seen corresponding path program 1 times [2019-09-10 07:58:34,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:34,141 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:58:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:34,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:58:34,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:34,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:58:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:58:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:58:34,142 INFO L87 Difference]: Start difference. First operand 10038 states and 13808 transitions. Second operand 6 states. [2019-09-10 07:58:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:34,238 INFO L93 Difference]: Finished difference Result 15120 states and 20597 transitions. [2019-09-10 07:58:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:58:34,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 07:58:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:34,250 INFO L225 Difference]: With dead ends: 15120 [2019-09-10 07:58:34,250 INFO L226 Difference]: Without dead ends: 15120 [2019-09-10 07:58:34,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:58:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15120 states. [2019-09-10 07:58:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15120 to 10146. [2019-09-10 07:58:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10146 states. [2019-09-10 07:58:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 13880 transitions. [2019-09-10 07:58:34,346 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 13880 transitions. Word has length 127 [2019-09-10 07:58:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:34,346 INFO L475 AbstractCegarLoop]: Abstraction has 10146 states and 13880 transitions. [2019-09-10 07:58:34,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:58:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 13880 transitions. [2019-09-10 07:58:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 07:58:34,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:34,351 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:34,351 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash -36770884, now seen corresponding path program 1 times [2019-09-10 07:58:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:34,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:34,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:34,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:34,448 INFO L87 Difference]: Start difference. First operand 10146 states and 13880 transitions. Second operand 3 states. [2019-09-10 07:58:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:34,491 INFO L93 Difference]: Finished difference Result 17048 states and 23265 transitions. [2019-09-10 07:58:34,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:34,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 07:58:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:34,506 INFO L225 Difference]: With dead ends: 17048 [2019-09-10 07:58:34,506 INFO L226 Difference]: Without dead ends: 17048 [2019-09-10 07:58:34,506 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:58:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17048 states. [2019-09-10 07:58:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17048 to 16086. [2019-09-10 07:58:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2019-09-10 07:58:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 22104 transitions. [2019-09-10 07:58:34,640 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 22104 transitions. Word has length 158 [2019-09-10 07:58:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:34,640 INFO L475 AbstractCegarLoop]: Abstraction has 16086 states and 22104 transitions. [2019-09-10 07:58:34,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 22104 transitions. [2019-09-10 07:58:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 07:58:34,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:34,644 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:34,644 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 257185900, now seen corresponding path program 1 times [2019-09-10 07:58:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:34,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:35,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:35,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:35,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-09-10 07:58:35,377 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4194], [4199], [4202], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 07:58:35,423 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:35,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:35,726 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:36,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:36,786 INFO L272 AbstractInterpreter]: Visited 142 different actions 567 times. Merged at 49 different actions 386 times. Widened at 22 different actions 84 times. Performed 2526 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 14 different actions. Largest state had 449 variables. [2019-09-10 07:58:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:36,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:36,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:36,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:58:36,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:36,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:37,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:58:37,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:58:37,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:58:37,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:58:37,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 07:58:37,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:37,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:37,502 INFO L87 Difference]: Start difference. First operand 16086 states and 22104 transitions. Second operand 7 states. [2019-09-10 07:58:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:38,090 INFO L93 Difference]: Finished difference Result 79828 states and 109569 transitions. [2019-09-10 07:58:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:58:38,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 07:58:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:38,263 INFO L225 Difference]: With dead ends: 79828 [2019-09-10 07:58:38,263 INFO L226 Difference]: Without dead ends: 79828 [2019-09-10 07:58:38,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79828 states. [2019-09-10 07:58:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79828 to 26238. [2019-09-10 07:58:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26238 states. [2019-09-10 07:58:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26238 states to 26238 states and 35928 transitions. [2019-09-10 07:58:39,062 INFO L78 Accepts]: Start accepts. Automaton has 26238 states and 35928 transitions. Word has length 159 [2019-09-10 07:58:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:39,062 INFO L475 AbstractCegarLoop]: Abstraction has 26238 states and 35928 transitions. [2019-09-10 07:58:39,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26238 states and 35928 transitions. [2019-09-10 07:58:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 07:58:39,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:39,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:39,071 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1635819412, now seen corresponding path program 1 times [2019-09-10 07:58:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:39,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:39,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:39,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:39,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:39,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-09-10 07:58:39,275 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 07:58:39,281 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:39,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:39,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:40,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:40,348 INFO L272 AbstractInterpreter]: Visited 142 different actions 582 times. Merged at 49 different actions 399 times. Widened at 20 different actions 73 times. Performed 2533 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2533 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 449 variables. [2019-09-10 07:58:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:40,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:40,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:40,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:58:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:40,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:40,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:58:40,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:58:41,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:58:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:58:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 07:58:41,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:41,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:41,134 INFO L87 Difference]: Start difference. First operand 26238 states and 35928 transitions. Second operand 7 states. [2019-09-10 07:58:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:41,719 INFO L93 Difference]: Finished difference Result 89450 states and 122596 transitions. [2019-09-10 07:58:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:58:41,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 07:58:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:41,917 INFO L225 Difference]: With dead ends: 89450 [2019-09-10 07:58:41,917 INFO L226 Difference]: Without dead ends: 89450 [2019-09-10 07:58:41,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89450 states. [2019-09-10 07:58:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89450 to 41418. [2019-09-10 07:58:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41418 states. [2019-09-10 07:58:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41418 states to 41418 states and 56544 transitions. [2019-09-10 07:58:42,667 INFO L78 Accepts]: Start accepts. Automaton has 41418 states and 56544 transitions. Word has length 159 [2019-09-10 07:58:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:42,667 INFO L475 AbstractCegarLoop]: Abstraction has 41418 states and 56544 transitions. [2019-09-10 07:58:42,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 41418 states and 56544 transitions. [2019-09-10 07:58:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 07:58:42,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:42,675 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:42,675 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 540383852, now seen corresponding path program 1 times [2019-09-10 07:58:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:42,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:42,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:42,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:42,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:42,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:42,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:42,805 INFO L87 Difference]: Start difference. First operand 41418 states and 56544 transitions. Second operand 3 states. [2019-09-10 07:58:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:42,908 INFO L93 Difference]: Finished difference Result 38180 states and 51145 transitions. [2019-09-10 07:58:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:42,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 07:58:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:42,960 INFO L225 Difference]: With dead ends: 38180 [2019-09-10 07:58:42,960 INFO L226 Difference]: Without dead ends: 38180 [2019-09-10 07:58:42,961 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:58:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38180 states. [2019-09-10 07:58:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38180 to 37098. [2019-09-10 07:58:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37098 states. [2019-09-10 07:58:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37098 states to 37098 states and 49794 transitions. [2019-09-10 07:58:44,625 INFO L78 Accepts]: Start accepts. Automaton has 37098 states and 49794 transitions. Word has length 159 [2019-09-10 07:58:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:44,626 INFO L475 AbstractCegarLoop]: Abstraction has 37098 states and 49794 transitions. [2019-09-10 07:58:44,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 37098 states and 49794 transitions. [2019-09-10 07:58:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 07:58:44,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:44,632 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:44,633 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 705646096, now seen corresponding path program 1 times [2019-09-10 07:58:44,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:44,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:44,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:44,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:58:44,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:44,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:58:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:58:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:58:44,750 INFO L87 Difference]: Start difference. First operand 37098 states and 49794 transitions. Second operand 3 states. [2019-09-10 07:58:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:44,896 INFO L93 Difference]: Finished difference Result 45220 states and 59677 transitions. [2019-09-10 07:58:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:58:44,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 07:58:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:44,959 INFO L225 Difference]: With dead ends: 45220 [2019-09-10 07:58:44,959 INFO L226 Difference]: Without dead ends: 45220 [2019-09-10 07:58:44,959 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:58:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45220 states. [2019-09-10 07:58:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45220 to 43218. [2019-09-10 07:58:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43218 states. [2019-09-10 07:58:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43218 states to 43218 states and 57276 transitions. [2019-09-10 07:58:45,508 INFO L78 Accepts]: Start accepts. Automaton has 43218 states and 57276 transitions. Word has length 160 [2019-09-10 07:58:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:45,509 INFO L475 AbstractCegarLoop]: Abstraction has 43218 states and 57276 transitions. [2019-09-10 07:58:45,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43218 states and 57276 transitions. [2019-09-10 07:58:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 07:58:45,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:45,516 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:45,516 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1342590488, now seen corresponding path program 1 times [2019-09-10 07:58:45,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:45,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:45,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:45,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:45,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:45,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 07:58:45,877 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4260], [4265], [4268], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 07:58:45,890 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:45,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:46,066 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:47,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:47,282 INFO L272 AbstractInterpreter]: Visited 150 different actions 820 times. Merged at 57 different actions 586 times. Widened at 24 different actions 104 times. Performed 3303 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3303 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 68 fixpoints after 18 different actions. Largest state had 451 variables. [2019-09-10 07:58:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:47,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:47,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:47,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:47,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:47,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:47,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:58:47,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:58:47,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:58:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:58:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 20 [2019-09-10 07:58:47,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:47,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:58:47,965 INFO L87 Difference]: Start difference. First operand 43218 states and 57276 transitions. Second operand 7 states. [2019-09-10 07:58:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:48,293 INFO L93 Difference]: Finished difference Result 104236 states and 138689 transitions. [2019-09-10 07:58:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:58:48,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 07:58:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:48,395 INFO L225 Difference]: With dead ends: 104236 [2019-09-10 07:58:48,396 INFO L226 Difference]: Without dead ends: 104236 [2019-09-10 07:58:48,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:58:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104236 states. [2019-09-10 07:58:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104236 to 53826. [2019-09-10 07:58:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53826 states. [2019-09-10 07:58:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53826 states to 53826 states and 71292 transitions. [2019-09-10 07:58:49,032 INFO L78 Accepts]: Start accepts. Automaton has 53826 states and 71292 transitions. Word has length 161 [2019-09-10 07:58:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:49,033 INFO L475 AbstractCegarLoop]: Abstraction has 53826 states and 71292 transitions. [2019-09-10 07:58:49,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 53826 states and 71292 transitions. [2019-09-10 07:58:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 07:58:49,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:49,038 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:49,038 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -255652840, now seen corresponding path program 1 times [2019-09-10 07:58:49,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:49,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:49,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:49,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:49,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:49,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 07:58:49,480 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4238], [4243], [4246], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 07:58:49,483 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:49,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:49,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:50,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:50,645 INFO L272 AbstractInterpreter]: Visited 150 different actions 900 times. Merged at 57 different actions 658 times. Widened at 25 different actions 132 times. Performed 3569 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 16 different actions. Largest state had 451 variables. [2019-09-10 07:58:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:50,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:50,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:50,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:50,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:50,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:50,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:58:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:58:51,119 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:58:51,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:58:51,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 07:58:51,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:51,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:51,207 INFO L87 Difference]: Start difference. First operand 53826 states and 71292 transitions. Second operand 7 states. [2019-09-10 07:58:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:51,501 INFO L93 Difference]: Finished difference Result 115240 states and 153257 transitions. [2019-09-10 07:58:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:58:51,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 07:58:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:51,616 INFO L225 Difference]: With dead ends: 115240 [2019-09-10 07:58:51,616 INFO L226 Difference]: Without dead ends: 115240 [2019-09-10 07:58:51,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:58:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115240 states. [2019-09-10 07:58:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115240 to 64434. [2019-09-10 07:58:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64434 states. [2019-09-10 07:58:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64434 states to 64434 states and 85308 transitions. [2019-09-10 07:58:52,619 INFO L78 Accepts]: Start accepts. Automaton has 64434 states and 85308 transitions. Word has length 161 [2019-09-10 07:58:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:52,619 INFO L475 AbstractCegarLoop]: Abstraction has 64434 states and 85308 transitions. [2019-09-10 07:58:52,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 64434 states and 85308 transitions. [2019-09-10 07:58:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 07:58:52,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:52,625 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:52,625 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1223739928, now seen corresponding path program 1 times [2019-09-10 07:58:52,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:52,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:52,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:58:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:58:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:58:52,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:58:52,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:58:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:58:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:58:52,790 INFO L87 Difference]: Start difference. First operand 64434 states and 85308 transitions. Second operand 7 states. [2019-09-10 07:58:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:53,175 INFO L93 Difference]: Finished difference Result 126244 states and 167825 transitions. [2019-09-10 07:58:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:58:53,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 07:58:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:53,305 INFO L225 Difference]: With dead ends: 126244 [2019-09-10 07:58:53,306 INFO L226 Difference]: Without dead ends: 126244 [2019-09-10 07:58:53,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:58:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126244 states. [2019-09-10 07:58:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126244 to 75042. [2019-09-10 07:58:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75042 states. [2019-09-10 07:58:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75042 states to 75042 states and 99324 transitions. [2019-09-10 07:58:54,473 INFO L78 Accepts]: Start accepts. Automaton has 75042 states and 99324 transitions. Word has length 161 [2019-09-10 07:58:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:54,473 INFO L475 AbstractCegarLoop]: Abstraction has 75042 states and 99324 transitions. [2019-09-10 07:58:54,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:58:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 75042 states and 99324 transitions. [2019-09-10 07:58:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 07:58:54,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:54,480 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:58:54,480 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash -624673372, now seen corresponding path program 1 times [2019-09-10 07:58:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:54,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:54,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:54,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:54,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:54,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:54,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-10 07:58:54,839 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2327], [2329], [2332], [2336], [2338], [2343], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 07:58:54,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:54,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:54,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:56,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:56,092 INFO L272 AbstractInterpreter]: Visited 150 different actions 1088 times. Merged at 57 different actions 815 times. Widened at 28 different actions 175 times. Performed 4194 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 129 fixpoints after 26 different actions. Largest state had 451 variables. [2019-09-10 07:58:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:56,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:56,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:56,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:56,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:56,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2443 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:58:56,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:56,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:56,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:56,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:56,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:56,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:57,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:57,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:57,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:57,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:01,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:59:01,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:59:01,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:59:01,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:59:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:59:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:59:01,042 INFO L87 Difference]: Start difference. First operand 75042 states and 99324 transitions. Second operand 21 states. [2019-09-10 07:59:03,326 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:59:03,735 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:59:04,467 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:04,922 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:59:05,220 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:05,638 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:59:05,813 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:06,103 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:59:06,243 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:59:06,386 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:06,730 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:06,893 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:59:07,068 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:59:07,227 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:07,784 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:07,982 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:59:08,467 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:59:08,647 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:10,188 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:10,359 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:11,030 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:11,329 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:59:11,556 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:11,733 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:59:11,920 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:12,110 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:59:12,264 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:59:12,408 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:59:12,716 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:59:13,167 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:13,489 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:13,711 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:59:14,164 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:14,332 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:59:14,541 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:59:14,720 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:14,874 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:15,068 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:15,231 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:15,384 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:59:15,935 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:59:16,097 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:59:16,262 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:59:16,442 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:16,632 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:16,792 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:17,010 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:17,190 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:59:17,379 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:59:17,550 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:59:18,805 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:19,006 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:19,217 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:19,369 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:19,529 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:59:20,260 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:59:20,411 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:20,579 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:59:21,106 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:21,245 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:21,472 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:21,647 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:21,833 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:22,048 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:59:22,200 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:59:22,379 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:22,533 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:59:22,706 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:59:23,032 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:23,229 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:23,775 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:59:24,092 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:59:24,266 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:59:24,410 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:59:24,569 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:24,863 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:59:25,058 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:25,198 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:25,354 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:59:25,567 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:25,863 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:59:26,031 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:26,240 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:59:26,428 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:59:26,566 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:59:26,746 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:27,594 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:59:27,787 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:59:28,461 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:28,896 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:59:29,044 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:59:29,207 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:29,457 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:59:29,621 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:59:29,808 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:29,991 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:59:30,282 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:30,470 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:30,633 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:59:30,821 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:59:31,359 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:59:31,658 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:32,157 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:59:32,329 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:59:32,586 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:59:32,761 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:59:32,978 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:59:33,169 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:59:33,389 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:59:33,579 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:33,732 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:59:33,910 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:59:34,089 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:59:34,299 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:59:34,448 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:59:34,613 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:59:34,809 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:35,117 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:35,315 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:59:35,881 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:59:36,099 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:59:36,280 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:59:36,443 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:36,643 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:36,785 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:59:36,981 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:59:37,191 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:59:37,346 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:59:37,563 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:59:37,766 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:59:38,070 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:59:38,359 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:59:38,646 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:59:38,991 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:39,183 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:39,348 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:59:39,503 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:39,690 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:59:39,857 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:40,283 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:59:40,472 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:41,090 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:59:41,245 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:59:41,555 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:59:41,739 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:42,103 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:42,270 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:42,452 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:59:42,760 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:59:42,918 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:59:43,102 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:43,408 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:59:43,569 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:59:43,881 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:59:44,062 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:59:44,222 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:59:44,556 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:59:45,047 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:59:45,290 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:59:45,516 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:59:45,696 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:59:45,907 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:59:46,138 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:59:46,426 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-10 07:59:46,705 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:59:47,210 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:59:49,718 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:49,879 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:59:50,058 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:59:50,409 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:50,632 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:59:50,892 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:59:51,203 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:59:51,362 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:59:51,918 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:59:52,461 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:59:52,831 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:59:53,155 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:59:53,335 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:59:53,516 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:59:53,683 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:59:53,949 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:59:54,261 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:59:54,408 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:59:54,579 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:55,870 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:59:56,136 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:59:56,436 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:59:56,708 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:59:56,859 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:59:57,163 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:59:57,624 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:59:58,037 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:58,565 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:59:58,759 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:59:58,967 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:00:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:04,528 INFO L93 Difference]: Finished difference Result 1685162 states and 2179899 transitions. [2019-09-10 08:00:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:00:04,528 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2019-09-10 08:00:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:15,183 INFO L225 Difference]: With dead ends: 1685162 [2019-09-10 08:00:15,184 INFO L226 Difference]: Without dead ends: 1685162 [2019-09-10 08:00:15,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 262 SyntacticMatches, 45 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52163 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=15654, Invalid=110016, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:00:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685162 states. [2019-09-10 08:00:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685162 to 371996. [2019-09-10 08:00:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371996 states. [2019-09-10 08:00:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371996 states to 371996 states and 488954 transitions. [2019-09-10 08:00:31,593 INFO L78 Accepts]: Start accepts. Automaton has 371996 states and 488954 transitions. Word has length 162 [2019-09-10 08:00:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:31,594 INFO L475 AbstractCegarLoop]: Abstraction has 371996 states and 488954 transitions. [2019-09-10 08:00:31,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:00:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 371996 states and 488954 transitions. [2019-09-10 08:00:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:00:31,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:31,616 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:00:31,616 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -693952735, now seen corresponding path program 1 times [2019-09-10 08:00:31,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:31,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:31,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:31,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:31,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:00:31,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 08:00:31,900 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3970], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4194], [4199], [4202], [4208], [4210], [4213], [4228], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:00:31,902 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:00:31,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:00:31,987 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:00:33,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:00:33,055 INFO L272 AbstractInterpreter]: Visited 152 different actions 941 times. Merged at 59 different actions 695 times. Widened at 27 different actions 154 times. Performed 3699 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3699 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 77 fixpoints after 19 different actions. Largest state had 451 variables. [2019-09-10 08:00:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:33,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:00:33,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:33,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:00:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:33,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:00:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:33,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 2448 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:00:33,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:00:33,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:33,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:33,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:33,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:00:34,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:00:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:00:34,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:00:34,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2019-09-10 08:00:34,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:00:34,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:00:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:00:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:00:34,365 INFO L87 Difference]: Start difference. First operand 371996 states and 488954 transitions. Second operand 19 states. [2019-09-10 08:00:35,865 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-09-10 08:00:47,634 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:00:47,795 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:00:48,145 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:00:48,299 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:00:53,444 WARN L188 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-10 08:01:02,675 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 08:01:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:22,828 INFO L93 Difference]: Finished difference Result 2204606 states and 2847875 transitions. [2019-09-10 08:01:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-09-10 08:01:22,828 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 163 [2019-09-10 08:01:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:26,018 INFO L225 Difference]: With dead ends: 2204606 [2019-09-10 08:01:26,019 INFO L226 Difference]: Without dead ends: 2204606 [2019-09-10 08:01:26,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27453 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=9069, Invalid=58791, Unknown=0, NotChecked=0, Total=67860 [2019-09-10 08:01:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204606 states. [2019-09-10 08:01:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204606 to 638036. [2019-09-10 08:01:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638036 states. [2019-09-10 08:01:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638036 states to 638036 states and 835336 transitions. [2019-09-10 08:01:53,678 INFO L78 Accepts]: Start accepts. Automaton has 638036 states and 835336 transitions. Word has length 163 [2019-09-10 08:01:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:53,678 INFO L475 AbstractCegarLoop]: Abstraction has 638036 states and 835336 transitions. [2019-09-10 08:01:53,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:01:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 638036 states and 835336 transitions. [2019-09-10 08:02:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:02:00,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:00,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:00,477 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2002734071, now seen corresponding path program 1 times [2019-09-10 08:02:00,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:00,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:00,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:00,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:02:00,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:00,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:02:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:02:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:00,569 INFO L87 Difference]: Start difference. First operand 638036 states and 835336 transitions. Second operand 3 states. [2019-09-10 08:02:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:01,747 INFO L93 Difference]: Finished difference Result 583394 states and 746219 transitions. [2019-09-10 08:02:01,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:02:01,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:02:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:03,210 INFO L225 Difference]: With dead ends: 583394 [2019-09-10 08:02:03,210 INFO L226 Difference]: Without dead ends: 583394 [2019-09-10 08:02:03,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:02:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583394 states. [2019-09-10 08:02:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583394 to 543146. [2019-09-10 08:02:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543146 states. [2019-09-10 08:02:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543146 states to 543146 states and 702346 transitions. [2019-09-10 08:02:14,300 INFO L78 Accepts]: Start accepts. Automaton has 543146 states and 702346 transitions. Word has length 164 [2019-09-10 08:02:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:14,300 INFO L475 AbstractCegarLoop]: Abstraction has 543146 states and 702346 transitions. [2019-09-10 08:02:14,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:02:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 543146 states and 702346 transitions. [2019-09-10 08:02:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:02:14,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:14,325 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:14,325 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1773606458, now seen corresponding path program 1 times [2019-09-10 08:02:14,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:14,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:14,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:02:14,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:14,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:02:14,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:14,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:02:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:02:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:14,517 INFO L87 Difference]: Start difference. First operand 543146 states and 702346 transitions. Second operand 9 states. [2019-09-10 08:02:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:18,027 INFO L93 Difference]: Finished difference Result 778650 states and 1004907 transitions. [2019-09-10 08:02:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:02:18,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-09-10 08:02:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:27,931 INFO L225 Difference]: With dead ends: 778650 [2019-09-10 08:02:27,932 INFO L226 Difference]: Without dead ends: 778650 [2019-09-10 08:02:27,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:02:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778650 states. [2019-09-10 08:02:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778650 to 543146. [2019-09-10 08:02:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543146 states. [2019-09-10 08:02:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543146 states to 543146 states and 702342 transitions. [2019-09-10 08:02:35,170 INFO L78 Accepts]: Start accepts. Automaton has 543146 states and 702342 transitions. Word has length 164 [2019-09-10 08:02:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:35,170 INFO L475 AbstractCegarLoop]: Abstraction has 543146 states and 702342 transitions. [2019-09-10 08:02:35,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:02:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 543146 states and 702342 transitions. [2019-09-10 08:02:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:02:35,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:35,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:02:35,186 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1543740154, now seen corresponding path program 1 times [2019-09-10 08:02:35,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:35,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:35,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:35,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:35,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2019-09-10 08:02:35,549 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3455], [3497], [3501], [3849], [3933], [3936], [3939], [3942], [3968], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4216], [4221], [4224], [4230], [4232], [4235], [4250], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4282], [4287], [4290], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:02:35,554 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:35,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:35,648 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:36,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:36,694 INFO L272 AbstractInterpreter]: Visited 154 different actions 960 times. Merged at 59 different actions 712 times. Widened at 24 different actions 144 times. Performed 3792 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 20 different actions. Largest state had 451 variables. [2019-09-10 08:02:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:36,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:36,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:36,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:02:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:36,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:02:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:37,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:02:37,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:37,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:45,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:47,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:47,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:47,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:02:47,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:47,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:02:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:02:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:02:47,857 INFO L87 Difference]: Start difference. First operand 543146 states and 702342 transitions. Second operand 20 states. [2019-09-10 08:02:48,071 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:02:48,750 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:02:48,963 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:02:49,616 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:49,796 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:02:50,025 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:02:50,371 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:02:50,914 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:02:51,263 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:51,611 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:51,999 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:52,274 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:02:52,693 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:53,046 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:02:53,284 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:02:53,520 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:53,881 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:02:54,139 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:02:54,565 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:02:55,851 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:02:56,225 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:02:56,498 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:02:57,321 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:02:57,544 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:02:57,865 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:58,278 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:58,495 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:02:58,736 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:02:59,217 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:59,410 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:02:59,727 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:02:59,924 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:03:00,264 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:03:00,645 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:03:02,939 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:03,163 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:03:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:17,924 INFO L93 Difference]: Finished difference Result 2825580 states and 3616249 transitions. [2019-09-10 08:03:17,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:03:17,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 165 [2019-09-10 08:03:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:21,953 INFO L225 Difference]: With dead ends: 2825580 [2019-09-10 08:03:21,954 INFO L226 Difference]: Without dead ends: 2825580 [2019-09-10 08:03:21,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 286 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:03:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825580 states. [2019-09-10 08:04:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825580 to 1287942. [2019-09-10 08:04:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287942 states. [2019-09-10 08:04:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287942 states to 1287942 states and 1663604 transitions. [2019-09-10 08:04:16,178 INFO L78 Accepts]: Start accepts. Automaton has 1287942 states and 1663604 transitions. Word has length 165 [2019-09-10 08:04:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:16,179 INFO L475 AbstractCegarLoop]: Abstraction has 1287942 states and 1663604 transitions. [2019-09-10 08:04:16,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:04:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1287942 states and 1663604 transitions. [2019-09-10 08:04:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:04:16,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:16,219 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:16,219 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 793946873, now seen corresponding path program 1 times [2019-09-10 08:04:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:16,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:16,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:16,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:04:16,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:04:16,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2019-09-10 08:04:16,460 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [169], [172], [175], [178], [279], [283], [320], [323], [326], [329], [407], [411], [2319], [2321], [2324], [2329], [2332], [2336], [2349], [2351], [2433], [2436], [2439], [2442], [2501], [2505], [3357], [3360], [3361], [3363], [3446], [3449], [3452], [3457], [3495], [3497], [3501], [3849], [3933], [3936], [3939], [3942], [3968], [3972], [4166], [4169], [4173], [4176], [4179], [4183], [4185], [4188], [4191], [4206], [4208], [4210], [4213], [4216], [4221], [4224], [4230], [4232], [4235], [4238], [4243], [4246], [4252], [4254], [4257], [4272], [4274], [4276], [4279], [4294], [4296], [4298], [4300], [4303], [4306], [4314], [4316], [4319], [4322], [4330], [4332], [4335], [4338], [4346], [4348], [4351], [4354], [4362], [4364], [4367], [4370], [4378], [4427], [4428], [4432], [4433], [4434] [2019-09-10 08:04:16,465 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:04:16,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:04:16,547 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:04:17,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:04:17,352 INFO L272 AbstractInterpreter]: Visited 155 different actions 863 times. Merged at 59 different actions 626 times. Widened at 23 different actions 113 times. Performed 3425 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 71 fixpoints after 18 different actions. Largest state had 451 variables. [2019-09-10 08:04:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:17,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:04:17,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:04:17,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:04:17,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:17,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:04:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:17,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 2449 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:04:17,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:04:17,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:19,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:04:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:19,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:19,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:19,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:19,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:04:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:20,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:04:20,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2019-09-10 08:04:20,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:04:20,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:04:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:04:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:04:20,297 INFO L87 Difference]: Start difference. First operand 1287942 states and 1663604 transitions. Second operand 19 states. [2019-09-10 08:05:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:15,555 INFO L93 Difference]: Finished difference Result 5247408 states and 6660412 transitions. [2019-09-10 08:05:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 08:05:15,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 166 [2019-09-10 08:05:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted.