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.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:26:12,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:26:12,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:26:12,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:26:12,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:26:12,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:26:12,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:26:12,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:26:12,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:26:12,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:26:12,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:26:12,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:26:12,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:26:12,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:26:12,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:26:12,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:26:12,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:26:12,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:26:12,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:26:12,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:26:12,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:26:12,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:26:12,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:26:12,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:26:12,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:26:12,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:26:12,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:26:12,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:26:12,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:26:12,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:26:12,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:26:12,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:26:12,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:26:12,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:26:12,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:26:12,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:26:12,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:26:12,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:26:12,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:26:12,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:26:12,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:26:12,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:26:12,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:26:12,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:26:12,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:26:12,532 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:26:12,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:26:12,533 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:26:12,533 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:26:12,534 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:26:12,534 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:26:12,534 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:26:12,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:26:12,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:26:12,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:26:12,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:26:12,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:26:12,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:26:12,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:26:12,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:26:12,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:26:12,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:26:12,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:26:12,537 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:26:12,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:26:12,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:26:12,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:26:12,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:26:12,538 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:26:12,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:26:12,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:26:12,539 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:26:12,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:26:12,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:26:12,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:26:12,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:26:12,597 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:26:12,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:26:12,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc64974c/08a0e47cce31477f87d703f2d59abc65/FLAG647d36b10 [2019-09-10 07:26:13,207 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:26:13,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:26:13,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc64974c/08a0e47cce31477f87d703f2d59abc65/FLAG647d36b10 [2019-09-10 07:26:13,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc64974c/08a0e47cce31477f87d703f2d59abc65 [2019-09-10 07:26:13,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:26:13,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:26:13,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:26:13,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:26:13,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:26:13,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:26:13" (1/1) ... [2019-09-10 07:26:13,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f6f253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:13, skipping insertion in model container [2019-09-10 07:26:13,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:26:13" (1/1) ... [2019-09-10 07:26:13,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:26:13,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:26:14,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:26:14,361 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:26:14,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:26:14,617 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:26:14,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14 WrapperNode [2019-09-10 07:26:14,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:26:14,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:26:14,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:26:14,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:26:14,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... [2019-09-10 07:26:14,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:26:14,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:26:14,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:26:14,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:26:14,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:26:14,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:26:14,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:26:14,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:26:14,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:26:14,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:26:14,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:26:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:26:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:26:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:26:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:26:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:26:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:26:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:26:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:26:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:26:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:26:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:26:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:26:16,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:26:16,435 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:26:16,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:26:16 BoogieIcfgContainer [2019-09-10 07:26:16,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:26:16,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:26:16,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:26:16,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:26:16,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:26:13" (1/3) ... [2019-09-10 07:26:16,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c82294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:26:16, skipping insertion in model container [2019-09-10 07:26:16,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:26:14" (2/3) ... [2019-09-10 07:26:16,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c82294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:26:16, skipping insertion in model container [2019-09-10 07:26:16,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:26:16" (3/3) ... [2019-09-10 07:26:16,446 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:26:16,457 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:26:16,468 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:26:16,488 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:26:16,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:26:16,520 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:26:16,520 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:26:16,520 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:26:16,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:26:16,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:26:16,521 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:26:16,521 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:26:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2019-09-10 07:26:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:26:16,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:16,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:16,581 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1790086, now seen corresponding path program 1 times [2019-09-10 07:26:16,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:16,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:16,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:17,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:17,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:17,206 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 5 states. [2019-09-10 07:26:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:17,829 INFO L93 Difference]: Finished difference Result 335 states and 534 transitions. [2019-09-10 07:26:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:17,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:26:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:17,859 INFO L225 Difference]: With dead ends: 335 [2019-09-10 07:26:17,859 INFO L226 Difference]: Without dead ends: 323 [2019-09-10 07:26:17,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-10 07:26:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 296. [2019-09-10 07:26:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-10 07:26:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 379 transitions. [2019-09-10 07:26:17,928 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 379 transitions. Word has length 52 [2019-09-10 07:26:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:17,928 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 379 transitions. [2019-09-10 07:26:17,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 379 transitions. [2019-09-10 07:26:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:26:17,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:17,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:17,933 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1791591749, now seen corresponding path program 1 times [2019-09-10 07:26:17,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:17,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:18,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:18,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:18,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:18,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:18,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:18,124 INFO L87 Difference]: Start difference. First operand 296 states and 379 transitions. Second operand 5 states. [2019-09-10 07:26:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:18,437 INFO L93 Difference]: Finished difference Result 280 states and 359 transitions. [2019-09-10 07:26:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:18,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:26:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:18,444 INFO L225 Difference]: With dead ends: 280 [2019-09-10 07:26:18,445 INFO L226 Difference]: Without dead ends: 280 [2019-09-10 07:26:18,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-10 07:26:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-10 07:26:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 07:26:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 359 transitions. [2019-09-10 07:26:18,470 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 359 transitions. Word has length 52 [2019-09-10 07:26:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:18,471 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 359 transitions. [2019-09-10 07:26:18,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 359 transitions. [2019-09-10 07:26:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:26:18,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:18,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:18,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 142197449, now seen corresponding path program 1 times [2019-09-10 07:26:18,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:18,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:18,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:18,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:18,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:18,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:18,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:18,594 INFO L87 Difference]: Start difference. First operand 280 states and 359 transitions. Second operand 5 states. [2019-09-10 07:26:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:18,800 INFO L93 Difference]: Finished difference Result 230 states and 294 transitions. [2019-09-10 07:26:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:18,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:26:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:18,804 INFO L225 Difference]: With dead ends: 230 [2019-09-10 07:26:18,805 INFO L226 Difference]: Without dead ends: 230 [2019-09-10 07:26:18,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-10 07:26:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-09-10 07:26:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-10 07:26:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 294 transitions. [2019-09-10 07:26:18,828 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 294 transitions. Word has length 52 [2019-09-10 07:26:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:18,828 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 294 transitions. [2019-09-10 07:26:18,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 294 transitions. [2019-09-10 07:26:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:26:18,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:18,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:18,835 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1470629779, now seen corresponding path program 1 times [2019-09-10 07:26:18,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:18,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:19,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:19,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:26:19,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:19,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:26:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:26:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:26:19,112 INFO L87 Difference]: Start difference. First operand 230 states and 294 transitions. Second operand 8 states. [2019-09-10 07:26:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:19,577 INFO L93 Difference]: Finished difference Result 355 states and 457 transitions. [2019-09-10 07:26:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:26:19,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-09-10 07:26:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:19,581 INFO L225 Difference]: With dead ends: 355 [2019-09-10 07:26:19,581 INFO L226 Difference]: Without dead ends: 355 [2019-09-10 07:26:19,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:26:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-10 07:26:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 230. [2019-09-10 07:26:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-10 07:26:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 293 transitions. [2019-09-10 07:26:19,591 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 293 transitions. Word has length 54 [2019-09-10 07:26:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:19,592 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 293 transitions. [2019-09-10 07:26:19,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:26:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 293 transitions. [2019-09-10 07:26:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:26:19,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:19,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:19,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1262249389, now seen corresponding path program 1 times [2019-09-10 07:26:19,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:19,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:19,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:19,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:19,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:19,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:19,774 INFO L87 Difference]: Start difference. First operand 230 states and 293 transitions. Second operand 9 states. [2019-09-10 07:26:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:20,636 INFO L93 Difference]: Finished difference Result 546 states and 741 transitions. [2019-09-10 07:26:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:26:20,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:26:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:20,645 INFO L225 Difference]: With dead ends: 546 [2019-09-10 07:26:20,645 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 07:26:20,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:26:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 07:26:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 230. [2019-09-10 07:26:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-10 07:26:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 292 transitions. [2019-09-10 07:26:20,657 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 292 transitions. Word has length 54 [2019-09-10 07:26:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:20,657 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 292 transitions. [2019-09-10 07:26:20,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 292 transitions. [2019-09-10 07:26:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:26:20,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:20,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:20,660 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1230659379, now seen corresponding path program 1 times [2019-09-10 07:26:20,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:20,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:20,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:20,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:20,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:20,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:20,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:20,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:20,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:20,842 INFO L87 Difference]: Start difference. First operand 230 states and 292 transitions. Second operand 9 states. [2019-09-10 07:26:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:21,784 INFO L93 Difference]: Finished difference Result 452 states and 617 transitions. [2019-09-10 07:26:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:26:21,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:26:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:21,789 INFO L225 Difference]: With dead ends: 452 [2019-09-10 07:26:21,789 INFO L226 Difference]: Without dead ends: 452 [2019-09-10 07:26:21,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:26:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-10 07:26:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 230. [2019-09-10 07:26:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-10 07:26:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 291 transitions. [2019-09-10 07:26:21,800 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 291 transitions. Word has length 54 [2019-09-10 07:26:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:21,801 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 291 transitions. [2019-09-10 07:26:21,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2019-09-10 07:26:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:26:21,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:21,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:21,802 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1979337398, now seen corresponding path program 1 times [2019-09-10 07:26:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:21,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:21,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:22,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:22,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:26:22,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:26:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:26:22,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:26:22,383 INFO L87 Difference]: Start difference. First operand 230 states and 291 transitions. Second operand 13 states. [2019-09-10 07:26:23,007 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 07:26:23,169 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 07:26:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:24,117 INFO L93 Difference]: Finished difference Result 739 states and 1033 transitions. [2019-09-10 07:26:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:26:24,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-09-10 07:26:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:24,128 INFO L225 Difference]: With dead ends: 739 [2019-09-10 07:26:24,128 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 07:26:24,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:26:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 07:26:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 218. [2019-09-10 07:26:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-10 07:26:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 277 transitions. [2019-09-10 07:26:24,146 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 277 transitions. Word has length 55 [2019-09-10 07:26:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:24,147 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 277 transitions. [2019-09-10 07:26:24,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:26:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 277 transitions. [2019-09-10 07:26:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:26:24,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:24,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:24,150 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash 245455922, now seen corresponding path program 1 times [2019-09-10 07:26:24,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:24,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:24,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:24,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:24,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:25,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:25,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:26:25,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:25,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:26:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:26:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:26:25,096 INFO L87 Difference]: Start difference. First operand 218 states and 277 transitions. Second operand 16 states. [2019-09-10 07:26:25,622 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:26:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:26,632 INFO L93 Difference]: Finished difference Result 388 states and 495 transitions. [2019-09-10 07:26:26,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:26:26,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-10 07:26:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:26,639 INFO L225 Difference]: With dead ends: 388 [2019-09-10 07:26:26,639 INFO L226 Difference]: Without dead ends: 388 [2019-09-10 07:26:26,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:26:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-10 07:26:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 222. [2019-09-10 07:26:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-10 07:26:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 283 transitions. [2019-09-10 07:26:26,648 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 283 transitions. Word has length 56 [2019-09-10 07:26:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:26,649 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 283 transitions. [2019-09-10 07:26:26,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:26:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2019-09-10 07:26:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:26:26,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:26,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:26,651 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:26,651 INFO L82 PathProgramCache]: Analyzing trace with hash -44757294, now seen corresponding path program 1 times [2019-09-10 07:26:26,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:26,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:27,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:26:27,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:27,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:26:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:26:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:26:27,329 INFO L87 Difference]: Start difference. First operand 222 states and 283 transitions. Second operand 15 states. [2019-09-10 07:26:27,870 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:26:28,006 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:26:28,150 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:26:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:28,879 INFO L93 Difference]: Finished difference Result 358 states and 479 transitions. [2019-09-10 07:26:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:26:28,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-09-10 07:26:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:28,882 INFO L225 Difference]: With dead ends: 358 [2019-09-10 07:26:28,883 INFO L226 Difference]: Without dead ends: 358 [2019-09-10 07:26:28,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:26:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-10 07:26:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 222. [2019-09-10 07:26:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-10 07:26:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 282 transitions. [2019-09-10 07:26:28,890 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 282 transitions. Word has length 56 [2019-09-10 07:26:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:28,890 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 282 transitions. [2019-09-10 07:26:28,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:26:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 282 transitions. [2019-09-10 07:26:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:26:28,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:28,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:28,892 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1652172464, now seen corresponding path program 1 times [2019-09-10 07:26:28,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:28,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:28,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:26:29,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:29,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:26:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:26:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:26:29,497 INFO L87 Difference]: Start difference. First operand 222 states and 282 transitions. Second operand 19 states. [2019-09-10 07:26:29,655 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:26:30,258 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:26:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:31,403 INFO L93 Difference]: Finished difference Result 294 states and 371 transitions. [2019-09-10 07:26:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:26:31,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-09-10 07:26:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:31,407 INFO L225 Difference]: With dead ends: 294 [2019-09-10 07:26:31,407 INFO L226 Difference]: Without dead ends: 294 [2019-09-10 07:26:31,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:26:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-10 07:26:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 214. [2019-09-10 07:26:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 07:26:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2019-09-10 07:26:31,418 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 57 [2019-09-10 07:26:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:31,418 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2019-09-10 07:26:31,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:26:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2019-09-10 07:26:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:26:31,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:31,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:31,420 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -835334377, now seen corresponding path program 1 times [2019-09-10 07:26:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:31,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:31,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:31,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:31,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:26:31,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:31,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:26:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:26:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:26:31,836 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand 11 states. [2019-09-10 07:26:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:32,415 INFO L93 Difference]: Finished difference Result 423 states and 568 transitions. [2019-09-10 07:26:32,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:32,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-09-10 07:26:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:32,418 INFO L225 Difference]: With dead ends: 423 [2019-09-10 07:26:32,419 INFO L226 Difference]: Without dead ends: 423 [2019-09-10 07:26:32,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:26:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-10 07:26:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 210. [2019-09-10 07:26:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 07:26:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2019-09-10 07:26:32,428 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 57 [2019-09-10 07:26:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:32,428 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2019-09-10 07:26:32,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:26:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2019-09-10 07:26:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:26:32,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:32,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:32,430 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 112766514, now seen corresponding path program 1 times [2019-09-10 07:26:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:32,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:32,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:32,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:32,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:32,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:32,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:32,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:32,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:32,578 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand 9 states. [2019-09-10 07:26:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:33,236 INFO L93 Difference]: Finished difference Result 257 states and 333 transitions. [2019-09-10 07:26:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:26:33,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 07:26:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:33,240 INFO L225 Difference]: With dead ends: 257 [2019-09-10 07:26:33,240 INFO L226 Difference]: Without dead ends: 257 [2019-09-10 07:26:33,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:26:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-10 07:26:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 210. [2019-09-10 07:26:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 07:26:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 265 transitions. [2019-09-10 07:26:33,248 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 265 transitions. Word has length 58 [2019-09-10 07:26:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:33,248 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 265 transitions. [2019-09-10 07:26:33,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 265 transitions. [2019-09-10 07:26:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:26:33,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:33,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:33,250 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1339497390, now seen corresponding path program 1 times [2019-09-10 07:26:33,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:33,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:33,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:33,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:33,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:33,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:33,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:33,375 INFO L87 Difference]: Start difference. First operand 210 states and 265 transitions. Second operand 9 states. [2019-09-10 07:26:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:34,034 INFO L93 Difference]: Finished difference Result 334 states and 435 transitions. [2019-09-10 07:26:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:26:34,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 07:26:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:34,036 INFO L225 Difference]: With dead ends: 334 [2019-09-10 07:26:34,036 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 07:26:34,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:26:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 07:26:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 210. [2019-09-10 07:26:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 07:26:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 264 transitions. [2019-09-10 07:26:34,043 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 264 transitions. Word has length 58 [2019-09-10 07:26:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:34,044 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 264 transitions. [2019-09-10 07:26:34,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 264 transitions. [2019-09-10 07:26:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:26:34,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:34,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:34,045 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1355038921, now seen corresponding path program 1 times [2019-09-10 07:26:34,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:34,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:34,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:34,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:34,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:34,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:34,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:34,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:34,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:34,165 INFO L87 Difference]: Start difference. First operand 210 states and 264 transitions. Second operand 9 states. [2019-09-10 07:26:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:34,702 INFO L93 Difference]: Finished difference Result 334 states and 434 transitions. [2019-09-10 07:26:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:26:34,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 07:26:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:34,705 INFO L225 Difference]: With dead ends: 334 [2019-09-10 07:26:34,705 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 07:26:34,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:26:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 07:26:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 210. [2019-09-10 07:26:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 07:26:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 263 transitions. [2019-09-10 07:26:34,713 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 263 transitions. Word has length 59 [2019-09-10 07:26:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:34,713 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 263 transitions. [2019-09-10 07:26:34,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 263 transitions. [2019-09-10 07:26:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:26:34,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:34,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:34,715 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1142655831, now seen corresponding path program 1 times [2019-09-10 07:26:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:34,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:26:35,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:35,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:26:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:26:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:26:35,414 INFO L87 Difference]: Start difference. First operand 210 states and 263 transitions. Second operand 16 states. [2019-09-10 07:26:36,109 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 07:26:36,244 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 07:26:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:37,615 INFO L93 Difference]: Finished difference Result 982 states and 1372 transitions. [2019-09-10 07:26:37,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:26:37,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-09-10 07:26:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:37,621 INFO L225 Difference]: With dead ends: 982 [2019-09-10 07:26:37,622 INFO L226 Difference]: Without dead ends: 982 [2019-09-10 07:26:37,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:26:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-10 07:26:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 210. [2019-09-10 07:26:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 07:26:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2019-09-10 07:26:37,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 60 [2019-09-10 07:26:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:37,635 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2019-09-10 07:26:37,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:26:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2019-09-10 07:26:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:26:37,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:37,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:37,636 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -126919753, now seen corresponding path program 1 times [2019-09-10 07:26:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:37,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:37,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:38,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:26:38,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:38,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:26:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:26:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:26:38,145 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand 18 states. [2019-09-10 07:26:38,325 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:26:38,893 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 07:26:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:39,968 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2019-09-10 07:26:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:26:39,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-09-10 07:26:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:39,970 INFO L225 Difference]: With dead ends: 352 [2019-09-10 07:26:39,970 INFO L226 Difference]: Without dead ends: 352 [2019-09-10 07:26:39,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:26:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-10 07:26:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 213. [2019-09-10 07:26:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-10 07:26:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2019-09-10 07:26:39,977 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 60 [2019-09-10 07:26:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:39,977 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2019-09-10 07:26:39,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:26:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2019-09-10 07:26:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:26:39,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:39,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:39,978 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1510418109, now seen corresponding path program 1 times [2019-09-10 07:26:39,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:39,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:40,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:40,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:26:40,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:40,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:26:40,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:26:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:26:40,694 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand 13 states. [2019-09-10 07:26:40,898 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-09-10 07:26:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:41,635 INFO L93 Difference]: Finished difference Result 401 states and 539 transitions. [2019-09-10 07:26:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:26:41,636 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 07:26:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:41,638 INFO L225 Difference]: With dead ends: 401 [2019-09-10 07:26:41,638 INFO L226 Difference]: Without dead ends: 401 [2019-09-10 07:26:41,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:26:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-10 07:26:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 197. [2019-09-10 07:26:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-10 07:26:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2019-09-10 07:26:41,645 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 61 [2019-09-10 07:26:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:41,646 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2019-09-10 07:26:41,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:26:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2019-09-10 07:26:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:26:41,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:41,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:41,647 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1541387915, now seen corresponding path program 1 times [2019-09-10 07:26:41,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:41,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:41,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:26:42,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:42,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:26:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:26:42,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:26:42,076 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand 12 states. [2019-09-10 07:26:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:43,379 INFO L93 Difference]: Finished difference Result 696 states and 959 transitions. [2019-09-10 07:26:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:26:43,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 07:26:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:43,383 INFO L225 Difference]: With dead ends: 696 [2019-09-10 07:26:43,384 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 07:26:43,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:26:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 07:26:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 191. [2019-09-10 07:26:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-10 07:26:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2019-09-10 07:26:43,392 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 61 [2019-09-10 07:26:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:43,393 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2019-09-10 07:26:43,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:26:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2019-09-10 07:26:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:26:43,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:43,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:43,394 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -193814788, now seen corresponding path program 1 times [2019-09-10 07:26:43,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:43,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:43,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:43,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:43,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:26:44,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:44,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:26:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:26:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:26:44,387 INFO L87 Difference]: Start difference. First operand 191 states and 241 transitions. Second operand 18 states. [2019-09-10 07:26:45,059 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 07:26:45,225 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:26:45,398 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:26:45,576 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:26:45,782 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:26:45,981 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:26:46,125 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:26:46,282 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:26:46,464 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:26:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:46,705 INFO L93 Difference]: Finished difference Result 191 states and 240 transitions. [2019-09-10 07:26:46,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:26:46,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-09-10 07:26:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:46,707 INFO L225 Difference]: With dead ends: 191 [2019-09-10 07:26:46,707 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 07:26:46,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:26:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 07:26:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-09-10 07:26:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-10 07:26:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2019-09-10 07:26:46,714 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 61 [2019-09-10 07:26:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:46,714 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2019-09-10 07:26:46,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:26:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2019-09-10 07:26:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 07:26:46,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:46,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:46,716 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash 853354510, now seen corresponding path program 1 times [2019-09-10 07:26:46,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:46,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:46,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:46,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:47,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:47,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:26:47,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:47,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:26:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:26:47,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:26:47,523 INFO L87 Difference]: Start difference. First operand 191 states and 240 transitions. Second operand 20 states. [2019-09-10 07:26:47,695 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:26:48,568 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-10 07:26:49,034 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-09-10 07:26:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:49,947 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2019-09-10 07:26:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:26:49,948 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2019-09-10 07:26:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:49,949 INFO L225 Difference]: With dead ends: 182 [2019-09-10 07:26:49,949 INFO L226 Difference]: Without dead ends: 171 [2019-09-10 07:26:49,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:26:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-10 07:26:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-09-10 07:26:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-10 07:26:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2019-09-10 07:26:49,954 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 62 [2019-09-10 07:26:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:49,954 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2019-09-10 07:26:49,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:26:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2019-09-10 07:26:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:26:49,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:49,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:49,956 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash -48178293, now seen corresponding path program 1 times [2019-09-10 07:26:49,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:49,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:50,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:50,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:50,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:50,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:50,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:50,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,026 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand 3 states. [2019-09-10 07:26:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:50,076 INFO L93 Difference]: Finished difference Result 247 states and 328 transitions. [2019-09-10 07:26:50,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:50,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:26:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:50,077 INFO L225 Difference]: With dead ends: 247 [2019-09-10 07:26:50,078 INFO L226 Difference]: Without dead ends: 247 [2019-09-10 07:26:50,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-10 07:26:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-09-10 07:26:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-10 07:26:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 327 transitions. [2019-09-10 07:26:50,083 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 327 transitions. Word has length 79 [2019-09-10 07:26:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:50,084 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 327 transitions. [2019-09-10 07:26:50,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2019-09-10 07:26:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:50,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:50,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:50,085 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:50,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash 279854363, now seen corresponding path program 1 times [2019-09-10 07:26:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:50,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:50,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:50,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:50,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,142 INFO L87 Difference]: Start difference. First operand 245 states and 327 transitions. Second operand 3 states. [2019-09-10 07:26:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:50,184 INFO L93 Difference]: Finished difference Result 383 states and 520 transitions. [2019-09-10 07:26:50,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:50,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:26:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:50,191 INFO L225 Difference]: With dead ends: 383 [2019-09-10 07:26:50,191 INFO L226 Difference]: Without dead ends: 383 [2019-09-10 07:26:50,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-10 07:26:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2019-09-10 07:26:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-10 07:26:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 519 transitions. [2019-09-10 07:26:50,202 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 519 transitions. Word has length 81 [2019-09-10 07:26:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:50,202 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 519 transitions. [2019-09-10 07:26:50,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 519 transitions. [2019-09-10 07:26:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:50,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:50,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:50,205 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 346347875, now seen corresponding path program 1 times [2019-09-10 07:26:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:50,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:50,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:50,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:50,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:50,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:50,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:50,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,293 INFO L87 Difference]: Start difference. First operand 381 states and 519 transitions. Second operand 3 states. [2019-09-10 07:26:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:50,344 INFO L93 Difference]: Finished difference Result 533 states and 732 transitions. [2019-09-10 07:26:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:50,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:26:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:50,348 INFO L225 Difference]: With dead ends: 533 [2019-09-10 07:26:50,348 INFO L226 Difference]: Without dead ends: 533 [2019-09-10 07:26:50,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-10 07:26:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 531. [2019-09-10 07:26:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-10 07:26:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 731 transitions. [2019-09-10 07:26:50,364 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 731 transitions. Word has length 81 [2019-09-10 07:26:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:50,365 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 731 transitions. [2019-09-10 07:26:50,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 731 transitions. [2019-09-10 07:26:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:50,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:50,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:50,367 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 365336372, now seen corresponding path program 1 times [2019-09-10 07:26:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:50,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:50,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:50,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:50,518 INFO L87 Difference]: Start difference. First operand 531 states and 731 transitions. Second operand 7 states. [2019-09-10 07:26:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:51,098 INFO L93 Difference]: Finished difference Result 1935 states and 2666 transitions. [2019-09-10 07:26:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:51,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:26:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:51,108 INFO L225 Difference]: With dead ends: 1935 [2019-09-10 07:26:51,109 INFO L226 Difference]: Without dead ends: 1935 [2019-09-10 07:26:51,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:26:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-09-10 07:26:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1093. [2019-09-10 07:26:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-09-10 07:26:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1535 transitions. [2019-09-10 07:26:51,145 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1535 transitions. Word has length 81 [2019-09-10 07:26:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:51,146 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1535 transitions. [2019-09-10 07:26:51,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1535 transitions. [2019-09-10 07:26:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:51,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:51,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:51,148 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 980014388, now seen corresponding path program 1 times [2019-09-10 07:26:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:51,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:51,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:51,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:51,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:51,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:51,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:51,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:51,256 INFO L87 Difference]: Start difference. First operand 1093 states and 1535 transitions. Second operand 7 states. [2019-09-10 07:26:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:51,740 INFO L93 Difference]: Finished difference Result 2981 states and 4167 transitions. [2019-09-10 07:26:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:51,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:26:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:51,757 INFO L225 Difference]: With dead ends: 2981 [2019-09-10 07:26:51,757 INFO L226 Difference]: Without dead ends: 2981 [2019-09-10 07:26:51,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:26:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-09-10 07:26:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1881. [2019-09-10 07:26:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-09-10 07:26:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2661 transitions. [2019-09-10 07:26:51,818 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2661 transitions. Word has length 81 [2019-09-10 07:26:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:51,818 INFO L475 AbstractCegarLoop]: Abstraction has 1881 states and 2661 transitions. [2019-09-10 07:26:51,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2661 transitions. [2019-09-10 07:26:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:51,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:51,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:51,820 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1086450892, now seen corresponding path program 1 times [2019-09-10 07:26:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:51,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:51,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:51,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:51,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:51,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:51,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:51,927 INFO L87 Difference]: Start difference. First operand 1881 states and 2661 transitions. Second operand 7 states. [2019-09-10 07:26:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:52,263 INFO L93 Difference]: Finished difference Result 4087 states and 5678 transitions. [2019-09-10 07:26:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:52,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:26:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:52,278 INFO L225 Difference]: With dead ends: 4087 [2019-09-10 07:26:52,279 INFO L226 Difference]: Without dead ends: 4087 [2019-09-10 07:26:52,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:26:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2019-09-10 07:26:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 2389. [2019-09-10 07:26:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-09-10 07:26:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3333 transitions. [2019-09-10 07:26:52,335 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3333 transitions. Word has length 81 [2019-09-10 07:26:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:52,336 INFO L475 AbstractCegarLoop]: Abstraction has 2389 states and 3333 transitions. [2019-09-10 07:26:52,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3333 transitions. [2019-09-10 07:26:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:26:52,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:52,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:52,338 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash 158803972, now seen corresponding path program 1 times [2019-09-10 07:26:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:52,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:52,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:52,425 INFO L87 Difference]: Start difference. First operand 2389 states and 3333 transitions. Second operand 3 states. [2019-09-10 07:26:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:52,452 INFO L93 Difference]: Finished difference Result 2181 states and 2984 transitions. [2019-09-10 07:26:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:52,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:26:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:52,462 INFO L225 Difference]: With dead ends: 2181 [2019-09-10 07:26:52,462 INFO L226 Difference]: Without dead ends: 2181 [2019-09-10 07:26:52,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-09-10 07:26:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1769. [2019-09-10 07:26:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-09-10 07:26:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2416 transitions. [2019-09-10 07:26:52,500 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2416 transitions. Word has length 82 [2019-09-10 07:26:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:52,500 INFO L475 AbstractCegarLoop]: Abstraction has 1769 states and 2416 transitions. [2019-09-10 07:26:52,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2416 transitions. [2019-09-10 07:26:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:26:52,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:52,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:52,502 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash -205212407, now seen corresponding path program 1 times [2019-09-10 07:26:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:52,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:52,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:52,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:52,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:52,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:52,558 INFO L87 Difference]: Start difference. First operand 1769 states and 2416 transitions. Second operand 3 states. [2019-09-10 07:26:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:52,585 INFO L93 Difference]: Finished difference Result 2467 states and 3310 transitions. [2019-09-10 07:26:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:52,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:26:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:52,596 INFO L225 Difference]: With dead ends: 2467 [2019-09-10 07:26:52,596 INFO L226 Difference]: Without dead ends: 2467 [2019-09-10 07:26:52,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2019-09-10 07:26:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2237. [2019-09-10 07:26:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-09-10 07:26:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3033 transitions. [2019-09-10 07:26:52,635 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3033 transitions. Word has length 83 [2019-09-10 07:26:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:52,635 INFO L475 AbstractCegarLoop]: Abstraction has 2237 states and 3033 transitions. [2019-09-10 07:26:52,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3033 transitions. [2019-09-10 07:26:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:26:52,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:52,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:52,637 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:52,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash 469836024, now seen corresponding path program 1 times [2019-09-10 07:26:52,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:52,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:52,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:52,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:52,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:52,781 INFO L87 Difference]: Start difference. First operand 2237 states and 3033 transitions. Second operand 5 states. [2019-09-10 07:26:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:52,830 INFO L93 Difference]: Finished difference Result 3687 states and 4983 transitions. [2019-09-10 07:26:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:52,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:26:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:52,846 INFO L225 Difference]: With dead ends: 3687 [2019-09-10 07:26:52,847 INFO L226 Difference]: Without dead ends: 3687 [2019-09-10 07:26:52,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2019-09-10 07:26:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3683. [2019-09-10 07:26:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-09-10 07:26:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4981 transitions. [2019-09-10 07:26:52,909 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4981 transitions. Word has length 84 [2019-09-10 07:26:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:52,909 INFO L475 AbstractCegarLoop]: Abstraction has 3683 states and 4981 transitions. [2019-09-10 07:26:52,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4981 transitions. [2019-09-10 07:26:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:26:52,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:52,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:52,911 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2066603833, now seen corresponding path program 1 times [2019-09-10 07:26:52,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:52,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:52,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:52,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:26:52,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:52,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:26:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:26:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:26:52,996 INFO L87 Difference]: Start difference. First operand 3683 states and 4981 transitions. Second operand 6 states. [2019-09-10 07:26:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:53,085 INFO L93 Difference]: Finished difference Result 5079 states and 6782 transitions. [2019-09-10 07:26:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:26:53,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:26:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:53,097 INFO L225 Difference]: With dead ends: 5079 [2019-09-10 07:26:53,097 INFO L226 Difference]: Without dead ends: 5079 [2019-09-10 07:26:53,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2019-09-10 07:26:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 3719. [2019-09-10 07:26:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3719 states. [2019-09-10 07:26:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4997 transitions. [2019-09-10 07:26:53,155 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4997 transitions. Word has length 84 [2019-09-10 07:26:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:53,155 INFO L475 AbstractCegarLoop]: Abstraction has 3719 states and 4997 transitions. [2019-09-10 07:26:53,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:26:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4997 transitions. [2019-09-10 07:26:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:53,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:53,158 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:53,158 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1575114626, now seen corresponding path program 1 times [2019-09-10 07:26:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:26:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:53,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:53,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:53,240 INFO L87 Difference]: Start difference. First operand 3719 states and 4997 transitions. Second operand 5 states. [2019-09-10 07:26:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:53,311 INFO L93 Difference]: Finished difference Result 6161 states and 8233 transitions. [2019-09-10 07:26:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:53,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 07:26:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:53,324 INFO L225 Difference]: With dead ends: 6161 [2019-09-10 07:26:53,324 INFO L226 Difference]: Without dead ends: 6161 [2019-09-10 07:26:53,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:26:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2019-09-10 07:26:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 4919. [2019-09-10 07:26:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2019-09-10 07:26:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 6621 transitions. [2019-09-10 07:26:53,392 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 6621 transitions. Word has length 105 [2019-09-10 07:26:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:53,393 INFO L475 AbstractCegarLoop]: Abstraction has 4919 states and 6621 transitions. [2019-09-10 07:26:53,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 6621 transitions. [2019-09-10 07:26:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:53,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:53,396 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:53,397 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1268065406, now seen corresponding path program 1 times [2019-09-10 07:26:53,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:53,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:53,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:53,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:53,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:53,478 INFO L87 Difference]: Start difference. First operand 4919 states and 6621 transitions. Second operand 3 states. [2019-09-10 07:26:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:53,518 INFO L93 Difference]: Finished difference Result 5483 states and 7309 transitions. [2019-09-10 07:26:53,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:53,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:26:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:53,530 INFO L225 Difference]: With dead ends: 5483 [2019-09-10 07:26:53,530 INFO L226 Difference]: Without dead ends: 5483 [2019-09-10 07:26:53,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-09-10 07:26:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5345. [2019-09-10 07:26:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5345 states. [2019-09-10 07:26:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 7121 transitions. [2019-09-10 07:26:53,603 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 7121 transitions. Word has length 105 [2019-09-10 07:26:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:53,604 INFO L475 AbstractCegarLoop]: Abstraction has 5345 states and 7121 transitions. [2019-09-10 07:26:53,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 7121 transitions. [2019-09-10 07:26:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:53,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:53,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:53,607 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -602099539, now seen corresponding path program 1 times [2019-09-10 07:26:53,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:53,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:26:53,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:53,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:26:53,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:53,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:53,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:26:53,748 INFO L87 Difference]: Start difference. First operand 5345 states and 7121 transitions. Second operand 5 states. [2019-09-10 07:26:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:53,854 INFO L93 Difference]: Finished difference Result 13153 states and 17408 transitions. [2019-09-10 07:26:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:53,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 07:26:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:53,882 INFO L225 Difference]: With dead ends: 13153 [2019-09-10 07:26:53,883 INFO L226 Difference]: Without dead ends: 13153 [2019-09-10 07:26:53,883 INFO L628 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-09-10 07:26:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13153 states. [2019-09-10 07:26:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13153 to 7917. [2019-09-10 07:26:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-09-10 07:26:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 10505 transitions. [2019-09-10 07:26:54,035 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 10505 transitions. Word has length 106 [2019-09-10 07:26:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:54,036 INFO L475 AbstractCegarLoop]: Abstraction has 7917 states and 10505 transitions. [2019-09-10 07:26:54,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 10505 transitions. [2019-09-10 07:26:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:54,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:54,039 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:54,039 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1626402477, now seen corresponding path program 1 times [2019-09-10 07:26:54,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:54,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:54,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:54,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:54,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:54,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:26:54,325 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [663], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [881], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:26:54,371 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:54,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:54,560 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:55,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:55,232 INFO L272 AbstractInterpreter]: Visited 99 different actions 445 times. Merged at 39 different actions 303 times. Widened at 16 different actions 56 times. Performed 1760 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:26:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:55,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:55,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:55,239 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-09-10 07:26:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:55,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:55,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:26:55,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:26:55,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:26:55,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:26:55,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 17 [2019-09-10 07:26:55,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:55,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:55,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:55,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:26:55,687 INFO L87 Difference]: Start difference. First operand 7917 states and 10505 transitions. Second operand 5 states. [2019-09-10 07:26:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:55,856 INFO L93 Difference]: Finished difference Result 15757 states and 20846 transitions. [2019-09-10 07:26:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:55,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 07:26:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:55,890 INFO L225 Difference]: With dead ends: 15757 [2019-09-10 07:26:55,890 INFO L226 Difference]: Without dead ends: 15757 [2019-09-10 07:26:55,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:26:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15757 states. [2019-09-10 07:26:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15757 to 11065. [2019-09-10 07:26:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11065 states. [2019-09-10 07:26:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11065 states to 11065 states and 14603 transitions. [2019-09-10 07:26:56,160 INFO L78 Accepts]: Start accepts. Automaton has 11065 states and 14603 transitions. Word has length 106 [2019-09-10 07:26:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:56,161 INFO L475 AbstractCegarLoop]: Abstraction has 11065 states and 14603 transitions. [2019-09-10 07:26:56,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 11065 states and 14603 transitions. [2019-09-10 07:26:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:26:56,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:56,166 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:56,166 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1691078651, now seen corresponding path program 1 times [2019-09-10 07:26:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:56,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:26:56,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:56,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:56,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:56,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:56,445 INFO L87 Difference]: Start difference. First operand 11065 states and 14603 transitions. Second operand 9 states. [2019-09-10 07:26:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:57,120 INFO L93 Difference]: Finished difference Result 22585 states and 29654 transitions. [2019-09-10 07:26:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:26:57,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-09-10 07:26:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:57,166 INFO L225 Difference]: With dead ends: 22585 [2019-09-10 07:26:57,167 INFO L226 Difference]: Without dead ends: 22585 [2019-09-10 07:26:57,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:26:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22585 states. [2019-09-10 07:26:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22585 to 11065. [2019-09-10 07:26:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11065 states. [2019-09-10 07:26:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11065 states to 11065 states and 14601 transitions. [2019-09-10 07:26:57,459 INFO L78 Accepts]: Start accepts. Automaton has 11065 states and 14601 transitions. Word has length 108 [2019-09-10 07:26:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:57,460 INFO L475 AbstractCegarLoop]: Abstraction has 11065 states and 14601 transitions. [2019-09-10 07:26:57,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11065 states and 14601 transitions. [2019-09-10 07:26:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:26:57,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:57,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:57,463 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash -519527990, now seen corresponding path program 1 times [2019-09-10 07:26:57,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:57,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:57,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:57,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:57,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:26:57,806 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [881], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:26:57,816 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:57,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:57,867 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:58,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:58,294 INFO L272 AbstractInterpreter]: Visited 101 different actions 471 times. Merged at 39 different actions 322 times. Widened at 16 different actions 44 times. Performed 1804 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1804 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 14 different actions. Largest state had 173 variables. [2019-09-10 07:26:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:58,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:58,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:58,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:26:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:58,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:58,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:26:58,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:58,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:58,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:59,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:01,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:01,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:27:01,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:27:01,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:27:01,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:27:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:27:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:27:01,684 INFO L87 Difference]: Start difference. First operand 11065 states and 14601 transitions. Second operand 18 states. [2019-09-10 07:27:02,284 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:27:02,502 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:27:02,823 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:27:03,150 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:27:03,637 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:27:04,152 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:27:04,417 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:27:04,683 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:27:05,022 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:27:05,357 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:27:05,713 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:27:05,906 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:27:06,092 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:27:06,264 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:27:06,488 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:27:06,731 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:27:07,163 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:27:07,578 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:27:08,286 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:27:08,589 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:27:08,873 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:27:09,115 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:27:09,303 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:27:09,848 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:27:10,103 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:27:10,416 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:27:10,693 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:27:10,888 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:27:11,105 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:27:11,433 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 07:27:11,727 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:27:12,176 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:27:12,447 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:27:12,816 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 07:27:13,029 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:27:13,419 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:27:13,620 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:27:13,956 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:27:14,145 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:27:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:14,255 INFO L93 Difference]: Finished difference Result 38512 states and 49401 transitions. [2019-09-10 07:27:14,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:27:14,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-09-10 07:27:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:14,340 INFO L225 Difference]: With dead ends: 38512 [2019-09-10 07:27:14,341 INFO L226 Difference]: Without dead ends: 38512 [2019-09-10 07:27:14,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 182 SyntacticMatches, 27 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1138, Invalid=3832, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:27:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38512 states. [2019-09-10 07:27:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38512 to 18184. [2019-09-10 07:27:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18184 states. [2019-09-10 07:27:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18184 states to 18184 states and 23829 transitions. [2019-09-10 07:27:15,594 INFO L78 Accepts]: Start accepts. Automaton has 18184 states and 23829 transitions. Word has length 110 [2019-09-10 07:27:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:15,595 INFO L475 AbstractCegarLoop]: Abstraction has 18184 states and 23829 transitions. [2019-09-10 07:27:15,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:27:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18184 states and 23829 transitions. [2019-09-10 07:27:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:27:15,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:15,600 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:15,607 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1775525834, now seen corresponding path program 1 times [2019-09-10 07:27:15,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:15,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:15,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:15,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:15,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:15,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:27:15,991 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [869], [874], [877], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:27:16,004 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:16,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:16,045 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:16,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:27:16,509 INFO L272 AbstractInterpreter]: Visited 101 different actions 558 times. Merged at 39 different actions 401 times. Widened at 16 different actions 71 times. Performed 2154 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:27:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:16,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:27:16,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:16,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:27:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:16,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:27:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:16,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:27:16,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:27:16,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:17,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:27:17,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:17,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:18,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:18,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:27:18,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:27:18,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:27:18,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:27:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:27:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:27:18,699 INFO L87 Difference]: Start difference. First operand 18184 states and 23829 transitions. Second operand 21 states. [2019-09-10 07:27:18,961 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:27:19,534 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:27:19,916 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:27:20,161 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:27:20,432 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:27:20,668 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:27:21,099 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:27:21,470 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:27:22,317 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:27:22,613 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:27:22,954 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:27:23,351 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:27:23,694 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:27:24,075 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:27:24,394 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:27:24,746 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:27:25,182 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:27:25,752 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:27:26,145 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:27:26,424 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:27:27,017 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:27:27,339 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:27:27,741 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:27:28,096 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:27:28,423 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:27:29,249 WARN L188 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:27:29,560 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:27:30,152 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:27:30,540 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:27:30,849 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:27:31,567 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:27:32,022 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:27:32,405 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:27:32,681 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:27:33,291 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:27:33,869 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:27:34,300 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:27:34,670 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:27:35,128 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:27:35,554 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:27:36,080 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:27:36,369 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:27:36,844 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:27:37,407 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:27:37,871 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:27:38,265 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:38,658 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:27:39,064 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:39,531 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:27:40,172 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:27:40,530 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:27:40,918 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:27:41,481 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:27:41,940 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:27:42,342 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:42,756 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:27:43,173 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:27:43,558 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:27:43,928 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:44,335 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:27:44,770 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:27:45,159 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:27:45,463 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:27:46,193 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:27:46,610 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:27:47,193 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:27:47,607 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:27:48,052 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:27:48,486 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:27:49,058 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:27:49,454 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:27:49,773 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:27:50,281 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:27:50,576 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:27:50,971 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:27:51,390 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:27:51,699 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:27:51,985 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:27:52,351 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:27:52,651 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:27:53,232 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:27:53,564 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:27:53,855 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:27:54,380 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:27:54,903 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:27:55,448 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:55,943 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:27:56,374 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:27:57,026 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:27:57,452 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:27:57,767 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:27:58,112 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:27:58,511 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:27:58,857 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:27:59,337 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:27:59,830 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:00,131 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:28:00,691 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:28:01,206 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 07:28:01,539 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:28:01,966 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:28:02,460 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 07:28:02,793 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:28:03,274 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:28:03,724 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:28:04,043 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:28:04,461 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:04,789 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:05,301 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:28:05,740 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:28:06,253 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:28:06,609 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:28:06,999 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:07,365 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:07,803 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:28:08,203 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:28:08,820 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:28:09,253 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:28:09,647 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:28:09,967 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:28:10,344 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:28:10,697 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:28:11,172 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:28:11,525 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:28:12,038 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:28:12,513 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:28:13,090 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:28:13,512 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:28:13,886 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:28:14,414 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:28:14,794 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:15,198 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:28:15,847 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:28:16,284 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:28:16,936 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:17,483 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:28:17,852 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:28:18,296 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:18,690 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:28:19,003 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:28:19,488 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:28:19,852 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:22,369 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:28:22,767 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:23,548 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:24,755 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:28:25,164 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:25,559 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:28:26,132 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:26,508 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:28:26,946 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:28:27,337 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:28:27,772 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:28:28,121 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:28,633 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:29,040 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:28:29,600 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:30,260 WARN L188 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:28:30,580 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:28:31,117 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:28:31,695 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:32,026 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:28:32,393 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:28:32,760 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:28:33,294 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:28:33,854 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:28:34,484 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:34,804 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:28:35,182 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:28:35,640 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:36,064 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:28:36,455 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:28:36,732 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:28:37,121 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:28:37,617 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:38,094 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:28:38,471 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:28:38,966 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:39,364 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:28:39,805 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:28:40,217 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:28:40,750 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:28:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:41,349 INFO L93 Difference]: Finished difference Result 282515 states and 358344 transitions. [2019-09-10 07:28:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-10 07:28:41,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-09-10 07:28:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:41,769 INFO L225 Difference]: With dead ends: 282515 [2019-09-10 07:28:41,769 INFO L226 Difference]: Without dead ends: 282515 [2019-09-10 07:28:41,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 188 SyntacticMatches, 14 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16683 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=7938, Invalid=38502, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 07:28:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282515 states. [2019-09-10 07:28:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282515 to 94923. [2019-09-10 07:28:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94923 states. [2019-09-10 07:28:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94923 states to 94923 states and 123620 transitions. [2019-09-10 07:28:45,336 INFO L78 Accepts]: Start accepts. Automaton has 94923 states and 123620 transitions. Word has length 110 [2019-09-10 07:28:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:45,336 INFO L475 AbstractCegarLoop]: Abstraction has 94923 states and 123620 transitions. [2019-09-10 07:28:45,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:28:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 94923 states and 123620 transitions. [2019-09-10 07:28:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:28:45,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:45,349 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:45,350 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 343502542, now seen corresponding path program 1 times [2019-09-10 07:28:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:45,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:45,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:45,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:28:45,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:45,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:28:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:28:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:45,418 INFO L87 Difference]: Start difference. First operand 94923 states and 123620 transitions. Second operand 3 states. [2019-09-10 07:28:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:45,592 INFO L93 Difference]: Finished difference Result 65321 states and 81548 transitions. [2019-09-10 07:28:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:28:45,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 07:28:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:47,286 INFO L225 Difference]: With dead ends: 65321 [2019-09-10 07:28:47,286 INFO L226 Difference]: Without dead ends: 65321 [2019-09-10 07:28:47,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65321 states. [2019-09-10 07:28:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65321 to 60983. [2019-09-10 07:28:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60983 states. [2019-09-10 07:28:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60983 states to 60983 states and 76779 transitions. [2019-09-10 07:28:48,305 INFO L78 Accepts]: Start accepts. Automaton has 60983 states and 76779 transitions. Word has length 111 [2019-09-10 07:28:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:48,306 INFO L475 AbstractCegarLoop]: Abstraction has 60983 states and 76779 transitions. [2019-09-10 07:28:48,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:28:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 60983 states and 76779 transitions. [2019-09-10 07:28:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:28:48,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:48,319 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:48,320 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1871750063, now seen corresponding path program 1 times [2019-09-10 07:28:48,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:48,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:48,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:48,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:28:48,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:28:48,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:28:48,734 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:28:48,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:28:48,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:28:48,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:28:49,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:28:49,044 INFO L272 AbstractInterpreter]: Visited 104 different actions 497 times. Merged at 42 different actions 351 times. Widened at 12 different actions 43 times. Performed 1860 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:28:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:49,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:28:49,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:28:49,044 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) [2019-09-10 07:28:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:49,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:28:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 07:28:49,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:28:49,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:49,596 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2019-09-10 07:28:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:50,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:50,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:51,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:28:51,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:51,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:51,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:28:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:28:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 44 [2019-09-10 07:28:53,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:28:53,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:28:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:28:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:28:53,306 INFO L87 Difference]: Start difference. First operand 60983 states and 76779 transitions. Second operand 30 states. [2019-09-10 07:28:53,536 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:28:54,459 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 07:28:54,655 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:28:54,907 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:28:57,680 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:00,835 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:29:01,775 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:03,995 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:04,293 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:04,791 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 07:29:05,517 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:29:07,689 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:29:08,669 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:09,056 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:29:09,512 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 07:29:10,662 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:12,091 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:29:12,916 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:29:13,718 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:29:14,543 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:29:15,504 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:29:15,995 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:17,049 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-10 07:29:17,673 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:29:18,482 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:29:21,582 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:29:23,387 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:29:24,102 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:29:25,479 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:29:26,339 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:29:29,133 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:29:31,581 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:32,432 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:29:34,745 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:29:35,490 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:29:39,023 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:29:39,271 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:29:39,984 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:29:40,543 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 07:29:47,278 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:29:47,828 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:29:48,734 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-09-10 07:29:49,394 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:29:50,043 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:29:50,904 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:51,648 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:29:52,380 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:29:52,861 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:55,950 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:29:56,431 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:29:57,432 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:29:57,871 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:29:58,741 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:30:00,691 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:30:01,092 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:30:01,395 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:30:03,310 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:30:04,256 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:30:05,518 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:30:07,999 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:30:08,741 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:30:09,294 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:30:10,824 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:30:11,275 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:30:12,119 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:30:12,479 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:30:18,675 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:30:19,812 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:30:20,426 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:30:21,371 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:30:24,211 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:30:25,006 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:30:27,840 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:30:28,443 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:30:29,447 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:30:29,909 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:30:31,527 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:30:31,945 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:30:32,651 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:30:37,087 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:30:37,881 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:30:38,928 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:30:39,562 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:30:43,015 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:30:44,796 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:30:45,051 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:30:45,658 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:30:50,380 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:30:52,691 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:30:53,461 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:30:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:54,056 INFO L93 Difference]: Finished difference Result 194389 states and 240301 transitions. [2019-09-10 07:30:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-09-10 07:30:54,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-09-10 07:30:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:54,298 INFO L225 Difference]: With dead ends: 194389 [2019-09-10 07:30:54,299 INFO L226 Difference]: Without dead ends: 194389 [2019-09-10 07:30:54,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 183 SyntacticMatches, 13 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21798 ImplicationChecksByTransitivity, 79.5s TimeCoverageRelationStatistics Valid=7257, Invalid=54495, Unknown=0, NotChecked=0, Total=61752 [2019-09-10 07:30:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194389 states. [2019-09-10 07:30:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194389 to 87528. [2019-09-10 07:30:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87528 states. [2019-09-10 07:30:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87528 states to 87528 states and 110527 transitions. [2019-09-10 07:30:56,000 INFO L78 Accepts]: Start accepts. Automaton has 87528 states and 110527 transitions. Word has length 111 [2019-09-10 07:30:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:56,000 INFO L475 AbstractCegarLoop]: Abstraction has 87528 states and 110527 transitions. [2019-09-10 07:30:56,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:30:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 87528 states and 110527 transitions. [2019-09-10 07:30:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:30:56,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:56,010 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:56,010 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1847771136, now seen corresponding path program 1 times [2019-09-10 07:30:56,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:56,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:56,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:56,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:56,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:56,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:30:56,457 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [874], [877], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:30:56,463 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:56,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:56,503 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:56,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:56,865 INFO L272 AbstractInterpreter]: Visited 104 different actions 501 times. Merged at 41 different actions 352 times. Widened at 14 different actions 53 times. Performed 1928 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1928 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:30:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:56,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:56,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:56,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:56,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:56,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:30:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:57,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:30:57,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:57,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,713 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-09-10 07:30:57,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:57,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:58,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:58,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:59,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:59,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:30:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:30:59,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:30:59,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:30:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:30:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:30:59,378 INFO L87 Difference]: Start difference. First operand 87528 states and 110527 transitions. Second operand 21 states. [2019-09-10 07:31:00,163 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-09-10 07:31:00,419 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-09-10 07:31:01,706 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2019-09-10 07:31:02,000 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-09-10 07:31:02,137 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2019-09-10 07:31:02,871 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-09-10 07:31:03,980 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-10 07:31:04,425 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-09-10 07:31:04,582 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2019-09-10 07:31:05,608 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-09-10 07:31:05,750 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-09-10 07:31:06,388 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:31:06,658 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-09-10 07:31:06,906 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-09-10 07:31:07,153 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-09-10 07:31:08,008 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-09-10 07:31:08,183 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-09-10 07:31:08,460 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 07:31:08,651 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-09-10 07:31:09,165 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-09-10 07:31:09,473 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-10 07:31:09,758 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:31:10,086 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-09-10 07:31:10,405 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-09-10 07:31:10,698 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-09-10 07:31:11,698 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 07:31:11,991 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:31:12,495 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 07:31:12,670 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 07:31:12,838 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-09-10 07:31:13,134 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2019-09-10 07:31:13,683 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2019-09-10 07:31:13,971 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 32 [2019-09-10 07:31:14,118 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-09-10 07:31:14,273 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 07:31:14,434 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:31:14,726 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-09-10 07:31:15,046 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-09-10 07:31:15,213 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-09-10 07:31:15,368 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-09-10 07:31:15,828 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:31:15,979 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2019-09-10 07:31:16,243 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-10 07:31:16,787 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2019-09-10 07:31:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:19,188 INFO L93 Difference]: Finished difference Result 309478 states and 381068 transitions. [2019-09-10 07:31:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 07:31:19,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-09-10 07:31:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:20,302 INFO L225 Difference]: With dead ends: 309478 [2019-09-10 07:31:20,302 INFO L226 Difference]: Without dead ends: 309478 [2019-09-10 07:31:20,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7168 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 07:31:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309478 states. [2019-09-10 07:31:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309478 to 112640. [2019-09-10 07:31:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112640 states. [2019-09-10 07:31:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112640 states to 112640 states and 141986 transitions. [2019-09-10 07:31:22,620 INFO L78 Accepts]: Start accepts. Automaton has 112640 states and 141986 transitions. Word has length 111 [2019-09-10 07:31:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:22,620 INFO L475 AbstractCegarLoop]: Abstraction has 112640 states and 141986 transitions. [2019-09-10 07:31:22,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:31:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 112640 states and 141986 transitions. [2019-09-10 07:31:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:31:22,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:22,630 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:22,631 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 53662710, now seen corresponding path program 1 times [2019-09-10 07:31:22,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:22,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:22,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:22,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:22,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:22,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:31:22,969 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [872], [883], [885], [888], [891], [894], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:31:22,973 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:22,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:22,995 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:23,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:23,241 INFO L272 AbstractInterpreter]: Visited 103 different actions 402 times. Merged at 41 different actions 265 times. Widened at 11 different actions 25 times. Performed 1597 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1597 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:31:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:23,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:23,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:23,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:23,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:23,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:23,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:31:23,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:24,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:25,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:25,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:26,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:26,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:26,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 48 [2019-09-10 07:31:26,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:26,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 07:31:26,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 07:31:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2056, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:31:26,503 INFO L87 Difference]: Start difference. First operand 112640 states and 141986 transitions. Second operand 33 states. [2019-09-10 07:31:26,712 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:29,888 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-09-10 07:31:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:39,807 INFO L93 Difference]: Finished difference Result 309578 states and 390099 transitions. [2019-09-10 07:31:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 07:31:39,808 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2019-09-10 07:31:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:40,202 INFO L225 Difference]: With dead ends: 309578 [2019-09-10 07:31:40,202 INFO L226 Difference]: Without dead ends: 309578 [2019-09-10 07:31:40,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1359, Invalid=9983, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 07:31:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309578 states. [2019-09-10 07:31:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309578 to 115242. [2019-09-10 07:31:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115242 states. [2019-09-10 07:31:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115242 states to 115242 states and 145750 transitions. [2019-09-10 07:31:42,985 INFO L78 Accepts]: Start accepts. Automaton has 115242 states and 145750 transitions. Word has length 112 [2019-09-10 07:31:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:42,985 INFO L475 AbstractCegarLoop]: Abstraction has 115242 states and 145750 transitions. [2019-09-10 07:31:42,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 07:31:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 115242 states and 145750 transitions. [2019-09-10 07:31:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:31:42,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:42,996 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:42,996 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1976166411, now seen corresponding path program 1 times [2019-09-10 07:31:42,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:42,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:42,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:43,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:43,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:43,191 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:31:43,191 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:31:43,193 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:43,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:43,215 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:43,469 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:43,469 INFO L272 AbstractInterpreter]: Visited 103 different actions 467 times. Merged at 40 different actions 321 times. Widened at 14 different actions 45 times. Performed 1805 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1805 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:31:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:43,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:43,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:43,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:43,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:43,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:43,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:31:43,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:43,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:43,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:43,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:44,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2019-09-10 07:31:44,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:44,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:31:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:31:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:31:44,931 INFO L87 Difference]: Start difference. First operand 115242 states and 145750 transitions. Second operand 18 states. [2019-09-10 07:31:50,472 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-09-10 07:31:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:52,568 INFO L93 Difference]: Finished difference Result 298015 states and 373951 transitions. [2019-09-10 07:31:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 07:31:52,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2019-09-10 07:31:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:52,881 INFO L225 Difference]: With dead ends: 298015 [2019-09-10 07:31:52,881 INFO L226 Difference]: Without dead ends: 298015 [2019-09-10 07:31:52,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1865, Invalid=7837, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 07:31:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298015 states. [2019-09-10 07:31:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298015 to 140489. [2019-09-10 07:31:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140489 states. [2019-09-10 07:31:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140489 states to 140489 states and 177060 transitions. [2019-09-10 07:31:55,594 INFO L78 Accepts]: Start accepts. Automaton has 140489 states and 177060 transitions. Word has length 112 [2019-09-10 07:31:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:55,594 INFO L475 AbstractCegarLoop]: Abstraction has 140489 states and 177060 transitions. [2019-09-10 07:31:55,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:31:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 140489 states and 177060 transitions. [2019-09-10 07:31:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:31:55,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:55,602 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:55,602 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1324157844, now seen corresponding path program 1 times [2019-09-10 07:31:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:55,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:55,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:55,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:55,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:55,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:31:55,882 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:31:55,884 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:55,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:55,900 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:56,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:56,212 INFO L272 AbstractInterpreter]: Visited 105 different actions 450 times. Merged at 42 different actions 308 times. Widened at 12 different actions 35 times. Performed 1747 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1747 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 8 different actions. Largest state had 173 variables. [2019-09-10 07:31:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:56,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:56,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:56,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:56,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:56,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:31:56,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:56,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:56,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:56,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:57,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:57,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:57,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 07:31:57,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:57,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:31:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:31:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:31:57,179 INFO L87 Difference]: Start difference. First operand 140489 states and 177060 transitions. Second operand 20 states. [2019-09-10 07:31:58,173 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2019-09-10 07:31:59,535 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-09-10 07:31:59,964 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-09-10 07:32:00,497 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-09-10 07:32:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:00,958 INFO L93 Difference]: Finished difference Result 230036 states and 288951 transitions. [2019-09-10 07:32:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:32:00,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2019-09-10 07:32:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:01,223 INFO L225 Difference]: With dead ends: 230036 [2019-09-10 07:32:01,223 INFO L226 Difference]: Without dead ends: 230036 [2019-09-10 07:32:01,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=514, Invalid=1936, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:32:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230036 states. [2019-09-10 07:32:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230036 to 155754. [2019-09-10 07:32:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155754 states. [2019-09-10 07:32:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155754 states to 155754 states and 196658 transitions. [2019-09-10 07:32:03,685 INFO L78 Accepts]: Start accepts. Automaton has 155754 states and 196658 transitions. Word has length 112 [2019-09-10 07:32:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:03,685 INFO L475 AbstractCegarLoop]: Abstraction has 155754 states and 196658 transitions. [2019-09-10 07:32:03,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:32:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 155754 states and 196658 transitions. [2019-09-10 07:32:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:32:03,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:03,691 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:03,691 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1607271052, now seen corresponding path program 1 times [2019-09-10 07:32:03,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:03,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:03,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:04,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:04,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:32:04,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:32:04,454 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:32:04,457 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:32:04,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:32:04,482 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:32:04,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:32:04,686 INFO L272 AbstractInterpreter]: Visited 105 different actions 383 times. Merged at 42 different actions 245 times. Widened at 10 different actions 24 times. Performed 1543 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:32:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:04,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:32:04,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:04,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:32:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:04,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:32:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:04,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:32:04,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:32:04,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:04,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:05,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:32:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:32:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2019-09-10 07:32:05,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:32:05,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:32:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:32:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:32:05,790 INFO L87 Difference]: Start difference. First operand 155754 states and 196658 transitions. Second operand 30 states. [2019-09-10 07:32:06,018 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:32:11,442 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-09-10 07:32:12,753 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 07:32:12,952 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:14,607 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:17,457 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 07:32:20,025 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:20,830 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 07:32:22,857 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:32:23,045 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:23,233 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:24,166 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:24,941 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:32:26,023 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:32:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:27,132 INFO L93 Difference]: Finished difference Result 283615 states and 354055 transitions. [2019-09-10 07:32:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-10 07:32:27,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-09-10 07:32:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:27,438 INFO L225 Difference]: With dead ends: 283615 [2019-09-10 07:32:27,438 INFO L226 Difference]: Without dead ends: 283615 [2019-09-10 07:32:27,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8934 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3596, Invalid=24126, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 07:32:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283615 states. [2019-09-10 07:32:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283615 to 187619. [2019-09-10 07:32:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187619 states. [2019-09-10 07:32:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187619 states to 187619 states and 236806 transitions. [2019-09-10 07:32:29,699 INFO L78 Accepts]: Start accepts. Automaton has 187619 states and 236806 transitions. Word has length 112 [2019-09-10 07:32:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:29,700 INFO L475 AbstractCegarLoop]: Abstraction has 187619 states and 236806 transitions. [2019-09-10 07:32:29,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:32:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 187619 states and 236806 transitions. [2019-09-10 07:32:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:32:29,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:29,707 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:29,707 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash -773371627, now seen corresponding path program 1 times [2019-09-10 07:32:29,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:29,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:29,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:29,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:29,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:32:29,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:32:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:32:29,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:32:29,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:32:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:32:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:32:29,764 INFO L87 Difference]: Start difference. First operand 187619 states and 236806 transitions. Second operand 4 states. [2019-09-10 07:32:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:30,368 INFO L93 Difference]: Finished difference Result 265304 states and 333177 transitions. [2019-09-10 07:32:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:32:30,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 07:32:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:30,670 INFO L225 Difference]: With dead ends: 265304 [2019-09-10 07:32:30,671 INFO L226 Difference]: Without dead ends: 265304 [2019-09-10 07:32:30,671 INFO L628 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-09-10 07:32:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265304 states. [2019-09-10 07:32:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265304 to 186594. [2019-09-10 07:32:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186594 states. [2019-09-10 07:32:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186594 states to 186594 states and 234742 transitions. [2019-09-10 07:32:38,425 INFO L78 Accepts]: Start accepts. Automaton has 186594 states and 234742 transitions. Word has length 112 [2019-09-10 07:32:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:38,425 INFO L475 AbstractCegarLoop]: Abstraction has 186594 states and 234742 transitions. [2019-09-10 07:32:38,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:32:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 186594 states and 234742 transitions. [2019-09-10 07:32:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:32:38,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:38,432 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:38,432 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:38,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 100106068, now seen corresponding path program 1 times [2019-09-10 07:32:38,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:38,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:38,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:38,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:38,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:32:38,860 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:32:38,860 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [881], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:32:38,862 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:32:38,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:32:38,884 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:32:39,163 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:32:39,163 INFO L272 AbstractInterpreter]: Visited 105 different actions 489 times. Merged at 41 different actions 341 times. Widened at 13 different actions 48 times. Performed 1853 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1853 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 11 different actions. Largest state had 173 variables. [2019-09-10 07:32:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:39,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:32:39,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:39,164 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:32:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:39,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:32:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:39,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:32:39,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:32:39,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:39,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:39,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:32:40,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:40,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:32:40,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2019-09-10 07:32:40,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:32:40,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:32:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:32:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:32:40,126 INFO L87 Difference]: Start difference. First operand 186594 states and 234742 transitions. Second operand 22 states. [2019-09-10 07:32:42,347 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:32:42,794 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:32:43,051 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:32:43,200 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 07:32:43,452 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:32:43,749 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:32:44,016 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:32:44,219 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:32:44,744 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:32:44,989 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:32:45,355 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:32:46,083 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:32:46,425 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:32:46,857 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:32:47,858 WARN L188 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:32:48,090 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:32:48,243 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:32:48,771 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:32:49,553 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:32:50,013 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 07:32:50,443 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:32:52,688 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:32:53,102 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:32:53,509 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:32:53,909 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:32:54,382 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:32:54,801 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:32:55,028 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:32:55,396 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:32:55,879 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:32:56,360 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:32:56,568 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:32:56,728 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:32:57,166 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:32:57,617 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:32:57,964 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:32:58,234 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:32:58,525 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:32:58,682 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:32:58,904 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:32:59,163 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:32:59,734 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:33:00,011 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:33:00,206 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:33:00,610 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:33:00,865 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:33:01,238 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:33:01,510 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:33:01,864 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:33:02,350 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:33:02,699 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:33:02,949 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:03,294 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:33:03,602 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:33:03,752 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 07:33:04,209 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:33:04,591 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:33:05,049 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:33:05,600 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:33:05,822 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:33:06,173 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:33:06,550 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:06,870 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:33:07,067 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:33:07,255 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:33:07,874 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:33:08,233 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:33:08,497 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:08,700 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 07:33:09,057 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:33:09,394 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:33:09,759 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:33:10,220 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:33:10,471 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:33:10,733 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:11,015 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:33:11,343 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:33:11,744 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:33:12,280 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 07:33:13,362 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:33:13,655 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:33:13,802 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 07:33:14,057 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:33:14,753 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:33:15,114 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:33:15,755 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 07:33:16,142 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:33:16,395 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:33:18,127 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:33:18,969 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:33:19,704 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:33:20,058 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:33:20,302 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:33:20,619 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:33:21,147 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:33:21,389 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:33:21,579 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:33:22,336 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:33:23,179 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:33:23,749 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:24,651 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:33:25,314 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:33:25,964 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 07:33:26,778 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:33:27,052 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:33:27,392 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:33:27,590 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:33:27,746 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 07:33:28,222 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:33:28,562 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:33:29,233 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:33:30,349 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:33:30,877 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:33:31,218 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:33:31,571 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:33:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:32,986 INFO L93 Difference]: Finished difference Result 563620 states and 698111 transitions. [2019-09-10 07:33:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-10 07:33:32,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2019-09-10 07:33:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:33:33,679 INFO L225 Difference]: With dead ends: 563620 [2019-09-10 07:33:33,679 INFO L226 Difference]: Without dead ends: 563620 [2019-09-10 07:33:33,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14292 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=5356, Invalid=33256, Unknown=0, NotChecked=0, Total=38612 [2019-09-10 07:33:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563620 states. [2019-09-10 07:33:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563620 to 236915. [2019-09-10 07:33:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236915 states. [2019-09-10 07:33:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236915 states to 236915 states and 298027 transitions. [2019-09-10 07:33:41,937 INFO L78 Accepts]: Start accepts. Automaton has 236915 states and 298027 transitions. Word has length 112 [2019-09-10 07:33:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:33:41,938 INFO L475 AbstractCegarLoop]: Abstraction has 236915 states and 298027 transitions. [2019-09-10 07:33:41,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:33:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 236915 states and 298027 transitions. [2019-09-10 07:33:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:33:41,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:33:41,946 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:33:41,946 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:33:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1915955341, now seen corresponding path program 1 times [2019-09-10 07:33:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:33:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:41,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:41,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:33:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:42,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:42,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:33:42,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 07:33:42,378 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:33:42,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:33:42,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:33:42,402 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:33:43,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:33:43,366 INFO L272 AbstractInterpreter]: Visited 104 different actions 507 times. Merged at 41 different actions 359 times. Widened at 12 different actions 45 times. Performed 1895 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1895 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 12 different actions. Largest state had 173 variables. [2019-09-10 07:33:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:43,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:33:43,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:43,367 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:33:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:43,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:33:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:43,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 07:33:43,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:33:44,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:44,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:33:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:45,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:46,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:33:46,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 53 [2019-09-10 07:33:46,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:33:46,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 07:33:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 07:33:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2494, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:33:46,238 INFO L87 Difference]: Start difference. First operand 236915 states and 298027 transitions. Second operand 37 states. [2019-09-10 07:33:48,235 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:33:48,593 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:33:49,005 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:33:50,166 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:33:50,974 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:33:51,204 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:33:52,004 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:33:53,256 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:33:54,001 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:33:55,016 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:33:58,825 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:34:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:01,934 INFO L93 Difference]: Finished difference Result 348752 states and 435779 transitions. [2019-09-10 07:34:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 07:34:01,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2019-09-10 07:34:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:02,313 INFO L225 Difference]: With dead ends: 348752 [2019-09-10 07:34:02,314 INFO L226 Difference]: Without dead ends: 348752 [2019-09-10 07:34:02,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3341 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1614, Invalid=10376, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 07:34:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348752 states. [2019-09-10 07:34:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348752 to 247352. [2019-09-10 07:34:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247352 states. [2019-09-10 07:34:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247352 states to 247352 states and 311130 transitions. [2019-09-10 07:34:09,646 INFO L78 Accepts]: Start accepts. Automaton has 247352 states and 311130 transitions. Word has length 113 [2019-09-10 07:34:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:09,646 INFO L475 AbstractCegarLoop]: Abstraction has 247352 states and 311130 transitions. [2019-09-10 07:34:09,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 07:34:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 247352 states and 311130 transitions. [2019-09-10 07:34:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:34:09,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:09,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:09,656 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1200372289, now seen corresponding path program 1 times [2019-09-10 07:34:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:09,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:09,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:10,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:10,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:10,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 07:34:10,150 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:10,152 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:10,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:10,169 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:10,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:10,426 INFO L272 AbstractInterpreter]: Visited 106 different actions 447 times. Merged at 42 different actions 304 times. Widened at 12 different actions 31 times. Performed 1747 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1747 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:34:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:10,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:10,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:10,426 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:34:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:10,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:34:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:10,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:34:10,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:10,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:10,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:10,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:10,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:10,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:10,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:11,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:11,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:11,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:34:11,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2019-09-10 07:34:11,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:34:11,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:34:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:34:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:34:11,546 INFO L87 Difference]: Start difference. First operand 247352 states and 311130 transitions. Second operand 22 states. [2019-09-10 07:34:13,298 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2019-09-10 07:34:13,625 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 22 [2019-09-10 07:34:14,122 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 07:34:14,576 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2019-09-10 07:34:14,760 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:34:15,413 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-09-10 07:34:15,577 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2019-09-10 07:34:16,113 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:34:16,390 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2019-09-10 07:34:16,847 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2019-09-10 07:34:17,045 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-09-10 07:34:17,463 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:34:18,076 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:34:18,375 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-09-10 07:34:18,670 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2019-09-10 07:34:18,937 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-09-10 07:34:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:20,384 INFO L93 Difference]: Finished difference Result 546249 states and 672625 transitions. [2019-09-10 07:34:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:34:20,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-09-10 07:34:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:21,077 INFO L225 Difference]: With dead ends: 546249 [2019-09-10 07:34:21,078 INFO L226 Difference]: Without dead ends: 546249 [2019-09-10 07:34:21,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 202 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1352, Invalid=4968, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 07:34:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546249 states. [2019-09-10 07:34:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546249 to 281434. [2019-09-10 07:34:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281434 states. [2019-09-10 07:34:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281434 states to 281434 states and 353935 transitions. [2019-09-10 07:34:30,258 INFO L78 Accepts]: Start accepts. Automaton has 281434 states and 353935 transitions. Word has length 113 [2019-09-10 07:34:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:30,258 INFO L475 AbstractCegarLoop]: Abstraction has 281434 states and 353935 transitions. [2019-09-10 07:34:30,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:34:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 281434 states and 353935 transitions. [2019-09-10 07:34:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:34:30,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:30,266 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:30,266 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1698417531, now seen corresponding path program 1 times [2019-09-10 07:34:30,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:30,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:30,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:34:30,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:30,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:30,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:30,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,345 INFO L87 Difference]: Start difference. First operand 281434 states and 353935 transitions. Second operand 3 states. [2019-09-10 07:34:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:30,693 INFO L93 Difference]: Finished difference Result 122874 states and 153511 transitions. [2019-09-10 07:34:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:30,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 07:34:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:30,810 INFO L225 Difference]: With dead ends: 122874 [2019-09-10 07:34:30,810 INFO L226 Difference]: Without dead ends: 122874 [2019-09-10 07:34:30,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122874 states. [2019-09-10 07:34:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122874 to 120466. [2019-09-10 07:34:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120466 states. [2019-09-10 07:34:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120466 states to 120466 states and 150865 transitions. [2019-09-10 07:34:32,646 INFO L78 Accepts]: Start accepts. Automaton has 120466 states and 150865 transitions. Word has length 113 [2019-09-10 07:34:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 120466 states and 150865 transitions. [2019-09-10 07:34:32,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 120466 states and 150865 transitions. [2019-09-10 07:34:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:34:32,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,650 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:32,650 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash -557895752, now seen corresponding path program 1 times [2019-09-10 07:34:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:32,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:32,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:32,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 07:34:32,846 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:32,847 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:32,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:32,862 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:33,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:33,117 INFO L272 AbstractInterpreter]: Visited 106 different actions 412 times. Merged at 42 different actions 273 times. Widened at 11 different actions 28 times. Performed 1608 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1608 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 9 different actions. Largest state had 173 variables. [2019-09-10 07:34:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:33,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:33,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:33,117 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:34:33,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:33,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:34:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:33,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 07:34:33,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:33,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:34:33,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 24 [2019-09-10 07:34:33,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:34:33,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:34:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:34:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:34:33,896 INFO L87 Difference]: Start difference. First operand 120466 states and 150865 transitions. Second operand 20 states. [2019-09-10 07:34:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:36,147 INFO L93 Difference]: Finished difference Result 148701 states and 185026 transitions. [2019-09-10 07:34:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:34:36,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-09-10 07:34:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:36,298 INFO L225 Difference]: With dead ends: 148701 [2019-09-10 07:34:36,298 INFO L226 Difference]: Without dead ends: 148701 [2019-09-10 07:34:36,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=561, Invalid=1791, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:34:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148701 states. [2019-09-10 07:34:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148701 to 118640. [2019-09-10 07:34:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118640 states. [2019-09-10 07:34:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118640 states to 118640 states and 148455 transitions. [2019-09-10 07:34:39,992 INFO L78 Accepts]: Start accepts. Automaton has 118640 states and 148455 transitions. Word has length 113 [2019-09-10 07:34:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:39,992 INFO L475 AbstractCegarLoop]: Abstraction has 118640 states and 148455 transitions. [2019-09-10 07:34:39,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:34:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 118640 states and 148455 transitions. [2019-09-10 07:34:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:34:39,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:39,996 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:39,996 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -364929250, now seen corresponding path program 1 times [2019-09-10 07:34:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:39,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:41,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:41,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:41,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 07:34:41,238 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [894], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:41,240 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:41,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:41,259 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:41,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:41,430 INFO L272 AbstractInterpreter]: Visited 106 different actions 408 times. Merged at 42 different actions 269 times. Widened at 11 different actions 26 times. Performed 1609 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1609 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:34:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:41,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:41,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:41,431 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:34:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:41,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:34:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:41,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 07:34:41,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:43,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:43,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:44,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:46,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,564 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 07:34:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:46,808 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:34:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:34:47,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 24] total 71 [2019-09-10 07:34:47,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:34:47,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:34:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:34:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4574, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:34:47,462 INFO L87 Difference]: Start difference. First operand 118640 states and 148455 transitions. Second operand 50 states. [2019-09-10 07:34:47,790 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:34:49,613 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-10 07:34:50,043 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-10 07:34:50,456 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-09-10 07:34:50,764 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:34:51,092 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:34:51,377 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:34:51,690 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 07:34:51,975 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 07:34:52,220 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:34:52,568 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:34:53,834 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:34:54,151 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:34:54,519 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:34:55,147 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:34:55,498 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:34:56,087 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:34:56,417 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:34:56,949 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:34:57,574 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:34:57,845 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:34:58,938 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:34:59,695 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:35:00,226 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:35:00,606 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:35:01,126 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:35:02,478 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:35:03,105 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 07:35:03,675 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:35:04,101 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:35:04,833 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:35:05,468 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:35:05,851 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:35:06,267 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:35:09,391 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:35:09,847 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:35:10,156 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:35:11,069 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:35:11,427 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:35:11,812 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:12,142 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:35:13,103 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:35:13,699 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:35:13,959 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:35:14,376 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:15,194 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 07:35:15,743 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-10 07:35:16,206 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:35:17,004 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:35:17,437 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-09-10 07:35:17,998 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 07:35:19,341 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:35:22,411 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 07:35:23,866 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:35:24,205 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:35:24,498 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:35:26,887 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:35:27,165 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:35:27,716 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:35:27,961 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:35:28,450 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-10 07:35:28,730 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:35:29,753 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:35:30,237 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:35:30,794 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-09-10 07:35:31,244 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 07:35:32,061 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:35:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:34,132 INFO L93 Difference]: Finished difference Result 152771 states and 189488 transitions. [2019-09-10 07:35:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 07:35:34,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 113 [2019-09-10 07:35:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:34,282 INFO L225 Difference]: With dead ends: 152771 [2019-09-10 07:35:34,282 INFO L226 Difference]: Without dead ends: 152771 [2019-09-10 07:35:34,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10771 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=6074, Invalid=32538, Unknown=0, NotChecked=0, Total=38612 [2019-09-10 07:35:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152771 states. [2019-09-10 07:35:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152771 to 119247. [2019-09-10 07:35:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119247 states. [2019-09-10 07:35:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119247 states to 119247 states and 149231 transitions. [2019-09-10 07:35:35,571 INFO L78 Accepts]: Start accepts. Automaton has 119247 states and 149231 transitions. Word has length 113 [2019-09-10 07:35:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:35,571 INFO L475 AbstractCegarLoop]: Abstraction has 119247 states and 149231 transitions. [2019-09-10 07:35:35,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:35:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 119247 states and 149231 transitions. [2019-09-10 07:35:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:35:35,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:35,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:35:35,575 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:35,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:35,576 INFO L82 PathProgramCache]: Analyzing trace with hash -125485004, now seen corresponding path program 1 times [2019-09-10 07:35:35,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:35,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:35,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:35,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:35,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:35:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:35:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:35:35,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:35:35,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:35:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:35:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:35,623 INFO L87 Difference]: Start difference. First operand 119247 states and 149231 transitions. Second operand 3 states. [2019-09-10 07:35:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:35,787 INFO L93 Difference]: Finished difference Result 68539 states and 83051 transitions. [2019-09-10 07:35:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:35:35,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:35:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:35,844 INFO L225 Difference]: With dead ends: 68539 [2019-09-10 07:35:35,844 INFO L226 Difference]: Without dead ends: 68539 [2019-09-10 07:35:35,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68539 states. [2019-09-10 07:35:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68539 to 66840. [2019-09-10 07:35:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66840 states. [2019-09-10 07:35:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66840 states to 66840 states and 81081 transitions. [2019-09-10 07:35:36,400 INFO L78 Accepts]: Start accepts. Automaton has 66840 states and 81081 transitions. Word has length 114 [2019-09-10 07:35:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:36,401 INFO L475 AbstractCegarLoop]: Abstraction has 66840 states and 81081 transitions. [2019-09-10 07:35:36,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:35:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 66840 states and 81081 transitions. [2019-09-10 07:35:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:35:36,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:36,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:35:36,403 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -254097247, now seen corresponding path program 1 times [2019-09-10 07:35:36,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:36,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:36,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:36,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:36,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:35:36,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:35:36,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:35:36,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:35:36,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:35:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:35:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:36,454 INFO L87 Difference]: Start difference. First operand 66840 states and 81081 transitions. Second operand 3 states. [2019-09-10 07:35:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:36,606 INFO L93 Difference]: Finished difference Result 56095 states and 67485 transitions. [2019-09-10 07:35:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:35:36,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:35:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:36,652 INFO L225 Difference]: With dead ends: 56095 [2019-09-10 07:35:36,652 INFO L226 Difference]: Without dead ends: 56095 [2019-09-10 07:35:36,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56095 states. [2019-09-10 07:35:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56095 to 56095. [2019-09-10 07:35:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56095 states. [2019-09-10 07:35:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56095 states to 56095 states and 67485 transitions. [2019-09-10 07:35:37,358 INFO L78 Accepts]: Start accepts. Automaton has 56095 states and 67485 transitions. Word has length 114 [2019-09-10 07:35:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:37,359 INFO L475 AbstractCegarLoop]: Abstraction has 56095 states and 67485 transitions. [2019-09-10 07:35:37,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:35:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 56095 states and 67485 transitions. [2019-09-10 07:35:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:35:37,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:37,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:35:37,361 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -571930689, now seen corresponding path program 1 times [2019-09-10 07:35:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:37,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:37,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:37,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:35:37,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:35:37,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:35:37,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:35:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:35:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:37,415 INFO L87 Difference]: Start difference. First operand 56095 states and 67485 transitions. Second operand 3 states. [2019-09-10 07:35:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:37,482 INFO L93 Difference]: Finished difference Result 17464 states and 20356 transitions. [2019-09-10 07:35:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:35:37,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:35:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:37,502 INFO L225 Difference]: With dead ends: 17464 [2019-09-10 07:35:37,503 INFO L226 Difference]: Without dead ends: 17464 [2019-09-10 07:35:37,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:35:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17464 states. [2019-09-10 07:35:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17464 to 17395. [2019-09-10 07:35:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17395 states. [2019-09-10 07:35:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17395 states to 17395 states and 20285 transitions. [2019-09-10 07:35:37,695 INFO L78 Accepts]: Start accepts. Automaton has 17395 states and 20285 transitions. Word has length 114 [2019-09-10 07:35:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:37,695 INFO L475 AbstractCegarLoop]: Abstraction has 17395 states and 20285 transitions. [2019-09-10 07:35:37,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:35:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17395 states and 20285 transitions. [2019-09-10 07:35:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:35:37,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:37,697 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:35:37,697 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash -850884415, now seen corresponding path program 1 times [2019-09-10 07:35:37,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:37,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:37,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:38,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:38,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:35:38,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 07:35:38,127 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [857], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [894], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:35:38,129 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:35:38,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:35:38,145 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:35:38,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:35:38,319 INFO L272 AbstractInterpreter]: Visited 105 different actions 381 times. Merged at 42 different actions 245 times. Widened at 10 different actions 20 times. Performed 1575 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 173 variables. [2019-09-10 07:35:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:38,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:35:38,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:38,320 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:35:38,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:38,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:35:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:38,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 07:35:38,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:35:39,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:40,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:35:40,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:41,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:41,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:41,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:41,501 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-10 07:35:41,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:42,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:35:42,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 21] total 56 [2019-09-10 07:35:42,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:35:42,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 07:35:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 07:35:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2867, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:35:42,021 INFO L87 Difference]: Start difference. First operand 17395 states and 20285 transitions. Second operand 38 states. [2019-09-10 07:35:42,197 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 26 [2019-09-10 07:35:43,800 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-10 07:35:45,446 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 07:35:46,226 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 07:35:46,436 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-09-10 07:35:46,676 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 07:35:46,910 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-09-10 07:35:47,207 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 07:35:47,684 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 07:35:48,409 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 07:35:48,603 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-09-10 07:35:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:51,878 INFO L93 Difference]: Finished difference Result 18004 states and 20945 transitions. [2019-09-10 07:35:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:35:51,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 114 [2019-09-10 07:35:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:51,892 INFO L225 Difference]: With dead ends: 18004 [2019-09-10 07:35:51,893 INFO L226 Difference]: Without dead ends: 18004 [2019-09-10 07:35:51,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1203, Invalid=8897, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 07:35:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18004 states. [2019-09-10 07:35:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18004 to 17376. [2019-09-10 07:35:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17376 states. [2019-09-10 07:35:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 20262 transitions. [2019-09-10 07:35:52,013 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 20262 transitions. Word has length 114 [2019-09-10 07:35:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:52,013 INFO L475 AbstractCegarLoop]: Abstraction has 17376 states and 20262 transitions. [2019-09-10 07:35:52,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 07:35:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 20262 transitions. [2019-09-10 07:35:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:35:52,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:52,014 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:35:52,014 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1684875397, now seen corresponding path program 1 times [2019-09-10 07:35:52,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:52,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:52,681 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 07:35:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:53,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:53,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:35:53,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 07:35:53,152 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [857], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:35:53,153 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:35:53,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:35:53,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:35:53,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:35:53,302 INFO L272 AbstractInterpreter]: Visited 107 different actions 376 times. Merged at 43 different actions 239 times. Widened at 9 different actions 19 times. Performed 1521 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1521 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 12 different actions. Largest state had 173 variables. [2019-09-10 07:35:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:53,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:35:53,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:53,303 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:35:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:53,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:35:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:53,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 07:35:53,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:35:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:54,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:35:54,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:54,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:35:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 14] total 46 [2019-09-10 07:35:54,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:35:54,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:35:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:35:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1910, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:35:54,866 INFO L87 Difference]: Start difference. First operand 17376 states and 20262 transitions. Second operand 35 states. [2019-09-10 07:35:56,584 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:35:56,868 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 07:35:57,240 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:35:57,639 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:35:57,913 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2019-09-10 07:35:58,132 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:35:58,357 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-09-10 07:35:58,524 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:35:58,786 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:35:58,949 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 07:35:59,300 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:35:59,637 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 07:35:59,956 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-09-10 07:36:00,282 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 07:36:00,469 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-09-10 07:36:00,980 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 07:36:01,530 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-10 07:36:02,264 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 07:36:02,798 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:36:02,992 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-09-10 07:36:03,513 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:36:03,724 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:36:03,970 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 07:36:04,149 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:36:04,550 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:36:04,864 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:36:05,106 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 07:36:05,314 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:36:05,535 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:36:05,749 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:36:05,904 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-10 07:36:06,143 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 07:36:06,399 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 07:36:06,561 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:36:07,223 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:36:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:10,548 INFO L93 Difference]: Finished difference Result 29253 states and 33505 transitions. [2019-09-10 07:36:10,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 07:36:10,548 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2019-09-10 07:36:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:10,569 INFO L225 Difference]: With dead ends: 29253 [2019-09-10 07:36:10,570 INFO L226 Difference]: Without dead ends: 29253 [2019-09-10 07:36:10,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5426 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=2718, Invalid=16188, Unknown=0, NotChecked=0, Total=18906 [2019-09-10 07:36:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-09-10 07:36:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 17315. [2019-09-10 07:36:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17315 states. [2019-09-10 07:36:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17315 states to 17315 states and 20192 transitions. [2019-09-10 07:36:10,725 INFO L78 Accepts]: Start accepts. Automaton has 17315 states and 20192 transitions. Word has length 114 [2019-09-10 07:36:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:10,726 INFO L475 AbstractCegarLoop]: Abstraction has 17315 states and 20192 transitions. [2019-09-10 07:36:10,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:36:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 17315 states and 20192 transitions. [2019-09-10 07:36:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:36:10,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:10,727 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:10,727 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1635996108, now seen corresponding path program 1 times [2019-09-10 07:36:10,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:10,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:11,235 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 07:36:11,632 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-09-10 07:36:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:12,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:12,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:36:12,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 07:36:12,019 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [857], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:36:12,020 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:36:12,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:36:12,035 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:36:12,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:36:12,245 INFO L272 AbstractInterpreter]: Visited 106 different actions 555 times. Merged at 42 different actions 401 times. Widened at 12 different actions 64 times. Performed 2133 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2133 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 16 different actions. Largest state had 173 variables. [2019-09-10 07:36:12,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:12,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:36:12,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:12,246 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:36:12,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:12,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:36:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:12,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 07:36:12,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:36:12,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:13,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:14,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:36:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:16,218 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:36:16,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:16,766 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 07:36:16,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:36:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 64 [2019-09-10 07:36:17,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:36:17,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 07:36:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 07:36:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3766, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 07:36:17,159 INFO L87 Difference]: Start difference. First operand 17315 states and 20192 transitions. Second operand 45 states. [2019-09-10 07:36:17,360 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 07:36:18,722 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 28 [2019-09-10 07:36:20,588 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:36:21,297 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 07:36:21,620 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 07:36:22,302 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 07:36:22,698 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:36:23,628 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-10 07:36:23,937 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:36:25,860 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:36:26,369 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:36:27,208 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:36:27,461 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:36:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:29,079 INFO L93 Difference]: Finished difference Result 32189 states and 37638 transitions. [2019-09-10 07:36:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 07:36:29,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2019-09-10 07:36:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:29,105 INFO L225 Difference]: With dead ends: 32189 [2019-09-10 07:36:29,105 INFO L226 Difference]: Without dead ends: 32189 [2019-09-10 07:36:29,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3164 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1119, Invalid=11537, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 07:36:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32189 states. [2019-09-10 07:36:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32189 to 16078. [2019-09-10 07:36:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-09-10 07:36:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 18758 transitions. [2019-09-10 07:36:29,276 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 18758 transitions. Word has length 115 [2019-09-10 07:36:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:29,276 INFO L475 AbstractCegarLoop]: Abstraction has 16078 states and 18758 transitions. [2019-09-10 07:36:29,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:36:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 18758 transitions. [2019-09-10 07:36:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 07:36:29,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:29,279 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:29,279 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1545595269, now seen corresponding path program 1 times [2019-09-10 07:36:29,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:29,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:29,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 07:36:29,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:36:29,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:36:29,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:36:29,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:36:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:36:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:29,346 INFO L87 Difference]: Start difference. First operand 16078 states and 18758 transitions. Second operand 3 states. [2019-09-10 07:36:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:29,375 INFO L93 Difference]: Finished difference Result 7990 states and 9213 transitions. [2019-09-10 07:36:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:36:29,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 07:36:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:29,383 INFO L225 Difference]: With dead ends: 7990 [2019-09-10 07:36:29,383 INFO L226 Difference]: Without dead ends: 7990 [2019-09-10 07:36:29,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7990 states. [2019-09-10 07:36:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7990 to 7988. [2019-09-10 07:36:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7988 states. [2019-09-10 07:36:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 9212 transitions. [2019-09-10 07:36:29,457 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 9212 transitions. Word has length 160 [2019-09-10 07:36:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:29,458 INFO L475 AbstractCegarLoop]: Abstraction has 7988 states and 9212 transitions. [2019-09-10 07:36:29,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:36:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 9212 transitions. [2019-09-10 07:36:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 07:36:29,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:29,461 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:29,461 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -627033819, now seen corresponding path program 1 times [2019-09-10 07:36:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:29,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:29,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 30 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:29,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:29,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:36:29,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-10 07:36:29,766 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [872], [881], [883], [885], [888], [891], [896], [901], [903], [905], [907], [910], [913], [915], [918], [922], [924], [929], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:36:29,767 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:36:29,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:36:29,779 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:36:30,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:36:30,071 INFO L272 AbstractInterpreter]: Visited 108 different actions 735 times. Merged at 45 different actions 512 times. Widened at 19 different actions 120 times. Performed 2594 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2594 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 91 fixpoints after 21 different actions. Largest state had 173 variables. [2019-09-10 07:36:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:30,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:36:30,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:30,072 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:36:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:30,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:36:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:30,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:36:30,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:36:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:30,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:30,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:36:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:36:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:36:34,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:36:34,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:36:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:36:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:36:34,024 INFO L87 Difference]: Start difference. First operand 7988 states and 9212 transitions. Second operand 21 states. [2019-09-10 07:36:34,583 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:36:35,159 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:36:36,179 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:36:36,576 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:36:37,042 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:36:37,532 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:36:37,881 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 07:36:38,246 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:36:38,576 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 07:36:39,146 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 07:36:39,674 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-09-10 07:36:40,244 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:36:40,702 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:36:41,103 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 07:36:41,531 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-09-10 07:36:41,859 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:36:42,337 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:36:42,795 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:36:43,176 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:36:43,537 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:36:44,020 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:36:44,336 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-09-10 07:36:44,779 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:36:45,427 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 07:36:45,782 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:36:46,322 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:36:46,809 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 07:36:47,326 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:36:47,866 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:36:48,299 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-09-10 07:36:48,740 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:36:49,201 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:36:49,605 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:36:49,977 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:36:50,554 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:36:51,527 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:36:51,962 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 07:36:52,408 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:36:53,024 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:36:53,637 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:36:53,934 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:36:54,446 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 07:36:54,941 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:36:55,423 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:36:55,842 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:36:56,604 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:36:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:56,650 INFO L93 Difference]: Finished difference Result 19154 states and 22104 transitions. [2019-09-10 07:36:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 07:36:56,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2019-09-10 07:36:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:56,665 INFO L225 Difference]: With dead ends: 19154 [2019-09-10 07:36:56,665 INFO L226 Difference]: Without dead ends: 19154 [2019-09-10 07:36:56,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 249 SyntacticMatches, 57 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=1489, Invalid=4831, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 07:36:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-09-10 07:36:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 8735. [2019-09-10 07:36:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8735 states. [2019-09-10 07:36:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 9973 transitions. [2019-09-10 07:36:56,755 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 9973 transitions. Word has length 162 [2019-09-10 07:36:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:56,755 INFO L475 AbstractCegarLoop]: Abstraction has 8735 states and 9973 transitions. [2019-09-10 07:36:56,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:36:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 9973 transitions. [2019-09-10 07:36:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:36:56,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:56,757 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:56,757 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2024856988, now seen corresponding path program 1 times [2019-09-10 07:36:56,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:56,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:57,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:57,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:36:57,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 07:36:57,113 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [872], [874], [877], [883], [885], [888], [891], [896], [899], [901], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:36:57,115 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:36:57,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:36:57,131 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:36:57,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:36:57,374 INFO L272 AbstractInterpreter]: Visited 107 different actions 650 times. Merged at 44 different actions 464 times. Widened at 17 different actions 75 times. Performed 2404 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 76 fixpoints after 19 different actions. Largest state had 173 variables. [2019-09-10 07:36:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:57,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:36:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:57,375 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:36:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:57,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:36:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:57,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 07:36:57,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:36:57,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:58,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:59,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:37:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:37:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 26 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:01,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:37:01,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 54 [2019-09-10 07:37:01,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:37:01,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:37:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:37:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2654, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:37:01,347 INFO L87 Difference]: Start difference. First operand 8735 states and 9973 transitions. Second operand 36 states. [2019-09-10 07:37:03,432 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:37:03,813 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:37:04,306 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 07:37:05,455 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-10 07:37:07,860 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 07:37:09,472 WARN L188 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:37:10,618 WARN L188 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:37:11,627 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:37:12,691 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:37:13,616 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:37:14,238 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 07:37:14,517 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 07:37:15,048 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-10 07:37:15,828 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:37:16,083 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:37:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:37:37,747 INFO L93 Difference]: Finished difference Result 15213 states and 17447 transitions. [2019-09-10 07:37:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 07:37:37,747 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 163 [2019-09-10 07:37:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:37:37,759 INFO L225 Difference]: With dead ends: 15213 [2019-09-10 07:37:37,759 INFO L226 Difference]: Without dead ends: 15213 [2019-09-10 07:37:37,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 282 SyntacticMatches, 9 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4072 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=2105, Invalid=13894, Unknown=3, NotChecked=0, Total=16002 [2019-09-10 07:37:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15213 states. [2019-09-10 07:37:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15213 to 12454. [2019-09-10 07:37:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12454 states. [2019-09-10 07:37:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12454 states to 12454 states and 14285 transitions. [2019-09-10 07:37:37,852 INFO L78 Accepts]: Start accepts. Automaton has 12454 states and 14285 transitions. Word has length 163 [2019-09-10 07:37:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:37:37,852 INFO L475 AbstractCegarLoop]: Abstraction has 12454 states and 14285 transitions. [2019-09-10 07:37:37,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:37:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 12454 states and 14285 transitions. [2019-09-10 07:37:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:37:37,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:37:37,855 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:37:37,855 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:37:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -994112719, now seen corresponding path program 1 times [2019-09-10 07:37:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:37:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:37,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:37:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:38,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:38,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:37:38,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 07:37:38,479 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [859], [861], [863], [866], [869], [872], [874], [879], [883], [885], [888], [891], [894], [905], [907], [910], [913], [915], [918], [922], [924], [929], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:37:38,482 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:37:38,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:37:38,497 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:37:38,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:37:38,795 INFO L272 AbstractInterpreter]: Visited 108 different actions 765 times. Merged at 45 different actions 551 times. Widened at 21 different actions 113 times. Performed 2740 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2740 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 106 fixpoints after 22 different actions. Largest state had 173 variables. [2019-09-10 07:37:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:38,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:37:38,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:38,796 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:37:38,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:38,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:37:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:39,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 07:37:39,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:37:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:39,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:39,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:39,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:39,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:39,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:37:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:40,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:41,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:37:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2019-09-10 07:37:41,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:37:41,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:37:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:37:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1996, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:37:41,684 INFO L87 Difference]: Start difference. First operand 12454 states and 14285 transitions. Second operand 32 states. [2019-09-10 07:37:41,907 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 07:37:42,474 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:37:43,271 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:37:43,652 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:37:43,908 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:37:44,373 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 07:37:44,807 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:37:45,026 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:37:45,286 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:37:45,639 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-09-10 07:37:45,960 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 07:37:46,537 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:37:46,921 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-10 07:37:47,254 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:37:47,606 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-10 07:37:48,043 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:37:48,237 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:37:48,706 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 07:37:48,949 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:37:49,442 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-10 07:37:49,896 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-09-10 07:37:50,111 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:37:50,530 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:37:50,858 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:37:51,339 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:37:51,591 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:37:52,259 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 07:37:52,662 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:37:53,672 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:37:54,507 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 07:37:54,881 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:37:57,569 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-09-10 07:37:58,111 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2019-09-10 07:37:58,670 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 81 [2019-09-10 07:37:58,977 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:37:59,345 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 07:37:59,747 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-09-10 07:38:00,236 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-09-10 07:38:00,637 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-09-10 07:38:01,147 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2019-09-10 07:38:01,325 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:38:01,547 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:38:02,000 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:38:02,417 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-10 07:38:02,828 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-09-10 07:38:03,216 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-09-10 07:38:03,724 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-09-10 07:38:04,160 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 07:38:04,557 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:38:05,007 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 07:38:05,331 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 07:38:05,661 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:38:08,147 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 80 [2019-09-10 07:38:08,472 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:38:08,839 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 07:38:09,153 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:38:10,626 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2019-09-10 07:38:10,936 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:38:11,356 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-09-10 07:38:11,804 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2019-09-10 07:38:12,337 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 07:38:12,676 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 07:38:13,144 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 80 [2019-09-10 07:38:13,712 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 07:38:14,040 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 07:38:14,319 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 07:38:14,633 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:38:14,860 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:38:15,048 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:38:15,306 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:38:15,523 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:38:15,791 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:38:16,108 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:38:16,409 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:38:16,704 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:38:16,948 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:38:17,772 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-10 07:38:17,999 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-10 07:38:18,337 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:38:18,607 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:38:18,836 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:38:19,039 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 07:38:19,292 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:38:19,499 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 07:38:19,803 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:38:20,207 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:38:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:20,949 INFO L93 Difference]: Finished difference Result 22378 states and 25493 transitions. [2019-09-10 07:38:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-10 07:38:20,949 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 163 [2019-09-10 07:38:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:20,965 INFO L225 Difference]: With dead ends: 22378 [2019-09-10 07:38:20,966 INFO L226 Difference]: Without dead ends: 22378 [2019-09-10 07:38:20,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 284 SyntacticMatches, 14 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6470 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=3711, Invalid=18939, Unknown=0, NotChecked=0, Total=22650 [2019-09-10 07:38:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22378 states. [2019-09-10 07:38:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22378 to 14254. [2019-09-10 07:38:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-09-10 07:38:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 16330 transitions. [2019-09-10 07:38:21,084 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 16330 transitions. Word has length 163 [2019-09-10 07:38:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:21,085 INFO L475 AbstractCegarLoop]: Abstraction has 14254 states and 16330 transitions. [2019-09-10 07:38:21,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:38:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 16330 transitions. [2019-09-10 07:38:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:38:21,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:21,087 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:21,087 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2139751780, now seen corresponding path program 1 times [2019-09-10 07:38:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:21,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 35 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:22,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:22,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:22,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 07:38:22,189 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [852], [855], [861], [863], [866], [869], [874], [877], [879], [883], [885], [888], [891], [894], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:38:22,191 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:22,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:22,213 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:22,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:22,433 INFO L272 AbstractInterpreter]: Visited 107 different actions 480 times. Merged at 44 different actions 321 times. Widened at 12 different actions 30 times. Performed 1778 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1778 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:38:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:22,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:22,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:22,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:22,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:22,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 07:38:22,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:22,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:22,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 35 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:24,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:24,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:26,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:26,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:38:27,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:38:27,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:38:27,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:28,184 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 07:38:28,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:38:28,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:28,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:28,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:29,070 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 66 [2019-09-10 07:38:29,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:38:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 35 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:29,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 57 [2019-09-10 07:38:29,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:29,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 07:38:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 07:38:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2868, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:38:29,721 INFO L87 Difference]: Start difference. First operand 14254 states and 16330 transitions. Second operand 40 states. [2019-09-10 07:38:32,605 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:33,150 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:38:33,969 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:38:34,855 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:38:37,124 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:38:38,696 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:38,918 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:40,743 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:38:41,283 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:38:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:43,967 INFO L93 Difference]: Finished difference Result 15998 states and 18258 transitions. [2019-09-10 07:38:43,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 07:38:43,968 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 163 [2019-09-10 07:38:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:43,981 INFO L225 Difference]: With dead ends: 15998 [2019-09-10 07:38:43,981 INFO L226 Difference]: Without dead ends: 15998 [2019-09-10 07:38:43,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 265 SyntacticMatches, 26 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1204, Invalid=6278, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 07:38:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15998 states. [2019-09-10 07:38:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15998 to 15400. [2019-09-10 07:38:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15400 states. [2019-09-10 07:38:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 17615 transitions. [2019-09-10 07:38:44,085 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 17615 transitions. Word has length 163 [2019-09-10 07:38:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:44,086 INFO L475 AbstractCegarLoop]: Abstraction has 15400 states and 17615 transitions. [2019-09-10 07:38:44,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 07:38:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 17615 transitions. [2019-09-10 07:38:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:38:44,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:44,088 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:44,088 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1590595606, now seen corresponding path program 1 times [2019-09-10 07:38:44,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:44,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:38:44,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:38:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:38:44,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:38:44,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:38:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:38:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:38:44,149 INFO L87 Difference]: Start difference. First operand 15400 states and 17615 transitions. Second operand 4 states. [2019-09-10 07:38:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:44,292 INFO L93 Difference]: Finished difference Result 14944 states and 17146 transitions. [2019-09-10 07:38:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:38:44,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-10 07:38:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:44,303 INFO L225 Difference]: With dead ends: 14944 [2019-09-10 07:38:44,304 INFO L226 Difference]: Without dead ends: 14944 [2019-09-10 07:38:44,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-09-10 07:38:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2019-09-10 07:38:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 12290. [2019-09-10 07:38:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12290 states. [2019-09-10 07:38:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12290 states to 12290 states and 13930 transitions. [2019-09-10 07:38:44,393 INFO L78 Accepts]: Start accepts. Automaton has 12290 states and 13930 transitions. Word has length 163 [2019-09-10 07:38:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 12290 states and 13930 transitions. [2019-09-10 07:38:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:38:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 12290 states and 13930 transitions. [2019-09-10 07:38:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:38:44,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:44,395 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:44,395 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:44,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1830893995, now seen corresponding path program 1 times [2019-09-10 07:38:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:44,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:44,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:44,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:44,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 39 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:44,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:44,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:44,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-10 07:38:44,682 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], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [857], [859], [861], [863], [866], [869], [874], [879], [881], [883], [885], [888], [891], [894], [905], [907], [910], [913], [915], [918], [922], [924], [929], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:38:44,683 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:44,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:44,696 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:45,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:45,016 INFO L272 AbstractInterpreter]: Visited 109 different actions 764 times. Merged at 46 different actions 549 times. Widened at 18 different actions 109 times. Performed 2712 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 100 fixpoints after 21 different actions. Largest state had 173 variables. [2019-09-10 07:38:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:45,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:45,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:45,016 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:45,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:45,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:38:45,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:45,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 44 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:45,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:46,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 39 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:53,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:53,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:38:53,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:53,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:38:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:38:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:38:53,254 INFO L87 Difference]: Start difference. First operand 12290 states and 13930 transitions. Second operand 20 states.