java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:00:04,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:00:04,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:00:04,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:00:04,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:00:04,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:00:04,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:00:04,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:00:04,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:00:04,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:00:04,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:00:04,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:00:04,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:00:04,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:00:04,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:00:04,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:00:04,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:00:04,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:00:04,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:00:04,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:00:04,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:00:04,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:00:04,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:00:04,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:00:04,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:00:04,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:00:04,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:00:04,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:00:04,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:00:04,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:00:04,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:00:04,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:00:04,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:00:04,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:00:04,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:00:04,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:00:04,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:00:04,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:00:04,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:00:04,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:00:04,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:00:04,477 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-10-03 03:00:04,492 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:00:04,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:00:04,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:00:04,493 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:00:04,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:00:04,494 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:00:04,494 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:00:04,494 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:00:04,494 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:00:04,494 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:00:04,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:00:04,495 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:00:04,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:00:04,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:00:04,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:00:04,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:00:04,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:00:04,496 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:00:04,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:00:04,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:00:04,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:00:04,497 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:00:04,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:00:04,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:00:04,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:00:04,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:00:04,498 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:00:04,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:00:04,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:00:04,499 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:00:04,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:00:04,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:00:04,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:00:04,543 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:00:04,543 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:00:04,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:00:04,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd115447c/804eb93564c8429b8ce32850374f57e2/FLAG025679981 [2019-10-03 03:00:05,300 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:00:05,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:00:05,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd115447c/804eb93564c8429b8ce32850374f57e2/FLAG025679981 [2019-10-03 03:00:05,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd115447c/804eb93564c8429b8ce32850374f57e2 [2019-10-03 03:00:05,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:00:05,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:00:05,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:05,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:00:05,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:00:05,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:05" (1/1) ... [2019-10-03 03:00:05,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627a9f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:05, skipping insertion in model container [2019-10-03 03:00:05,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:05" (1/1) ... [2019-10-03 03:00:05,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:00:05,664 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:00:06,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:06,751 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:00:07,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:07,113 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:00:07,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07 WrapperNode [2019-10-03 03:00:07,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:07,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:00:07,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:00:07,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:00:07,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (1/1) ... [2019-10-03 03:00:07,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:00:07,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:00:07,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:00:07,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:00:07,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (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-10-03 03:00:07,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:00:07,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:00:07,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:00:07,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:00:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:00:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:00:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-03 03:00:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:00:07,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:00:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:00:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:00:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:00:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:00:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:00:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:00:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:00:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:00:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:00:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:00:10,894 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:00:10,895 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:00:10,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:10 BoogieIcfgContainer [2019-10-03 03:00:10,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:00:10,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:00:10,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:00:10,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:00:10,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:00:05" (1/3) ... [2019-10-03 03:00:10,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1370b72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:10, skipping insertion in model container [2019-10-03 03:00:10,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:07" (2/3) ... [2019-10-03 03:00:10,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1370b72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:10, skipping insertion in model container [2019-10-03 03:00:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:10" (3/3) ... [2019-10-03 03:00:10,906 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:00:10,920 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:00:10,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-03 03:00:10,953 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-03 03:00:10,987 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:00:10,988 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:00:10,988 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:00:10,988 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:00:10,988 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:00:10,989 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:00:10,989 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:00:10,989 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:00:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-03 03:00:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:00:11,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:11,063 INFO L411 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] [2019-10-03 03:00:11,066 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:11,073 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-03 03:00:11,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:11,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:11,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:11,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:11,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:11,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:00:11,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:11,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:00:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:00:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:00:11,715 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-03 03:00:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:13,950 INFO L93 Difference]: Finished difference Result 1574 states and 2692 transitions. [2019-10-03 03:00:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:13,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 03:00:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:13,979 INFO L225 Difference]: With dead ends: 1574 [2019-10-03 03:00:13,979 INFO L226 Difference]: Without dead ends: 1562 [2019-10-03 03:00:13,981 INFO L640 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-10-03 03:00:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-03 03:00:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-10-03 03:00:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-10-03 03:00:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-10-03 03:00:14,162 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-10-03 03:00:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:14,163 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-10-03 03:00:14,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:00:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-10-03 03:00:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:14,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:14,168 INFO L411 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] [2019-10-03 03:00:14,168 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-03 03:00:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:14,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:14,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:14,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:14,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:14,376 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-10-03 03:00:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:15,736 INFO L93 Difference]: Finished difference Result 2302 states and 3143 transitions. [2019-10-03 03:00:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:15,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:00:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:15,749 INFO L225 Difference]: With dead ends: 2302 [2019-10-03 03:00:15,749 INFO L226 Difference]: Without dead ends: 2302 [2019-10-03 03:00:15,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-10-03 03:00:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-10-03 03:00:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-10-03 03:00:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-10-03 03:00:15,809 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-10-03 03:00:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:15,809 INFO L475 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-10-03 03:00:15,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-10-03 03:00:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:15,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:15,814 INFO L411 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] [2019-10-03 03:00:15,814 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-03 03:00:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:15,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:15,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:15,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:15,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:15,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:15,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:15,933 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-10-03 03:00:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:17,174 INFO L93 Difference]: Finished difference Result 4341 states and 5992 transitions. [2019-10-03 03:00:17,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:17,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:00:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:17,197 INFO L225 Difference]: With dead ends: 4341 [2019-10-03 03:00:17,198 INFO L226 Difference]: Without dead ends: 4341 [2019-10-03 03:00:17,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-10-03 03:00:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-10-03 03:00:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-03 03:00:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-10-03 03:00:17,314 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-10-03 03:00:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:17,314 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-10-03 03:00:17,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-10-03 03:00:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:00:17,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:17,319 INFO L411 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] [2019-10-03 03:00:17,320 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-03 03:00:17,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:17,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:17,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:17,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:17,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:17,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-10-03 03:00:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:00:17,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:17,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:00:17,605 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-10-03 03:00:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:21,269 INFO L93 Difference]: Finished difference Result 8361 states and 12150 transitions. [2019-10-03 03:00:21,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:00:21,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:00:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:21,307 INFO L225 Difference]: With dead ends: 8361 [2019-10-03 03:00:21,308 INFO L226 Difference]: Without dead ends: 8361 [2019-10-03 03:00:21,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:00:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2019-10-03 03:00:21,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 4321. [2019-10-03 03:00:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-03 03:00:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-10-03 03:00:21,465 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-10-03 03:00:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:21,466 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-10-03 03:00:21,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-10-03 03:00:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:00:21,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:21,473 INFO L411 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] [2019-10-03 03:00:21,473 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-03 03:00:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:21,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:21,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:21,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:21,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:00:21,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:21,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:00:21,698 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-10-03 03:00:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:25,447 INFO L93 Difference]: Finished difference Result 11066 states and 15933 transitions. [2019-10-03 03:00:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:00:25,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:00:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:25,497 INFO L225 Difference]: With dead ends: 11066 [2019-10-03 03:00:25,497 INFO L226 Difference]: Without dead ends: 11066 [2019-10-03 03:00:25,498 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:00:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-03 03:00:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-10-03 03:00:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-03 03:00:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-10-03 03:00:25,658 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-10-03 03:00:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:25,659 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-10-03 03:00:25,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-10-03 03:00:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:00:25,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:25,664 INFO L411 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] [2019-10-03 03:00:25,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-03 03:00:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:25,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:25,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:25,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:25,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:00:26,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:26,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:00:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:00:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:26,039 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-10-03 03:00:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:28,556 INFO L93 Difference]: Finished difference Result 8067 states and 11824 transitions. [2019-10-03 03:00:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:00:28,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-03 03:00:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:28,579 INFO L225 Difference]: With dead ends: 8067 [2019-10-03 03:00:28,579 INFO L226 Difference]: Without dead ends: 8067 [2019-10-03 03:00:28,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:00:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-03 03:00:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 4321. [2019-10-03 03:00:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-03 03:00:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-10-03 03:00:28,733 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-10-03 03:00:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:28,734 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-10-03 03:00:28,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:00:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-10-03 03:00:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:28,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:28,742 INFO L411 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] [2019-10-03 03:00:28,742 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-03 03:00:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:28,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:28,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:28,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:28,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:28,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:28,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:28,838 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-10-03 03:00:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:28,982 INFO L93 Difference]: Finished difference Result 5831 states and 7967 transitions. [2019-10-03 03:00:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:28,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:00:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:28,993 INFO L225 Difference]: With dead ends: 5831 [2019-10-03 03:00:28,994 INFO L226 Difference]: Without dead ends: 5831 [2019-10-03 03:00:28,994 INFO L640 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-10-03 03:00:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-10-03 03:00:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-10-03 03:00:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-10-03 03:00:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-10-03 03:00:29,070 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-10-03 03:00:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:29,071 INFO L475 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-10-03 03:00:29,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-10-03 03:00:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:29,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:29,076 INFO L411 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] [2019-10-03 03:00:29,076 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-03 03:00:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:29,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:29,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:29,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:29,145 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-10-03 03:00:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:29,234 INFO L93 Difference]: Finished difference Result 6946 states and 9728 transitions. [2019-10-03 03:00:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:00:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:29,247 INFO L225 Difference]: With dead ends: 6946 [2019-10-03 03:00:29,247 INFO L226 Difference]: Without dead ends: 6946 [2019-10-03 03:00:29,248 INFO L640 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-10-03 03:00:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-10-03 03:00:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-10-03 03:00:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-10-03 03:00:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-10-03 03:00:29,334 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-10-03 03:00:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:29,335 INFO L475 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-10-03 03:00:29,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-10-03 03:00:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:29,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:29,340 INFO L411 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] [2019-10-03 03:00:29,340 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-03 03:00:29,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:29,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:29,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:29,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:29,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:29,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:29,409 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-10-03 03:00:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:29,528 INFO L93 Difference]: Finished difference Result 8287 states and 11698 transitions. [2019-10-03 03:00:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:29,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:00:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:29,546 INFO L225 Difference]: With dead ends: 8287 [2019-10-03 03:00:29,546 INFO L226 Difference]: Without dead ends: 8287 [2019-10-03 03:00:29,547 INFO L640 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-10-03 03:00:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-03 03:00:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-10-03 03:00:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-10-03 03:00:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-10-03 03:00:29,704 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-10-03 03:00:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:29,704 INFO L475 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-10-03 03:00:29,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-10-03 03:00:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:29,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:29,710 INFO L411 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] [2019-10-03 03:00:29,711 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-03 03:00:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:29,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:29,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-10-03 03:00:29,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:29,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:29,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:29,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:29,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:29,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:29,820 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states. [2019-10-03 03:00:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:30,082 INFO L93 Difference]: Finished difference Result 7581 states and 10724 transitions. [2019-10-03 03:00:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:30,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:00:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:30,100 INFO L225 Difference]: With dead ends: 7581 [2019-10-03 03:00:30,100 INFO L226 Difference]: Without dead ends: 7581 [2019-10-03 03:00:30,101 INFO L640 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-10-03 03:00:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-10-03 03:00:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 6187. [2019-10-03 03:00:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6187 states. [2019-10-03 03:00:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 8753 transitions. [2019-10-03 03:00:30,189 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 8753 transitions. Word has length 59 [2019-10-03 03:00:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:30,190 INFO L475 AbstractCegarLoop]: Abstraction has 6187 states and 8753 transitions. [2019-10-03 03:00:30,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 8753 transitions. [2019-10-03 03:00:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:30,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:30,193 INFO L411 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] [2019-10-03 03:00:30,194 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-10-03 03:00:30,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:30,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:30,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:30,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:30,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:30,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:30,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:30,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:30,274 INFO L87 Difference]: Start difference. First operand 6187 states and 8753 transitions. Second operand 3 states. [2019-10-03 03:00:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:30,468 INFO L93 Difference]: Finished difference Result 8813 states and 12820 transitions. [2019-10-03 03:00:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:30,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:00:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:30,490 INFO L225 Difference]: With dead ends: 8813 [2019-10-03 03:00:30,491 INFO L226 Difference]: Without dead ends: 8813 [2019-10-03 03:00:30,492 INFO L640 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-10-03 03:00:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-10-03 03:00:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 7035. [2019-10-03 03:00:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-10-03 03:00:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10173 transitions. [2019-10-03 03:00:30,765 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10173 transitions. Word has length 59 [2019-10-03 03:00:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:30,765 INFO L475 AbstractCegarLoop]: Abstraction has 7035 states and 10173 transitions. [2019-10-03 03:00:30,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10173 transitions. [2019-10-03 03:00:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:00:30,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:30,769 INFO L411 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] [2019-10-03 03:00:30,769 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-10-03 03:00:30,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:30,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:30,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:30,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:30,844 INFO L87 Difference]: Start difference. First operand 7035 states and 10173 transitions. Second operand 3 states. [2019-10-03 03:00:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:30,979 INFO L93 Difference]: Finished difference Result 10987 states and 16201 transitions. [2019-10-03 03:00:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:30,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:00:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:31,010 INFO L225 Difference]: With dead ends: 10987 [2019-10-03 03:00:31,011 INFO L226 Difference]: Without dead ends: 10987 [2019-10-03 03:00:31,015 INFO L640 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-10-03 03:00:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10987 states. [2019-10-03 03:00:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10987 to 8587. [2019-10-03 03:00:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-03 03:00:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12623 transitions. [2019-10-03 03:00:31,194 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12623 transitions. Word has length 59 [2019-10-03 03:00:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:31,194 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12623 transitions. [2019-10-03 03:00:31,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12623 transitions. [2019-10-03 03:00:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:31,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:31,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:31,202 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-10-03 03:00:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:31,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:32,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:32,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:00:32,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:32,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:00:32,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:00:32,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:00:32,012 INFO L87 Difference]: Start difference. First operand 8587 states and 12623 transitions. Second operand 19 states. [2019-10-03 03:00:32,222 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-03 03:00:33,299 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:00:33,607 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-03 03:00:33,778 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-03 03:00:34,026 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-03 03:00:34,265 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-10-03 03:00:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:40,502 INFO L93 Difference]: Finished difference Result 31076 states and 46394 transitions. [2019-10-03 03:00:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:00:40,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:00:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:40,562 INFO L225 Difference]: With dead ends: 31076 [2019-10-03 03:00:40,562 INFO L226 Difference]: Without dead ends: 31076 [2019-10-03 03:00:40,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:00:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31076 states. [2019-10-03 03:00:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31076 to 8587. [2019-10-03 03:00:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-03 03:00:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12622 transitions. [2019-10-03 03:00:40,877 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12622 transitions. Word has length 60 [2019-10-03 03:00:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:40,878 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12622 transitions. [2019-10-03 03:00:40,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:00:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12622 transitions. [2019-10-03 03:00:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:40,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:40,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:40,881 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:40,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-10-03 03:00:40,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:40,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:40,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:40,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:40,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:00:41,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:41,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:00:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:00:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:00:41,451 INFO L87 Difference]: Start difference. First operand 8587 states and 12622 transitions. Second operand 19 states. [2019-10-03 03:00:41,657 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-10-03 03:00:42,481 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-03 03:00:43,197 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:00:43,409 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-03 03:00:43,988 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-10-03 03:00:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:48,561 INFO L93 Difference]: Finished difference Result 18903 states and 28006 transitions. [2019-10-03 03:00:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-03 03:00:48,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:00:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:48,602 INFO L225 Difference]: With dead ends: 18903 [2019-10-03 03:00:48,602 INFO L226 Difference]: Without dead ends: 18903 [2019-10-03 03:00:48,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:00:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-10-03 03:00:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 8587. [2019-10-03 03:00:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-03 03:00:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12621 transitions. [2019-10-03 03:00:48,840 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12621 transitions. Word has length 60 [2019-10-03 03:00:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:48,840 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12621 transitions. [2019-10-03 03:00:48,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:00:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12621 transitions. [2019-10-03 03:00:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:48,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:48,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:48,845 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1464680332, now seen corresponding path program 1 times [2019-10-03 03:00:48,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:48,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:48,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:49,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-10-03 03:00:49,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:00:49,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:49,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:00:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:00:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:00:49,560 INFO L87 Difference]: Start difference. First operand 8587 states and 12621 transitions. Second operand 19 states. [2019-10-03 03:00:49,811 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-03 03:00:50,767 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-10-03 03:00:51,127 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:00:51,292 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:00:51,572 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-03 03:00:51,768 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-03 03:00:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:56,832 INFO L93 Difference]: Finished difference Result 22833 states and 34043 transitions. [2019-10-03 03:00:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:00:56,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:00:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:56,867 INFO L225 Difference]: With dead ends: 22833 [2019-10-03 03:00:56,867 INFO L226 Difference]: Without dead ends: 22833 [2019-10-03 03:00:56,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:00:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22833 states. [2019-10-03 03:00:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22833 to 8587. [2019-10-03 03:00:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-03 03:00:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12620 transitions. [2019-10-03 03:00:57,103 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12620 transitions. Word has length 60 [2019-10-03 03:00:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:57,103 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12620 transitions. [2019-10-03 03:00:57,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:00:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12620 transitions. [2019-10-03 03:00:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:00:57,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:57,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:57,106 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1506240748, now seen corresponding path program 1 times [2019-10-03 03:00:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:57,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:57,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:57,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:57,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 03:00:57,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:57,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:00:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:00:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:00:57,522 INFO L87 Difference]: Start difference. First operand 8587 states and 12620 transitions. Second operand 11 states. [2019-10-03 03:00:58,298 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-03 03:01:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:00,435 INFO L93 Difference]: Finished difference Result 32986 states and 48962 transitions. [2019-10-03 03:01:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:01:00,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-03 03:01:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:00,483 INFO L225 Difference]: With dead ends: 32986 [2019-10-03 03:01:00,483 INFO L226 Difference]: Without dead ends: 32986 [2019-10-03 03:01:00,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:01:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32986 states. [2019-10-03 03:01:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32986 to 8472. [2019-10-03 03:01:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8472 states. [2019-10-03 03:01:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8472 states to 8472 states and 12474 transitions. [2019-10-03 03:01:00,906 INFO L78 Accepts]: Start accepts. Automaton has 8472 states and 12474 transitions. Word has length 60 [2019-10-03 03:01:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:00,907 INFO L475 AbstractCegarLoop]: Abstraction has 8472 states and 12474 transitions. [2019-10-03 03:01:00,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:01:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8472 states and 12474 transitions. [2019-10-03 03:01:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:01:00,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:00,909 INFO L411 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] [2019-10-03 03:01:00,910 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash 818671798, now seen corresponding path program 1 times [2019-10-03 03:01:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:00,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:01,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:01,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:01:01,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:01,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:01:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:01:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:01:01,535 INFO L87 Difference]: Start difference. First operand 8472 states and 12474 transitions. Second operand 13 states. [2019-10-03 03:01:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:03,217 INFO L93 Difference]: Finished difference Result 13351 states and 19632 transitions. [2019-10-03 03:01:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:01:03,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-10-03 03:01:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:03,229 INFO L225 Difference]: With dead ends: 13351 [2019-10-03 03:01:03,229 INFO L226 Difference]: Without dead ends: 13351 [2019-10-03 03:01:03,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:01:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13351 states. [2019-10-03 03:01:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13351 to 8427. [2019-10-03 03:01:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-10-03 03:01:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 12412 transitions. [2019-10-03 03:01:03,341 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 12412 transitions. Word has length 61 [2019-10-03 03:01:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:03,341 INFO L475 AbstractCegarLoop]: Abstraction has 8427 states and 12412 transitions. [2019-10-03 03:01:03,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:01:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 12412 transitions. [2019-10-03 03:01:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:03,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:03,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:03,345 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-10-03 03:01:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:03,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:03,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:03,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:03,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:03,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:03,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:03,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:03,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:03,435 INFO L87 Difference]: Start difference. First operand 8427 states and 12412 transitions. Second operand 6 states. [2019-10-03 03:01:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:03,652 INFO L93 Difference]: Finished difference Result 29372 states and 42403 transitions. [2019-10-03 03:01:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:01:03,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-03 03:01:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:03,684 INFO L225 Difference]: With dead ends: 29372 [2019-10-03 03:01:03,685 INFO L226 Difference]: Without dead ends: 29372 [2019-10-03 03:01:03,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:01:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-10-03 03:01:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 25784. [2019-10-03 03:01:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25784 states. [2019-10-03 03:01:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25784 states to 25784 states and 37276 transitions. [2019-10-03 03:01:03,943 INFO L78 Accepts]: Start accepts. Automaton has 25784 states and 37276 transitions. Word has length 67 [2019-10-03 03:01:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:03,943 INFO L475 AbstractCegarLoop]: Abstraction has 25784 states and 37276 transitions. [2019-10-03 03:01:03,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25784 states and 37276 transitions. [2019-10-03 03:01:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:01:03,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:03,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:03,948 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-10-03 03:01:03,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:03,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:04,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-10-03 03:01:04,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:04,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:04,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:04,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:04,187 INFO L87 Difference]: Start difference. First operand 25784 states and 37276 transitions. Second operand 5 states. [2019-10-03 03:01:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:04,385 INFO L93 Difference]: Finished difference Result 27844 states and 39997 transitions. [2019-10-03 03:01:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:04,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-03 03:01:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:04,419 INFO L225 Difference]: With dead ends: 27844 [2019-10-03 03:01:04,419 INFO L226 Difference]: Without dead ends: 27844 [2019-10-03 03:01:04,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27844 states. [2019-10-03 03:01:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27844 to 24874. [2019-10-03 03:01:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24874 states. [2019-10-03 03:01:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24874 states to 24874 states and 35771 transitions. [2019-10-03 03:01:04,669 INFO L78 Accepts]: Start accepts. Automaton has 24874 states and 35771 transitions. Word has length 68 [2019-10-03 03:01:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:04,669 INFO L475 AbstractCegarLoop]: Abstraction has 24874 states and 35771 transitions. [2019-10-03 03:01:04,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24874 states and 35771 transitions. [2019-10-03 03:01:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:01:04,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:04,674 INFO L411 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] [2019-10-03 03:01:04,674 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-10-03 03:01:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:04,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:04,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:04,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:04,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:04,764 INFO L87 Difference]: Start difference. First operand 24874 states and 35771 transitions. Second operand 6 states. [2019-10-03 03:01:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:04,940 INFO L93 Difference]: Finished difference Result 43438 states and 61136 transitions. [2019-10-03 03:01:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:04,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-03 03:01:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:04,987 INFO L225 Difference]: With dead ends: 43438 [2019-10-03 03:01:04,987 INFO L226 Difference]: Without dead ends: 43438 [2019-10-03 03:01:04,990 INFO L640 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-10-03 03:01:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43438 states. [2019-10-03 03:01:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43438 to 25714. [2019-10-03 03:01:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25714 states. [2019-10-03 03:01:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25714 states to 25714 states and 36421 transitions. [2019-10-03 03:01:05,354 INFO L78 Accepts]: Start accepts. Automaton has 25714 states and 36421 transitions. Word has length 70 [2019-10-03 03:01:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:05,354 INFO L475 AbstractCegarLoop]: Abstraction has 25714 states and 36421 transitions. [2019-10-03 03:01:05,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 25714 states and 36421 transitions. [2019-10-03 03:01:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 03:01:05,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:05,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:05,359 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-10-03 03:01:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:05,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:05,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:05,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:05,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:05,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:05,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:05,449 INFO L87 Difference]: Start difference. First operand 25714 states and 36421 transitions. Second operand 3 states. [2019-10-03 03:01:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:05,610 INFO L93 Difference]: Finished difference Result 44266 states and 61667 transitions. [2019-10-03 03:01:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:05,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-03 03:01:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:05,659 INFO L225 Difference]: With dead ends: 44266 [2019-10-03 03:01:05,660 INFO L226 Difference]: Without dead ends: 44266 [2019-10-03 03:01:05,660 INFO L640 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-10-03 03:01:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44266 states. [2019-10-03 03:01:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44266 to 43660. [2019-10-03 03:01:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43660 states. [2019-10-03 03:01:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43660 states to 43660 states and 61062 transitions. [2019-10-03 03:01:06,166 INFO L78 Accepts]: Start accepts. Automaton has 43660 states and 61062 transitions. Word has length 71 [2019-10-03 03:01:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:06,166 INFO L475 AbstractCegarLoop]: Abstraction has 43660 states and 61062 transitions. [2019-10-03 03:01:06,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 43660 states and 61062 transitions. [2019-10-03 03:01:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 03:01:06,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:06,171 INFO L411 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] [2019-10-03 03:01:06,172 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-10-03 03:01:06,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:06,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:06,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:06,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:06,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:06,232 INFO L87 Difference]: Start difference. First operand 43660 states and 61062 transitions. Second operand 3 states. [2019-10-03 03:01:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:06,361 INFO L93 Difference]: Finished difference Result 43645 states and 60306 transitions. [2019-10-03 03:01:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:06,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 03:01:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:06,399 INFO L225 Difference]: With dead ends: 43645 [2019-10-03 03:01:06,399 INFO L226 Difference]: Without dead ends: 43645 [2019-10-03 03:01:06,400 INFO L640 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-10-03 03:01:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2019-10-03 03:01:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 33345. [2019-10-03 03:01:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33345 states. [2019-10-03 03:01:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33345 states to 33345 states and 46179 transitions. [2019-10-03 03:01:06,713 INFO L78 Accepts]: Start accepts. Automaton has 33345 states and 46179 transitions. Word has length 72 [2019-10-03 03:01:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:06,713 INFO L475 AbstractCegarLoop]: Abstraction has 33345 states and 46179 transitions. [2019-10-03 03:01:06,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33345 states and 46179 transitions. [2019-10-03 03:01:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 03:01:06,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:06,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:06,718 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-10-03 03:01:06,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:06,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:06,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:06,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:06,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:06,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:06,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:06,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:06,786 INFO L87 Difference]: Start difference. First operand 33345 states and 46179 transitions. Second operand 5 states. [2019-10-03 03:01:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:07,678 INFO L93 Difference]: Finished difference Result 103584 states and 140170 transitions. [2019-10-03 03:01:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:07,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-03 03:01:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:07,776 INFO L225 Difference]: With dead ends: 103584 [2019-10-03 03:01:07,776 INFO L226 Difference]: Without dead ends: 103584 [2019-10-03 03:01:07,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103584 states. [2019-10-03 03:01:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103584 to 55175. [2019-10-03 03:01:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55175 states. [2019-10-03 03:01:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55175 states to 55175 states and 75205 transitions. [2019-10-03 03:01:09,640 INFO L78 Accepts]: Start accepts. Automaton has 55175 states and 75205 transitions. Word has length 74 [2019-10-03 03:01:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:09,641 INFO L475 AbstractCegarLoop]: Abstraction has 55175 states and 75205 transitions. [2019-10-03 03:01:09,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55175 states and 75205 transitions. [2019-10-03 03:01:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:01:09,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:09,646 INFO L411 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-10-03 03:01:09,646 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-10-03 03:01:09,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:09,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:09,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:09,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:09,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:09,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:09,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:09,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:09,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:09,722 INFO L87 Difference]: Start difference. First operand 55175 states and 75205 transitions. Second operand 5 states. [2019-10-03 03:01:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:10,580 INFO L93 Difference]: Finished difference Result 162074 states and 216988 transitions. [2019-10-03 03:01:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:10,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-03 03:01:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:10,770 INFO L225 Difference]: With dead ends: 162074 [2019-10-03 03:01:10,770 INFO L226 Difference]: Without dead ends: 162074 [2019-10-03 03:01:10,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:10,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162074 states. [2019-10-03 03:01:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162074 to 107782. [2019-10-03 03:01:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107782 states. [2019-10-03 03:01:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107782 states to 107782 states and 146321 transitions. [2019-10-03 03:01:13,680 INFO L78 Accepts]: Start accepts. Automaton has 107782 states and 146321 transitions. Word has length 77 [2019-10-03 03:01:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:13,680 INFO L475 AbstractCegarLoop]: Abstraction has 107782 states and 146321 transitions. [2019-10-03 03:01:13,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 107782 states and 146321 transitions. [2019-10-03 03:01:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 03:01:13,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:13,687 INFO L411 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-10-03 03:01:13,687 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-10-03 03:01:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:13,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:13,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:13,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:13,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:13,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:13,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:13,753 INFO L87 Difference]: Start difference. First operand 107782 states and 146321 transitions. Second operand 3 states. [2019-10-03 03:01:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:13,999 INFO L93 Difference]: Finished difference Result 107277 states and 142237 transitions. [2019-10-03 03:01:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:13,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-03 03:01:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:14,101 INFO L225 Difference]: With dead ends: 107277 [2019-10-03 03:01:14,102 INFO L226 Difference]: Without dead ends: 107277 [2019-10-03 03:01:14,102 INFO L640 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-10-03 03:01:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107277 states. [2019-10-03 03:01:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107277 to 87926. [2019-10-03 03:01:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87926 states. [2019-10-03 03:01:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87926 states to 87926 states and 117028 transitions. [2019-10-03 03:01:15,490 INFO L78 Accepts]: Start accepts. Automaton has 87926 states and 117028 transitions. Word has length 79 [2019-10-03 03:01:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:15,491 INFO L475 AbstractCegarLoop]: Abstraction has 87926 states and 117028 transitions. [2019-10-03 03:01:15,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87926 states and 117028 transitions. [2019-10-03 03:01:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:01:15,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:15,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:15,497 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:15,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 250147946, now seen corresponding path program 1 times [2019-10-03 03:01:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:15,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:15,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:15,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:15,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:15,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:15,608 INFO L87 Difference]: Start difference. First operand 87926 states and 117028 transitions. Second operand 6 states. [2019-10-03 03:01:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:15,944 INFO L93 Difference]: Finished difference Result 108130 states and 143498 transitions. [2019-10-03 03:01:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:01:15,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-03 03:01:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:16,044 INFO L225 Difference]: With dead ends: 108130 [2019-10-03 03:01:16,045 INFO L226 Difference]: Without dead ends: 108130 [2019-10-03 03:01:16,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108130 states. [2019-10-03 03:01:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108130 to 99710. [2019-10-03 03:01:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99710 states. [2019-10-03 03:01:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99710 states to 99710 states and 132370 transitions. [2019-10-03 03:01:18,786 INFO L78 Accepts]: Start accepts. Automaton has 99710 states and 132370 transitions. Word has length 82 [2019-10-03 03:01:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:18,786 INFO L475 AbstractCegarLoop]: Abstraction has 99710 states and 132370 transitions. [2019-10-03 03:01:18,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 99710 states and 132370 transitions. [2019-10-03 03:01:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:01:18,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:18,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:18,791 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 874030055, now seen corresponding path program 1 times [2019-10-03 03:01:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:18,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:18,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:18,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:18,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:18,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:18,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:18,859 INFO L87 Difference]: Start difference. First operand 99710 states and 132370 transitions. Second operand 3 states. [2019-10-03 03:01:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:19,201 INFO L93 Difference]: Finished difference Result 116131 states and 151675 transitions. [2019-10-03 03:01:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:19,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-03 03:01:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:19,347 INFO L225 Difference]: With dead ends: 116131 [2019-10-03 03:01:19,348 INFO L226 Difference]: Without dead ends: 116131 [2019-10-03 03:01:19,348 INFO L640 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-10-03 03:01:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116131 states. [2019-10-03 03:01:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116131 to 110798. [2019-10-03 03:01:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110798 states. [2019-10-03 03:01:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110798 states to 110798 states and 145506 transitions. [2019-10-03 03:01:20,819 INFO L78 Accepts]: Start accepts. Automaton has 110798 states and 145506 transitions. Word has length 82 [2019-10-03 03:01:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:20,819 INFO L475 AbstractCegarLoop]: Abstraction has 110798 states and 145506 transitions. [2019-10-03 03:01:20,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 110798 states and 145506 transitions. [2019-10-03 03:01:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 03:01:20,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:20,828 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:20,828 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1798700343, now seen corresponding path program 1 times [2019-10-03 03:01:20,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:20,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:20,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:20,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:20,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:20,904 INFO L87 Difference]: Start difference. First operand 110798 states and 145506 transitions. Second operand 3 states. [2019-10-03 03:01:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:21,445 INFO L93 Difference]: Finished difference Result 197755 states and 252971 transitions. [2019-10-03 03:01:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:21,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-03 03:01:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:21,675 INFO L225 Difference]: With dead ends: 197755 [2019-10-03 03:01:21,676 INFO L226 Difference]: Without dead ends: 197755 [2019-10-03 03:01:21,676 INFO L640 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-10-03 03:01:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197755 states. [2019-10-03 03:01:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197755 to 174095. [2019-10-03 03:01:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174095 states. [2019-10-03 03:01:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174095 states to 174095 states and 224332 transitions. [2019-10-03 03:01:26,020 INFO L78 Accepts]: Start accepts. Automaton has 174095 states and 224332 transitions. Word has length 90 [2019-10-03 03:01:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:26,020 INFO L475 AbstractCegarLoop]: Abstraction has 174095 states and 224332 transitions. [2019-10-03 03:01:26,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 174095 states and 224332 transitions. [2019-10-03 03:01:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 03:01:26,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:26,034 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:26,034 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:26,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-10-03 03:01:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:26,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:26,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:01:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:26,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:26,164 INFO L87 Difference]: Start difference. First operand 174095 states and 224332 transitions. Second operand 9 states. [2019-10-03 03:01:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:29,868 INFO L93 Difference]: Finished difference Result 442583 states and 569319 transitions. [2019-10-03 03:01:29,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:29,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-03 03:01:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:30,375 INFO L225 Difference]: With dead ends: 442583 [2019-10-03 03:01:30,375 INFO L226 Difference]: Without dead ends: 442583 [2019-10-03 03:01:30,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:01:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442583 states. [2019-10-03 03:01:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442583 to 174080. [2019-10-03 03:01:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174080 states. [2019-10-03 03:01:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174080 states to 174080 states and 224316 transitions. [2019-10-03 03:01:33,903 INFO L78 Accepts]: Start accepts. Automaton has 174080 states and 224316 transitions. Word has length 92 [2019-10-03 03:01:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:33,903 INFO L475 AbstractCegarLoop]: Abstraction has 174080 states and 224316 transitions. [2019-10-03 03:01:33,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 174080 states and 224316 transitions. [2019-10-03 03:01:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:01:33,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:33,913 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:33,914 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-10-03 03:01:33,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:33,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:33,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:33,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:34,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:34,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:34,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:34,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:34,167 INFO L87 Difference]: Start difference. First operand 174080 states and 224316 transitions. Second operand 10 states. [2019-10-03 03:01:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:41,636 INFO L93 Difference]: Finished difference Result 584904 states and 748764 transitions. [2019-10-03 03:01:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:01:41,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-10-03 03:01:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:42,402 INFO L225 Difference]: With dead ends: 584904 [2019-10-03 03:01:42,402 INFO L226 Difference]: Without dead ends: 584904 [2019-10-03 03:01:42,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:01:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584904 states. [2019-10-03 03:01:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584904 to 282842. [2019-10-03 03:01:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282842 states. [2019-10-03 03:01:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282842 states to 282842 states and 364306 transitions. [2019-10-03 03:01:48,104 INFO L78 Accepts]: Start accepts. Automaton has 282842 states and 364306 transitions. Word has length 93 [2019-10-03 03:01:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,105 INFO L475 AbstractCegarLoop]: Abstraction has 282842 states and 364306 transitions. [2019-10-03 03:01:48,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 282842 states and 364306 transitions. [2019-10-03 03:01:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:01:48,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,115 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:48,116 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash -287132240, now seen corresponding path program 1 times [2019-10-03 03:01:48,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:01:48,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:48,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:48,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:48,259 INFO L87 Difference]: Start difference. First operand 282842 states and 364306 transitions. Second operand 9 states. [2019-10-03 03:01:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:51,655 INFO L93 Difference]: Finished difference Result 620629 states and 797038 transitions. [2019-10-03 03:01:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:01:51,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-03 03:01:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:52,438 INFO L225 Difference]: With dead ends: 620629 [2019-10-03 03:01:52,438 INFO L226 Difference]: Without dead ends: 620629 [2019-10-03 03:01:52,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:01:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620629 states. [2019-10-03 03:02:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620629 to 282827. [2019-10-03 03:02:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282827 states. [2019-10-03 03:02:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282827 states to 282827 states and 364290 transitions. [2019-10-03 03:02:03,445 INFO L78 Accepts]: Start accepts. Automaton has 282827 states and 364290 transitions. Word has length 93 [2019-10-03 03:02:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:03,445 INFO L475 AbstractCegarLoop]: Abstraction has 282827 states and 364290 transitions. [2019-10-03 03:02:03,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 282827 states and 364290 transitions. [2019-10-03 03:02:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:02:03,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:03,454 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:03,455 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1974005961, now seen corresponding path program 1 times [2019-10-03 03:02:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:03,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:03,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:03,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:03,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:03,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:03,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:03,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:03,589 INFO L87 Difference]: Start difference. First operand 282827 states and 364290 transitions. Second operand 9 states. [2019-10-03 03:02:05,524 WARN L191 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-10-03 03:02:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:14,051 INFO L93 Difference]: Finished difference Result 806317 states and 1037046 transitions. [2019-10-03 03:02:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:02:14,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-03 03:02:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:14,998 INFO L225 Difference]: With dead ends: 806317 [2019-10-03 03:02:14,998 INFO L226 Difference]: Without dead ends: 806317 [2019-10-03 03:02:15,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:02:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806317 states. [2019-10-03 03:02:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806317 to 283712. [2019-10-03 03:02:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283712 states. [2019-10-03 03:02:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283712 states to 283712 states and 365367 transitions. [2019-10-03 03:02:21,088 INFO L78 Accepts]: Start accepts. Automaton has 283712 states and 365367 transitions. Word has length 93 [2019-10-03 03:02:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:21,088 INFO L475 AbstractCegarLoop]: Abstraction has 283712 states and 365367 transitions. [2019-10-03 03:02:21,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 283712 states and 365367 transitions. [2019-10-03 03:02:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:02:21,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:21,096 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:21,097 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -440996839, now seen corresponding path program 1 times [2019-10-03 03:02:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:21,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:21,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:02:21,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:21,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:02:21,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:21,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:21,225 INFO L87 Difference]: Start difference. First operand 283712 states and 365367 transitions. Second operand 8 states. [2019-10-03 03:02:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,756 INFO L93 Difference]: Finished difference Result 470837 states and 605351 transitions. [2019-10-03 03:02:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:02:23,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-10-03 03:02:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:24,445 INFO L225 Difference]: With dead ends: 470837 [2019-10-03 03:02:24,445 INFO L226 Difference]: Without dead ends: 470837 [2019-10-03 03:02:24,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:02:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470837 states. [2019-10-03 03:02:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470837 to 283700. [2019-10-03 03:02:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283700 states. [2019-10-03 03:02:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283700 states to 283700 states and 365354 transitions. [2019-10-03 03:02:36,670 INFO L78 Accepts]: Start accepts. Automaton has 283700 states and 365354 transitions. Word has length 94 [2019-10-03 03:02:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:36,670 INFO L475 AbstractCegarLoop]: Abstraction has 283700 states and 365354 transitions. [2019-10-03 03:02:36,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 283700 states and 365354 transitions. [2019-10-03 03:02:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:02:36,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:36,680 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:36,681 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -602915897, now seen corresponding path program 1 times [2019-10-03 03:02:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:36,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:36,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:36,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-10-03 03:02:36,901 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:02:36,948 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:36,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:37,130 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:37,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:37,428 INFO L272 AbstractInterpreter]: Visited 89 different actions 206 times. Merged at 27 different actions 105 times. Widened at 1 different actions 1 times. Performed 1033 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:02:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:37,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:37,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:37,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:37,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:37,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:02:37,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:37,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:38,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:38,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:02:38,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:38,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-10-03 03:02:38,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:38,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:02:38,864 INFO L87 Difference]: Start difference. First operand 283700 states and 365354 transitions. Second operand 18 states. [2019-10-03 03:02:39,160 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:02:39,311 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:02:46,227 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-03 03:02:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:50,581 INFO L93 Difference]: Finished difference Result 724083 states and 926572 transitions. [2019-10-03 03:02:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:02:50,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-10-03 03:02:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:52,431 INFO L225 Difference]: With dead ends: 724083 [2019-10-03 03:02:52,431 INFO L226 Difference]: Without dead ends: 724083 [2019-10-03 03:02:52,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=382, Invalid=1424, Unknown=0, NotChecked=0, Total=1806 [2019-10-03 03:02:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724083 states. [2019-10-03 03:03:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724083 to 284357. [2019-10-03 03:03:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284357 states. [2019-10-03 03:03:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284357 states to 284357 states and 366152 transitions. [2019-10-03 03:03:04,246 INFO L78 Accepts]: Start accepts. Automaton has 284357 states and 366152 transitions. Word has length 94 [2019-10-03 03:03:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:04,246 INFO L475 AbstractCegarLoop]: Abstraction has 284357 states and 366152 transitions. [2019-10-03 03:03:04,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:03:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 284357 states and 366152 transitions. [2019-10-03 03:03:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:03:04,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:04,259 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:04,259 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1717699109, now seen corresponding path program 1 times [2019-10-03 03:03:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:04,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:04,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:04,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-10-03 03:03:04,420 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [166], [169], [170], [172], [175], [180], [182], [203], [205], [1028], [1272], [1276], [1387], [1460], [1463], [1466], [1470], [1473], [1477], [1481], [1483], [1486], [1489], [1493], [2148], [2151], [2154], [2170], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [3479], [3482], [3486], [3488], [3491], [3494], [3498], [3502], [3505], [3508], [3511], [3513], [3542], [3561], [3563], [3582], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:03:04,429 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:04,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:04,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:04,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:04,855 INFO L272 AbstractInterpreter]: Visited 89 different actions 225 times. Merged at 28 different actions 124 times. Widened at 5 different actions 5 times. Performed 1104 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:03:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:04,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:04,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:05,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:05,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:05,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-03 03:03:05,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:05,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:05,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [5] total 21 [2019-10-03 03:03:06,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:06,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:03:06,199 INFO L87 Difference]: Start difference. First operand 284357 states and 366152 transitions. Second operand 10 states. [2019-10-03 03:03:07,187 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:03:07,767 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-03 03:03:09,065 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:03:09,621 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-03 03:03:09,859 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:03:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:11,581 INFO L93 Difference]: Finished difference Result 625233 states and 796875 transitions. [2019-10-03 03:03:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 03:03:11,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 03:03:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:12,523 INFO L225 Difference]: With dead ends: 625233 [2019-10-03 03:03:12,523 INFO L226 Difference]: Without dead ends: 625233 [2019-10-03 03:03:12,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:03:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625233 states. [2019-10-03 03:03:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625233 to 350212. [2019-10-03 03:03:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350212 states. [2019-10-03 03:03:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350212 states to 350212 states and 449097 transitions. [2019-10-03 03:03:27,490 INFO L78 Accepts]: Start accepts. Automaton has 350212 states and 449097 transitions. Word has length 94 [2019-10-03 03:03:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:27,490 INFO L475 AbstractCegarLoop]: Abstraction has 350212 states and 449097 transitions. [2019-10-03 03:03:27,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 350212 states and 449097 transitions. [2019-10-03 03:03:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:03:27,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:27,501 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:27,501 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash 982202329, now seen corresponding path program 1 times [2019-10-03 03:03:27,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:27,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:27,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:27,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:27,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:03:27,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:27,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:03:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:03:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:03:27,741 INFO L87 Difference]: Start difference. First operand 350212 states and 449097 transitions. Second operand 12 states. [2019-10-03 03:03:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:37,495 INFO L93 Difference]: Finished difference Result 745116 states and 953288 transitions. [2019-10-03 03:03:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:03:37,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-10-03 03:03:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:38,475 INFO L225 Difference]: With dead ends: 745116 [2019-10-03 03:03:38,475 INFO L226 Difference]: Without dead ends: 745116 [2019-10-03 03:03:38,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:03:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745116 states. [2019-10-03 03:03:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745116 to 357602. [2019-10-03 03:03:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357602 states. [2019-10-03 03:03:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357602 states to 357602 states and 458603 transitions. [2019-10-03 03:03:46,301 INFO L78 Accepts]: Start accepts. Automaton has 357602 states and 458603 transitions. Word has length 95 [2019-10-03 03:03:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:46,301 INFO L475 AbstractCegarLoop]: Abstraction has 357602 states and 458603 transitions. [2019-10-03 03:03:46,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:03:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 357602 states and 458603 transitions. [2019-10-03 03:03:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:03:46,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:46,311 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:46,311 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2084722691, now seen corresponding path program 1 times [2019-10-03 03:03:46,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:46,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:46,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:46,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:46,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:03:46,434 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [3274], [3278], [3282], [3301], [3303], [3708], [3722], [3724], [3728], [4353], [4613], [4617], [4620], [4623], [4626], [4629], [4632], [4636], [4639], [4643], [4646], [4650], [4682], [4685], [4689], [4692], [4696], [4698], [4701], [4704], [4708], [4712], [4716], [4799], [4801], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:03:46,438 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:46,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:46,509 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:46,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:46,717 INFO L272 AbstractInterpreter]: Visited 90 different actions 215 times. Merged at 30 different actions 114 times. Widened at 5 different actions 8 times. Performed 1078 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1078 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 253 variables. [2019-10-03 03:03:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:46,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:46,717 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-10-03 03:03:46,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:46,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:46,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:03:46,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:47,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:47,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:03:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-10-03 03:03:47,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:47,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:03:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:03:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:03:47,729 INFO L87 Difference]: Start difference. First operand 357602 states and 458603 transitions. Second operand 9 states. [2019-10-03 03:03:48,512 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-03 03:03:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:51,514 INFO L93 Difference]: Finished difference Result 480725 states and 614538 transitions. [2019-10-03 03:03:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:03:51,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-10-03 03:03:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:52,157 INFO L225 Difference]: With dead ends: 480725 [2019-10-03 03:03:52,157 INFO L226 Difference]: Without dead ends: 480725 [2019-10-03 03:03:52,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:03:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480725 states. [2019-10-03 03:04:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480725 to 357592. [2019-10-03 03:04:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357592 states. [2019-10-03 03:04:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357592 states to 357592 states and 458374 transitions. [2019-10-03 03:04:03,549 INFO L78 Accepts]: Start accepts. Automaton has 357592 states and 458374 transitions. Word has length 95 [2019-10-03 03:04:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:03,549 INFO L475 AbstractCegarLoop]: Abstraction has 357592 states and 458374 transitions. [2019-10-03 03:04:03,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:04:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 357592 states and 458374 transitions. [2019-10-03 03:04:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:04:03,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:03,560 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:03,561 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1487914464, now seen corresponding path program 1 times [2019-10-03 03:04:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:03,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:03,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:03,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:03,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:03,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:03,640 INFO L87 Difference]: Start difference. First operand 357592 states and 458374 transitions. Second operand 3 states. [2019-10-03 03:04:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:04,547 INFO L93 Difference]: Finished difference Result 357594 states and 450087 transitions. [2019-10-03 03:04:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-03 03:04:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:04,965 INFO L225 Difference]: With dead ends: 357594 [2019-10-03 03:04:04,965 INFO L226 Difference]: Without dead ends: 357594 [2019-10-03 03:04:04,965 INFO L640 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-10-03 03:04:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357594 states. [2019-10-03 03:04:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357594 to 357475. [2019-10-03 03:04:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357475 states. [2019-10-03 03:04:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357475 states to 357475 states and 449956 transitions. [2019-10-03 03:04:16,242 INFO L78 Accepts]: Start accepts. Automaton has 357475 states and 449956 transitions. Word has length 95 [2019-10-03 03:04:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:16,243 INFO L475 AbstractCegarLoop]: Abstraction has 357475 states and 449956 transitions. [2019-10-03 03:04:16,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 357475 states and 449956 transitions. [2019-10-03 03:04:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:04:16,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:16,251 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:16,251 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash -286705209, now seen corresponding path program 1 times [2019-10-03 03:04:16,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:16,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:16,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:16,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:16,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:16,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:16,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:04:16,377 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2182], [2198], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:04:16,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:16,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:16,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:16,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:16,629 INFO L272 AbstractInterpreter]: Visited 90 different actions 213 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:04:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:16,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:16,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:16,630 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-10-03 03:04:16,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:16,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:16,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 03:04:16,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:16,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:17,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:17,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-03 03:04:17,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:17,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:04:17,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:04:17,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:04:17,064 INFO L87 Difference]: Start difference. First operand 357475 states and 449956 transitions. Second operand 6 states. [2019-10-03 03:04:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:23,845 INFO L93 Difference]: Finished difference Result 548339 states and 681450 transitions. [2019-10-03 03:04:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:04:23,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 03:04:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:24,681 INFO L225 Difference]: With dead ends: 548339 [2019-10-03 03:04:24,681 INFO L226 Difference]: Without dead ends: 548339 [2019-10-03 03:04:24,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:04:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548339 states. [2019-10-03 03:04:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548339 to 439618. [2019-10-03 03:04:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439618 states. [2019-10-03 03:04:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439618 states to 439618 states and 551461 transitions. [2019-10-03 03:04:31,520 INFO L78 Accepts]: Start accepts. Automaton has 439618 states and 551461 transitions. Word has length 95 [2019-10-03 03:04:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:31,520 INFO L475 AbstractCegarLoop]: Abstraction has 439618 states and 551461 transitions. [2019-10-03 03:04:31,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:04:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 439618 states and 551461 transitions. [2019-10-03 03:04:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:04:31,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:31,531 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:31,532 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash -802766303, now seen corresponding path program 1 times [2019-10-03 03:04:31,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:31,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:31,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:31,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:31,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:31,608 INFO L87 Difference]: Start difference. First operand 439618 states and 551461 transitions. Second operand 3 states. [2019-10-03 03:04:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:34,296 INFO L93 Difference]: Finished difference Result 436185 states and 543649 transitions. [2019-10-03 03:04:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:34,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 03:04:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:34,785 INFO L225 Difference]: With dead ends: 436185 [2019-10-03 03:04:34,785 INFO L226 Difference]: Without dead ends: 436185 [2019-10-03 03:04:34,785 INFO L640 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-10-03 03:04:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436185 states. [2019-10-03 03:04:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436185 to 435821. [2019-10-03 03:04:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435821 states. [2019-10-03 03:04:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435821 states to 435821 states and 543266 transitions. [2019-10-03 03:04:48,078 INFO L78 Accepts]: Start accepts. Automaton has 435821 states and 543266 transitions. Word has length 96 [2019-10-03 03:04:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:48,078 INFO L475 AbstractCegarLoop]: Abstraction has 435821 states and 543266 transitions. [2019-10-03 03:04:48,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 435821 states and 543266 transitions. [2019-10-03 03:04:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:04:48,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:48,086 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:48,086 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1316813398, now seen corresponding path program 1 times [2019-10-03 03:04:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:48,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:04:48,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:04:48,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:48,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:04:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:04:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:04:48,146 INFO L87 Difference]: Start difference. First operand 435821 states and 543266 transitions. Second operand 4 states. [2019-10-03 03:04:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:55,396 INFO L93 Difference]: Finished difference Result 741248 states and 921125 transitions. [2019-10-03 03:04:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:04:55,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-03 03:04:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:56,427 INFO L225 Difference]: With dead ends: 741248 [2019-10-03 03:04:56,427 INFO L226 Difference]: Without dead ends: 741248 [2019-10-03 03:04:56,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:04:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741248 states. [2019-10-03 03:05:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741248 to 466052. [2019-10-03 03:05:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466052 states. [2019-10-03 03:05:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466052 states to 466052 states and 582364 transitions. [2019-10-03 03:05:04,445 INFO L78 Accepts]: Start accepts. Automaton has 466052 states and 582364 transitions. Word has length 97 [2019-10-03 03:05:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:04,445 INFO L475 AbstractCegarLoop]: Abstraction has 466052 states and 582364 transitions. [2019-10-03 03:05:04,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:05:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 466052 states and 582364 transitions. [2019-10-03 03:05:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:05:04,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:04,454 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:04,454 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1191866658, now seen corresponding path program 1 times [2019-10-03 03:05:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:04,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:05:04,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:04,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:05:04,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:04,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:05:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:05:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:04,543 INFO L87 Difference]: Start difference. First operand 466052 states and 582364 transitions. Second operand 5 states. [2019-10-03 03:05:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:06,871 INFO L93 Difference]: Finished difference Result 510539 states and 634979 transitions. [2019-10-03 03:05:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:05:06,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-03 03:05:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:07,511 INFO L225 Difference]: With dead ends: 510539 [2019-10-03 03:05:07,511 INFO L226 Difference]: Without dead ends: 510539 [2019-10-03 03:05:07,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:05:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510539 states. [2019-10-03 03:05:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510539 to 448836. [2019-10-03 03:05:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448836 states. [2019-10-03 03:05:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448836 states to 448836 states and 559107 transitions. [2019-10-03 03:05:20,186 INFO L78 Accepts]: Start accepts. Automaton has 448836 states and 559107 transitions. Word has length 97 [2019-10-03 03:05:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:20,186 INFO L475 AbstractCegarLoop]: Abstraction has 448836 states and 559107 transitions. [2019-10-03 03:05:20,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:05:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 448836 states and 559107 transitions. [2019-10-03 03:05:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 03:05:20,195 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:20,195 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:20,195 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash -186718423, now seen corresponding path program 1 times [2019-10-03 03:05:20,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:20,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:20,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:20,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:20,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:05:20,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:20,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:05:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:05:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:20,266 INFO L87 Difference]: Start difference. First operand 448836 states and 559107 transitions. Second operand 5 states. [2019-10-03 03:05:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:22,699 INFO L93 Difference]: Finished difference Result 454664 states and 558772 transitions. [2019-10-03 03:05:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:05:22,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-03 03:05:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:23,286 INFO L225 Difference]: With dead ends: 454664 [2019-10-03 03:05:23,286 INFO L226 Difference]: Without dead ends: 454664 [2019-10-03 03:05:23,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:05:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454664 states. [2019-10-03 03:05:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454664 to 415543. [2019-10-03 03:05:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415543 states. [2019-10-03 03:05:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415543 states to 415543 states and 509629 transitions. [2019-10-03 03:05:36,151 INFO L78 Accepts]: Start accepts. Automaton has 415543 states and 509629 transitions. Word has length 98 [2019-10-03 03:05:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:36,151 INFO L475 AbstractCegarLoop]: Abstraction has 415543 states and 509629 transitions. [2019-10-03 03:05:36,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:05:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 415543 states and 509629 transitions. [2019-10-03 03:05:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 03:05:36,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:36,158 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:36,159 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1378332097, now seen corresponding path program 1 times [2019-10-03 03:05:36,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:36,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:36,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:36,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:05:36,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:36,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:05:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:05:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:36,251 INFO L87 Difference]: Start difference. First operand 415543 states and 509629 transitions. Second operand 5 states. [2019-10-03 03:05:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:38,517 INFO L93 Difference]: Finished difference Result 511518 states and 626410 transitions. [2019-10-03 03:05:38,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:05:38,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-03 03:05:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:39,145 INFO L225 Difference]: With dead ends: 511518 [2019-10-03 03:05:39,145 INFO L226 Difference]: Without dead ends: 511518 [2019-10-03 03:05:39,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:05:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511518 states. [2019-10-03 03:05:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511518 to 465640. [2019-10-03 03:05:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465640 states. [2019-10-03 03:05:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465640 states to 465640 states and 569853 transitions. [2019-10-03 03:05:52,181 INFO L78 Accepts]: Start accepts. Automaton has 465640 states and 569853 transitions. Word has length 98 [2019-10-03 03:05:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:52,181 INFO L475 AbstractCegarLoop]: Abstraction has 465640 states and 569853 transitions. [2019-10-03 03:05:52,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:05:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 465640 states and 569853 transitions. [2019-10-03 03:05:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 03:05:52,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:52,191 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:52,191 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1537742470, now seen corresponding path program 1 times [2019-10-03 03:05:52,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:52,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:52,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 03:05:52,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:52,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:05:52,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:52,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:05:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:05:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:05:52,257 INFO L87 Difference]: Start difference. First operand 465640 states and 569853 transitions. Second operand 3 states. [2019-10-03 03:05:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:53,170 INFO L93 Difference]: Finished difference Result 424431 states and 515001 transitions. [2019-10-03 03:05:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:05:53,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-03 03:05:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:53,823 INFO L225 Difference]: With dead ends: 424431 [2019-10-03 03:05:53,824 INFO L226 Difference]: Without dead ends: 407809 [2019-10-03 03:05:53,824 INFO L640 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-10-03 03:05:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407809 states. [2019-10-03 03:06:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407809 to 282115. [2019-10-03 03:06:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282115 states. [2019-10-03 03:06:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282115 states to 282115 states and 343967 transitions. [2019-10-03 03:06:05,233 INFO L78 Accepts]: Start accepts. Automaton has 282115 states and 343967 transitions. Word has length 100 [2019-10-03 03:06:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:05,233 INFO L475 AbstractCegarLoop]: Abstraction has 282115 states and 343967 transitions. [2019-10-03 03:06:05,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:06:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 282115 states and 343967 transitions. [2019-10-03 03:06:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:06:05,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:05,241 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:05,241 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash 887178001, now seen corresponding path program 1 times [2019-10-03 03:06:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:05,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:05,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:05,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:05,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:06:05,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:05,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:06:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:06:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:06:05,295 INFO L87 Difference]: Start difference. First operand 282115 states and 343967 transitions. Second operand 3 states. [2019-10-03 03:06:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:06,022 INFO L93 Difference]: Finished difference Result 337582 states and 408755 transitions. [2019-10-03 03:06:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:06:06,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-03 03:06:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:07,610 INFO L225 Difference]: With dead ends: 337582 [2019-10-03 03:06:07,610 INFO L226 Difference]: Without dead ends: 337582 [2019-10-03 03:06:07,610 INFO L640 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-10-03 03:06:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337582 states. [2019-10-03 03:06:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337582 to 273229. [2019-10-03 03:06:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273229 states. [2019-10-03 03:06:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273229 states to 273229 states and 331817 transitions. [2019-10-03 03:06:11,377 INFO L78 Accepts]: Start accepts. Automaton has 273229 states and 331817 transitions. Word has length 101 [2019-10-03 03:06:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:11,377 INFO L475 AbstractCegarLoop]: Abstraction has 273229 states and 331817 transitions. [2019-10-03 03:06:11,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:06:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 273229 states and 331817 transitions. [2019-10-03 03:06:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 03:06:11,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:11,386 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:11,386 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1476573405, now seen corresponding path program 1 times [2019-10-03 03:06:11,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:11,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:11,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:06:11,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:11,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:06:11,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:11,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:06:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:06:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:06:11,550 INFO L87 Difference]: Start difference. First operand 273229 states and 331817 transitions. Second operand 9 states. [2019-10-03 03:06:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:17,865 INFO L93 Difference]: Finished difference Result 395155 states and 478016 transitions. [2019-10-03 03:06:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:06:17,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-03 03:06:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:18,409 INFO L225 Difference]: With dead ends: 395155 [2019-10-03 03:06:18,409 INFO L226 Difference]: Without dead ends: 395155 [2019-10-03 03:06:18,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:06:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395155 states. [2019-10-03 03:06:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395155 to 273229. [2019-10-03 03:06:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273229 states. [2019-10-03 03:06:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273229 states to 273229 states and 331815 transitions. [2019-10-03 03:06:21,730 INFO L78 Accepts]: Start accepts. Automaton has 273229 states and 331815 transitions. Word has length 103 [2019-10-03 03:06:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:21,730 INFO L475 AbstractCegarLoop]: Abstraction has 273229 states and 331815 transitions. [2019-10-03 03:06:21,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:06:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 273229 states and 331815 transitions. [2019-10-03 03:06:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:06:21,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:21,743 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:21,743 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1536461249, now seen corresponding path program 1 times [2019-10-03 03:06:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:21,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:21,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:21,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:06:21,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-10-03 03:06:21,954 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2154], [2157], [2162], [2165], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2220], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [2266], [2269], [2272], [2275], [2283], [2285], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3744], [3747], [3750], [3753], [3756], [3760], [3763], [3767], [3770], [3774], [3806], [3809], [3813], [3816], [3819], [3822], [3827], [3830], [3833], [3836], [3840], [3844], [3848], [3851], [3854], [3857], [3865], [3869], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:06:21,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:06:21,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:06:22,005 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:06:22,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:06:22,373 INFO L272 AbstractInterpreter]: Visited 99 different actions 430 times. Merged at 38 different actions 302 times. Widened at 15 different actions 50 times. Performed 1607 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 255 variables. [2019-10-03 03:06:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:22,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:06:22,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:22,374 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-10-03 03:06:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:22,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:06:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:22,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:06:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:06:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:23,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:06:24,126 WARN L191 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-10-03 03:06:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:24,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:24,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:27,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:06:27,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-10-03 03:06:27,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:06:27,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:06:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:06:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:06:27,861 INFO L87 Difference]: Start difference. First operand 273229 states and 331815 transitions. Second operand 19 states. [2019-10-03 03:06:28,342 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:06:28,536 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:06:28,899 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:06:29,287 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:06:29,507 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:06:30,134 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-03 03:06:30,294 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:06:30,581 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-03 03:06:32,461 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:06:33,085 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:06:33,669 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:06:34,225 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-03 03:06:34,544 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-03 03:06:34,947 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-03 03:06:35,706 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:06:37,446 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:06:38,147 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:06:38,460 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-03 03:06:38,920 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-03 03:06:39,089 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:06:39,418 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:06:39,694 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-03 03:06:39,956 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:06:40,163 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-03 03:06:41,059 WARN L191 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-03 03:06:41,601 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:06:41,948 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-10-03 03:06:42,184 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-03 03:06:43,200 WARN L191 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:06:44,177 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:06:44,885 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-10-03 03:06:45,317 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:06:46,220 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:06:46,686 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:06:47,135 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:06:47,533 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:06:48,026 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:06:48,923 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:06:49,821 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-03 03:06:50,470 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:06:50,921 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:06:51,159 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:06:51,510 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:06:52,030 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:06:52,341 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:06:53,192 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-03 03:06:53,557 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:06:54,214 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:06:54,749 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:06:55,279 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:06:55,662 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:06:56,028 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:06:56,306 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:06:56,704 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:06:57,485 WARN L191 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:06:57,981 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:06:58,609 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:06:58,899 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:06:59,109 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:06:59,345 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:06:59,801 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:00,418 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:07:00,953 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:01,576 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:07:01,834 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:07:02,313 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:03,482 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:03,863 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:07:04,251 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:07:04,744 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:05,128 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:07:05,588 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:07:06,002 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:07:06,416 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:07,212 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:07,554 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:08,148 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:09,207 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:07:09,504 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:10,285 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-10-03 03:07:10,899 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-03 03:07:11,395 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:07:12,565 WARN L191 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:07:12,818 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-03 03:07:13,370 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:07:13,693 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:07:14,201 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:07:14,764 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-03 03:07:15,327 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:16,210 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-10-03 03:07:16,991 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:18,144 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:07:19,026 WARN L191 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-03 03:07:19,421 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:07:19,751 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-03 03:07:21,167 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:07:21,449 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:07:22,330 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:07:22,586 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-03 03:07:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:23,765 INFO L93 Difference]: Finished difference Result 551357 states and 661040 transitions. [2019-10-03 03:07:23,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-03 03:07:23,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 104 [2019-10-03 03:07:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:23,767 INFO L225 Difference]: With dead ends: 551357 [2019-10-03 03:07:23,767 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 03:07:23,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 16 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5295 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=3496, Invalid=12760, Unknown=0, NotChecked=0, Total=16256 [2019-10-03 03:07:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 03:07:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 03:07:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 03:07:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 03:07:23,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-10-03 03:07:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:23,772 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 03:07:23,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:07:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 03:07:23,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 03:07:23,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:07:23 BoogieIcfgContainer [2019-10-03 03:07:23,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:07:23,779 INFO L168 Benchmark]: Toolchain (without parser) took 438271.49 ms. Allocated memory was 140.0 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 81.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-10-03 03:07:23,780 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 03:07:23,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1605.54 ms. Allocated memory was 140.0 MB in the beginning and 222.3 MB in the end (delta: 82.3 MB). Free memory was 81.5 MB in the beginning and 129.0 MB in the end (delta: -47.5 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:07:23,781 INFO L168 Benchmark]: Boogie Preprocessor took 292.66 ms. Allocated memory is still 222.3 MB. Free memory was 129.0 MB in the beginning and 115.2 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:07:23,781 INFO L168 Benchmark]: RCFGBuilder took 3489.59 ms. Allocated memory was 222.3 MB in the beginning and 339.7 MB in the end (delta: 117.4 MB). Free memory was 115.2 MB in the beginning and 185.8 MB in the end (delta: -70.6 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2019-10-03 03:07:23,782 INFO L168 Benchmark]: TraceAbstraction took 432878.83 ms. Allocated memory was 339.7 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 185.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 03:07:23,784 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1605.54 ms. Allocated memory was 140.0 MB in the beginning and 222.3 MB in the end (delta: 82.3 MB). Free memory was 81.5 MB in the beginning and 129.0 MB in the end (delta: -47.5 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 292.66 ms. Allocated memory is still 222.3 MB. Free memory was 129.0 MB in the beginning and 115.2 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3489.59 ms. Allocated memory was 222.3 MB in the beginning and 339.7 MB in the end (delta: 117.4 MB). Free memory was 115.2 MB in the beginning and 185.8 MB in the end (delta: -70.6 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 432878.83 ms. Allocated memory was 339.7 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 185.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5743]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3451]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1259 locations, 6 error locations. SAFE Result, 432.8s OverallTime, 48 OverallIterations, 2 TraceHistogramMax, 211.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28472 SDtfs, 95290 SDslu, 81766 SDs, 0 SdLazy, 51295 SolverSat, 2963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1757 GetRequests, 1018 SyntacticMatches, 39 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8242 ImplicationChecksByTransitivity, 68.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466052occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 200.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 3979365 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 4231 NumberOfCodeBlocks, 4231 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4655 ConstructedInterpolants, 132 QuantifiedInterpolants, 3607042 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6770 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 58 InterpolantComputations, 47 PerfectInterpolantSequences, 212/258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...