java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:46:47,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:46:47,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:46:47,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:46:47,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:46:47,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:46:47,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:46:47,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:46:47,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:46:47,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:46:47,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:46:47,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:46:47,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:46:47,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:46:47,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:46:47,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:46:47,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:46:47,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:46:47,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:46:47,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:46:47,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:46:47,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:46:47,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:46:47,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:46:47,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:46:47,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:46:47,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:46:47,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:46:47,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:46:47,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:46:47,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:46:47,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:46:47,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:46:47,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:46:47,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:46:47,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:46:47,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:46:47,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:46:47,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:46:47,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:46:47,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:46:47,735 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 06:46:47,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:46:47,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:46:47,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:46:47,750 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:46:47,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:46:47,751 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:46:47,751 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:46:47,752 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:46:47,752 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:46:47,752 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:46:47,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:46:47,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:46:47,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:46:47,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:46:47,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:46:47,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:46:47,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:46:47,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:46:47,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:46:47,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:46:47,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:46:47,755 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:46:47,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:46:47,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:46:47,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:46:47,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:46:47,756 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:46:47,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:46:47,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:46:47,756 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:46:47,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:46:47,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:46:47,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:46:47,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:46:47,812 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:46:47,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:46:47,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccaa9d1a0/68308a53d0ba47ad9da68d9b473089a1/FLAG6936277dc [2019-09-10 06:46:48,482 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:46:48,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:46:48,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccaa9d1a0/68308a53d0ba47ad9da68d9b473089a1/FLAG6936277dc [2019-09-10 06:46:48,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccaa9d1a0/68308a53d0ba47ad9da68d9b473089a1 [2019-09-10 06:46:48,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:46:48,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:46:48,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:46:48,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:46:48,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:46:48,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:46:48" (1/1) ... [2019-09-10 06:46:48,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfdec4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:48, skipping insertion in model container [2019-09-10 06:46:48,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:46:48" (1/1) ... [2019-09-10 06:46:48,741 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:46:48,832 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:46:49,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:49,471 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:46:49,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:49,889 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:46:49,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49 WrapperNode [2019-09-10 06:46:49,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:46:49,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:46:49,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:46:49,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:46:49,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:49,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:49,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:49,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:49,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:50,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:50,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (1/1) ... [2019-09-10 06:46:50,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:46:50,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:46:50,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:46:50,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:46:50,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (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 06:46:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:46:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:46:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:46:50,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:46:50,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:46:50,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:46:50,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:46:50,153 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:46:50,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:46:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:46:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:46:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:46:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:46:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:46:50,155 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:46:50,155 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:46:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:46:50,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:46:50,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:46:52,314 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:46:52,315 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:46:52,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:52 BoogieIcfgContainer [2019-09-10 06:46:52,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:46:52,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:46:52,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:46:52,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:46:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:46:48" (1/3) ... [2019-09-10 06:46:52,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9a64aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:52, skipping insertion in model container [2019-09-10 06:46:52,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:49" (2/3) ... [2019-09-10 06:46:52,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9a64aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:52, skipping insertion in model container [2019-09-10 06:46:52,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:52" (3/3) ... [2019-09-10 06:46:52,326 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:46:52,338 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:46:52,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-10 06:46:52,385 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-10 06:46:52,415 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:46:52,415 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:46:52,415 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:46:52,415 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:46:52,416 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:46:52,416 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:46:52,416 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:46:52,416 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:46:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states. [2019-09-10 06:46:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:46:52,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:52,491 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 06:46:52,493 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash 769372493, now seen corresponding path program 1 times [2019-09-10 06:46:52,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:52,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:53,032 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 06:46:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:53,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:53,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:53,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:53,059 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 5 states. [2019-09-10 06:46:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:53,814 INFO L93 Difference]: Finished difference Result 500 states and 857 transitions. [2019-09-10 06:46:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:53,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 06:46:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:53,842 INFO L225 Difference]: With dead ends: 500 [2019-09-10 06:46:53,842 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 06:46:53,844 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 06:46:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 06:46:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 482. [2019-09-10 06:46:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-10 06:46:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2019-09-10 06:46:53,935 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 54 [2019-09-10 06:46:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:53,935 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2019-09-10 06:46:53,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2019-09-10 06:46:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:46:53,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:53,943 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 06:46:53,944 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 861483672, now seen corresponding path program 1 times [2019-09-10 06:46:53,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:53,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:53,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:53,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:54,089 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 06:46:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:54,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:54,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:54,093 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand 3 states. [2019-09-10 06:46:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:54,137 INFO L93 Difference]: Finished difference Result 661 states and 886 transitions. [2019-09-10 06:46:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:54,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:46:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:54,142 INFO L225 Difference]: With dead ends: 661 [2019-09-10 06:46:54,143 INFO L226 Difference]: Without dead ends: 661 [2019-09-10 06:46:54,143 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 06:46:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-10 06:46:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 653. [2019-09-10 06:46:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-10 06:46:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 880 transitions. [2019-09-10 06:46:54,181 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 880 transitions. Word has length 55 [2019-09-10 06:46:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:54,182 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 880 transitions. [2019-09-10 06:46:54,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 880 transitions. [2019-09-10 06:46:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:46:54,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:54,188 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 06:46:54,188 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash 481355333, now seen corresponding path program 1 times [2019-09-10 06:46:54,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:54,351 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 06:46:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:54,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:54,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:54,353 INFO L87 Difference]: Start difference. First operand 653 states and 880 transitions. Second operand 3 states. [2019-09-10 06:46:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:54,401 INFO L93 Difference]: Finished difference Result 917 states and 1256 transitions. [2019-09-10 06:46:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:54,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:46:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:54,407 INFO L225 Difference]: With dead ends: 917 [2019-09-10 06:46:54,407 INFO L226 Difference]: Without dead ends: 917 [2019-09-10 06:46:54,408 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 06:46:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-10 06:46:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 911. [2019-09-10 06:46:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-10 06:46:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1252 transitions. [2019-09-10 06:46:54,433 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1252 transitions. Word has length 55 [2019-09-10 06:46:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:54,434 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1252 transitions. [2019-09-10 06:46:54,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1252 transitions. [2019-09-10 06:46:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:46:54,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:54,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:54,437 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2053812510, now seen corresponding path program 1 times [2019-09-10 06:46:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:54,576 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 06:46:54,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:54,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:54,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:54,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:54,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:54,578 INFO L87 Difference]: Start difference. First operand 911 states and 1252 transitions. Second operand 6 states. [2019-09-10 06:46:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:55,061 INFO L93 Difference]: Finished difference Result 1492 states and 2109 transitions. [2019-09-10 06:46:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:55,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:46:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:55,070 INFO L225 Difference]: With dead ends: 1492 [2019-09-10 06:46:55,070 INFO L226 Difference]: Without dead ends: 1492 [2019-09-10 06:46:55,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-09-10 06:46:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1474. [2019-09-10 06:46:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-09-10 06:46:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2095 transitions. [2019-09-10 06:46:55,110 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2095 transitions. Word has length 55 [2019-09-10 06:46:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:55,111 INFO L475 AbstractCegarLoop]: Abstraction has 1474 states and 2095 transitions. [2019-09-10 06:46:55,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2095 transitions. [2019-09-10 06:46:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:46:55,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:55,118 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 06:46:55,119 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 287776612, now seen corresponding path program 1 times [2019-09-10 06:46:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:55,277 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 06:46:55,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:55,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:55,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:55,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:55,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:55,279 INFO L87 Difference]: Start difference. First operand 1474 states and 2095 transitions. Second operand 6 states. [2019-09-10 06:46:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:55,818 INFO L93 Difference]: Finished difference Result 3328 states and 4764 transitions. [2019-09-10 06:46:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:55,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:46:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:55,841 INFO L225 Difference]: With dead ends: 3328 [2019-09-10 06:46:55,842 INFO L226 Difference]: Without dead ends: 3328 [2019-09-10 06:46:55,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-09-10 06:46:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3313. [2019-09-10 06:46:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2019-09-10 06:46:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4753 transitions. [2019-09-10 06:46:55,956 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4753 transitions. Word has length 56 [2019-09-10 06:46:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:55,957 INFO L475 AbstractCegarLoop]: Abstraction has 3313 states and 4753 transitions. [2019-09-10 06:46:55,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4753 transitions. [2019-09-10 06:46:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:46:55,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:55,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:55,962 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash 393817543, now seen corresponding path program 1 times [2019-09-10 06:46:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:56,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:56,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:56,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:56,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:56,086 INFO L87 Difference]: Start difference. First operand 3313 states and 4753 transitions. Second operand 3 states. [2019-09-10 06:46:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:56,190 INFO L93 Difference]: Finished difference Result 4771 states and 6780 transitions. [2019-09-10 06:46:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:56,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:46:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:56,216 INFO L225 Difference]: With dead ends: 4771 [2019-09-10 06:46:56,216 INFO L226 Difference]: Without dead ends: 4771 [2019-09-10 06:46:56,217 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 06:46:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2019-09-10 06:46:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4734. [2019-09-10 06:46:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4734 states. [2019-09-10 06:46:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6745 transitions. [2019-09-10 06:46:56,373 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6745 transitions. Word has length 56 [2019-09-10 06:46:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:56,374 INFO L475 AbstractCegarLoop]: Abstraction has 4734 states and 6745 transitions. [2019-09-10 06:46:56,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6745 transitions. [2019-09-10 06:46:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:56,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:56,378 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 06:46:56,378 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1900631734, now seen corresponding path program 1 times [2019-09-10 06:46:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:56,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:56,482 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 06:46:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:56,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:56,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:56,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:56,484 INFO L87 Difference]: Start difference. First operand 4734 states and 6745 transitions. Second operand 7 states. [2019-09-10 06:46:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:57,346 INFO L93 Difference]: Finished difference Result 20571 states and 29695 transitions. [2019-09-10 06:46:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:57,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:46:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:57,480 INFO L225 Difference]: With dead ends: 20571 [2019-09-10 06:46:57,480 INFO L226 Difference]: Without dead ends: 20571 [2019-09-10 06:46:57,481 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 06:46:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20571 states. [2019-09-10 06:46:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20571 to 4768. [2019-09-10 06:46:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4768 states. [2019-09-10 06:46:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 6789 transitions. [2019-09-10 06:46:57,899 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 6789 transitions. Word has length 57 [2019-09-10 06:46:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:57,900 INFO L475 AbstractCegarLoop]: Abstraction has 4768 states and 6789 transitions. [2019-09-10 06:46:57,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:46:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 6789 transitions. [2019-09-10 06:46:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:57,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:57,904 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 06:46:57,904 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1596178184, now seen corresponding path program 1 times [2019-09-10 06:46:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:57,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:57,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:58,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:58,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:58,040 INFO L87 Difference]: Start difference. First operand 4768 states and 6789 transitions. Second operand 7 states. [2019-09-10 06:46:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:59,020 INFO L93 Difference]: Finished difference Result 15704 states and 22627 transitions. [2019-09-10 06:46:59,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:59,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:46:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:59,061 INFO L225 Difference]: With dead ends: 15704 [2019-09-10 06:46:59,061 INFO L226 Difference]: Without dead ends: 15704 [2019-09-10 06:46:59,062 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 06:46:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15704 states. [2019-09-10 06:46:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15704 to 4790. [2019-09-10 06:46:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-09-10 06:46:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 6820 transitions. [2019-09-10 06:46:59,255 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 6820 transitions. Word has length 57 [2019-09-10 06:46:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:59,256 INFO L475 AbstractCegarLoop]: Abstraction has 4790 states and 6820 transitions. [2019-09-10 06:46:59,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:46:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 6820 transitions. [2019-09-10 06:46:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:59,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:59,259 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 06:46:59,260 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash -728834285, now seen corresponding path program 1 times [2019-09-10 06:46:59,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:59,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:59,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:59,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:46:59,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:59,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:46:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:46:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:59,357 INFO L87 Difference]: Start difference. First operand 4790 states and 6820 transitions. Second operand 7 states. [2019-09-10 06:47:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:00,177 INFO L93 Difference]: Finished difference Result 13732 states and 19805 transitions. [2019-09-10 06:47:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:47:00,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:47:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:00,205 INFO L225 Difference]: With dead ends: 13732 [2019-09-10 06:47:00,205 INFO L226 Difference]: Without dead ends: 13732 [2019-09-10 06:47:00,205 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 06:47:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-09-10 06:47:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 4804. [2019-09-10 06:47:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-09-10 06:47:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6838 transitions. [2019-09-10 06:47:00,386 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6838 transitions. Word has length 57 [2019-09-10 06:47:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:00,387 INFO L475 AbstractCegarLoop]: Abstraction has 4804 states and 6838 transitions. [2019-09-10 06:47:00,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:47:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6838 transitions. [2019-09-10 06:47:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:47:00,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:00,391 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 06:47:00,391 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -400384619, now seen corresponding path program 1 times [2019-09-10 06:47:00,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:00,578 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 06:47:00,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:47:00,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:00,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:47:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:47:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:00,579 INFO L87 Difference]: Start difference. First operand 4804 states and 6838 transitions. Second operand 9 states. [2019-09-10 06:47:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:02,290 INFO L93 Difference]: Finished difference Result 17600 states and 25458 transitions. [2019-09-10 06:47:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:47:02,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:47:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:02,332 INFO L225 Difference]: With dead ends: 17600 [2019-09-10 06:47:02,333 INFO L226 Difference]: Without dead ends: 17600 [2019-09-10 06:47:02,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:47:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2019-09-10 06:47:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 4770. [2019-09-10 06:47:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2019-09-10 06:47:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6792 transitions. [2019-09-10 06:47:02,525 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6792 transitions. Word has length 58 [2019-09-10 06:47:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:02,526 INFO L475 AbstractCegarLoop]: Abstraction has 4770 states and 6792 transitions. [2019-09-10 06:47:02,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:47:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6792 transitions. [2019-09-10 06:47:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:47:02,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:02,529 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 06:47:02,530 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1454445203, now seen corresponding path program 1 times [2019-09-10 06:47:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:02,723 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 06:47:02,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:02,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:47:02,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:02,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:47:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:47:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:02,724 INFO L87 Difference]: Start difference. First operand 4770 states and 6792 transitions. Second operand 9 states. [2019-09-10 06:47:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:04,196 INFO L93 Difference]: Finished difference Result 10672 states and 15460 transitions. [2019-09-10 06:47:04,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:47:04,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 06:47:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:04,221 INFO L225 Difference]: With dead ends: 10672 [2019-09-10 06:47:04,221 INFO L226 Difference]: Without dead ends: 10672 [2019-09-10 06:47:04,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:47:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-09-10 06:47:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 4770. [2019-09-10 06:47:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2019-09-10 06:47:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6790 transitions. [2019-09-10 06:47:04,349 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6790 transitions. Word has length 58 [2019-09-10 06:47:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:04,350 INFO L475 AbstractCegarLoop]: Abstraction has 4770 states and 6790 transitions. [2019-09-10 06:47:04,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:47:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6790 transitions. [2019-09-10 06:47:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:47:04,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:04,354 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 06:47:04,355 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash -780512958, now seen corresponding path program 1 times [2019-09-10 06:47:04,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:04,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:04,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:04,533 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 06:47:04,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:04,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:47:04,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:04,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:47:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:47:04,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:47:04,535 INFO L87 Difference]: Start difference. First operand 4770 states and 6790 transitions. Second operand 8 states. [2019-09-10 06:47:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:05,695 INFO L93 Difference]: Finished difference Result 13583 states and 19793 transitions. [2019-09-10 06:47:05,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:47:05,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-10 06:47:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:05,712 INFO L225 Difference]: With dead ends: 13583 [2019-09-10 06:47:05,713 INFO L226 Difference]: Without dead ends: 13583 [2019-09-10 06:47:05,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:47:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13583 states. [2019-09-10 06:47:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13583 to 4605. [2019-09-10 06:47:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-10 06:47:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6568 transitions. [2019-09-10 06:47:05,839 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6568 transitions. Word has length 58 [2019-09-10 06:47:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:05,839 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6568 transitions. [2019-09-10 06:47:05,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:47:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6568 transitions. [2019-09-10 06:47:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:47:05,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:05,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:05,844 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400580, now seen corresponding path program 1 times [2019-09-10 06:47:05,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:05,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:05,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:05,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:05,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:05,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:05,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:05,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:05,935 INFO L87 Difference]: Start difference. First operand 4605 states and 6568 transitions. Second operand 3 states. [2019-09-10 06:47:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:05,973 INFO L93 Difference]: Finished difference Result 4611 states and 6502 transitions. [2019-09-10 06:47:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:05,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:47:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:05,981 INFO L225 Difference]: With dead ends: 4611 [2019-09-10 06:47:05,981 INFO L226 Difference]: Without dead ends: 4611 [2019-09-10 06:47:05,981 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 06:47:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-09-10 06:47:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4605. [2019-09-10 06:47:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-10 06:47:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6498 transitions. [2019-09-10 06:47:06,041 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6498 transitions. Word has length 59 [2019-09-10 06:47:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,042 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6498 transitions. [2019-09-10 06:47:06,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6498 transitions. [2019-09-10 06:47:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:47:06,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:06,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1203643884, now seen corresponding path program 1 times [2019-09-10 06:47:06,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:06,138 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 06:47:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:06,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:06,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:06,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:06,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,140 INFO L87 Difference]: Start difference. First operand 4605 states and 6498 transitions. Second operand 3 states. [2019-09-10 06:47:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:06,214 INFO L93 Difference]: Finished difference Result 4612 states and 6428 transitions. [2019-09-10 06:47:06,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:06,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:47:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:06,223 INFO L225 Difference]: With dead ends: 4612 [2019-09-10 06:47:06,223 INFO L226 Difference]: Without dead ends: 4612 [2019-09-10 06:47:06,224 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 06:47:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2019-09-10 06:47:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4605. [2019-09-10 06:47:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-10 06:47:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6423 transitions. [2019-09-10 06:47:06,296 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6423 transitions. Word has length 59 [2019-09-10 06:47:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,296 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6423 transitions. [2019-09-10 06:47:06,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6423 transitions. [2019-09-10 06:47:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:47:06,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,299 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 06:47:06,300 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 776650189, now seen corresponding path program 1 times [2019-09-10 06:47:06,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:06,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:06,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:06,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:06,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,373 INFO L87 Difference]: Start difference. First operand 4605 states and 6423 transitions. Second operand 3 states. [2019-09-10 06:47:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:06,412 INFO L93 Difference]: Finished difference Result 4571 states and 6282 transitions. [2019-09-10 06:47:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:06,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:47:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:06,418 INFO L225 Difference]: With dead ends: 4571 [2019-09-10 06:47:06,419 INFO L226 Difference]: Without dead ends: 4571 [2019-09-10 06:47:06,421 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 06:47:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2019-09-10 06:47:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4565. [2019-09-10 06:47:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-09-10 06:47:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6278 transitions. [2019-09-10 06:47:06,475 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6278 transitions. Word has length 59 [2019-09-10 06:47:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,476 INFO L475 AbstractCegarLoop]: Abstraction has 4565 states and 6278 transitions. [2019-09-10 06:47:06,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6278 transitions. [2019-09-10 06:47:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:47:06,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,479 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 06:47:06,480 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1527639271, now seen corresponding path program 1 times [2019-09-10 06:47:06,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:06,543 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 06:47:06,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:06,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:06,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:06,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:06,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,548 INFO L87 Difference]: Start difference. First operand 4565 states and 6278 transitions. Second operand 3 states. [2019-09-10 06:47:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:06,638 INFO L93 Difference]: Finished difference Result 5704 states and 7874 transitions. [2019-09-10 06:47:06,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:06,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:47:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:06,646 INFO L225 Difference]: With dead ends: 5704 [2019-09-10 06:47:06,646 INFO L226 Difference]: Without dead ends: 5704 [2019-09-10 06:47:06,647 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 06:47:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2019-09-10 06:47:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 4184. [2019-09-10 06:47:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2019-09-10 06:47:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 5772 transitions. [2019-09-10 06:47:06,773 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 5772 transitions. Word has length 60 [2019-09-10 06:47:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,773 INFO L475 AbstractCegarLoop]: Abstraction has 4184 states and 5772 transitions. [2019-09-10 06:47:06,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 5772 transitions. [2019-09-10 06:47:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:06,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,777 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 06:47:06,777 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -306322079, now seen corresponding path program 1 times [2019-09-10 06:47:06,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:06,839 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 06:47:06,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:06,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:06,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:06,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:06,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,840 INFO L87 Difference]: Start difference. First operand 4184 states and 5772 transitions. Second operand 3 states. [2019-09-10 06:47:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:06,903 INFO L93 Difference]: Finished difference Result 5860 states and 8164 transitions. [2019-09-10 06:47:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:06,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:47:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:06,911 INFO L225 Difference]: With dead ends: 5860 [2019-09-10 06:47:06,911 INFO L226 Difference]: Without dead ends: 5860 [2019-09-10 06:47:06,912 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 06:47:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-09-10 06:47:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 4123. [2019-09-10 06:47:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2019-09-10 06:47:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5685 transitions. [2019-09-10 06:47:06,977 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5685 transitions. Word has length 61 [2019-09-10 06:47:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,977 INFO L475 AbstractCegarLoop]: Abstraction has 4123 states and 5685 transitions. [2019-09-10 06:47:06,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5685 transitions. [2019-09-10 06:47:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:06,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,981 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 06:47:06,981 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1076067543, now seen corresponding path program 1 times [2019-09-10 06:47:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:07,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:07,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:07,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:07,067 INFO L87 Difference]: Start difference. First operand 4123 states and 5685 transitions. Second operand 3 states. [2019-09-10 06:47:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:07,172 INFO L93 Difference]: Finished difference Result 5775 states and 8040 transitions. [2019-09-10 06:47:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:07,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:47:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:07,185 INFO L225 Difference]: With dead ends: 5775 [2019-09-10 06:47:07,185 INFO L226 Difference]: Without dead ends: 5775 [2019-09-10 06:47:07,186 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 06:47:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-09-10 06:47:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4036. [2019-09-10 06:47:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-09-10 06:47:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5568 transitions. [2019-09-10 06:47:07,247 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5568 transitions. Word has length 61 [2019-09-10 06:47:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:07,247 INFO L475 AbstractCegarLoop]: Abstraction has 4036 states and 5568 transitions. [2019-09-10 06:47:07,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5568 transitions. [2019-09-10 06:47:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:07,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:07,251 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 06:47:07,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -69771348, now seen corresponding path program 1 times [2019-09-10 06:47:07,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:07,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:07,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:07,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 06:47:07,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:47:07,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:07,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:47:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:47:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:47:07,841 INFO L87 Difference]: Start difference. First operand 4036 states and 5568 transitions. Second operand 13 states. [2019-09-10 06:47:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:09,433 INFO L93 Difference]: Finished difference Result 5370 states and 7444 transitions. [2019-09-10 06:47:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:47:09,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 06:47:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:09,441 INFO L225 Difference]: With dead ends: 5370 [2019-09-10 06:47:09,442 INFO L226 Difference]: Without dead ends: 5370 [2019-09-10 06:47:09,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:47:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-09-10 06:47:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 4032. [2019-09-10 06:47:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-09-10 06:47:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5564 transitions. [2019-09-10 06:47:09,550 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5564 transitions. Word has length 61 [2019-09-10 06:47:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:09,551 INFO L475 AbstractCegarLoop]: Abstraction has 4032 states and 5564 transitions. [2019-09-10 06:47:09,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:47:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5564 transitions. [2019-09-10 06:47:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:09,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:09,554 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 06:47:09,554 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:09,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1711838127, now seen corresponding path program 1 times [2019-09-10 06:47:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:10,044 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 06:47:10,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:47:10,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:10,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:47:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:47:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:47:10,046 INFO L87 Difference]: Start difference. First operand 4032 states and 5564 transitions. Second operand 12 states. [2019-09-10 06:47:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:11,264 INFO L93 Difference]: Finished difference Result 7468 states and 10417 transitions. [2019-09-10 06:47:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:47:11,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 06:47:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:11,272 INFO L225 Difference]: With dead ends: 7468 [2019-09-10 06:47:11,273 INFO L226 Difference]: Without dead ends: 7468 [2019-09-10 06:47:11,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:47:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2019-09-10 06:47:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 4031. [2019-09-10 06:47:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-10 06:47:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5562 transitions. [2019-09-10 06:47:11,332 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5562 transitions. Word has length 61 [2019-09-10 06:47:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:11,333 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5562 transitions. [2019-09-10 06:47:11,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:47:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5562 transitions. [2019-09-10 06:47:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:11,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:11,335 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 06:47:11,336 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1267518257, now seen corresponding path program 1 times [2019-09-10 06:47:11,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:11,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:47:12,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:12,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:47:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:47:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:47:12,226 INFO L87 Difference]: Start difference. First operand 4031 states and 5562 transitions. Second operand 16 states. [2019-09-10 06:47:12,397 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-09-10 06:47:12,847 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:47:13,055 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:47:13,241 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 06:47:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:14,925 INFO L93 Difference]: Finished difference Result 7723 states and 10788 transitions. [2019-09-10 06:47:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:47:14,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-09-10 06:47:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:14,934 INFO L225 Difference]: With dead ends: 7723 [2019-09-10 06:47:14,934 INFO L226 Difference]: Without dead ends: 7723 [2019-09-10 06:47:14,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:47:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2019-09-10 06:47:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 4031. [2019-09-10 06:47:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-10 06:47:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5561 transitions. [2019-09-10 06:47:15,003 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5561 transitions. Word has length 61 [2019-09-10 06:47:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:15,003 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5561 transitions. [2019-09-10 06:47:15,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:47:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5561 transitions. [2019-09-10 06:47:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:47:15,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:15,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:15,006 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1890999092, now seen corresponding path program 1 times [2019-09-10 06:47:15,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:15,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:15,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:15,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:15,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:15,548 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 06:47:15,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:15,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:47:15,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:15,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:47:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:47:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:47:15,550 INFO L87 Difference]: Start difference. First operand 4031 states and 5561 transitions. Second operand 14 states. [2019-09-10 06:47:16,152 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:47:16,382 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 06:47:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:18,900 INFO L93 Difference]: Finished difference Result 14304 states and 20056 transitions. [2019-09-10 06:47:18,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:47:18,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-10 06:47:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:18,919 INFO L225 Difference]: With dead ends: 14304 [2019-09-10 06:47:18,919 INFO L226 Difference]: Without dead ends: 14304 [2019-09-10 06:47:18,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:47:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14304 states. [2019-09-10 06:47:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14304 to 4003. [2019-09-10 06:47:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4003 states. [2019-09-10 06:47:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5529 transitions. [2019-09-10 06:47:18,991 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5529 transitions. Word has length 61 [2019-09-10 06:47:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:18,991 INFO L475 AbstractCegarLoop]: Abstraction has 4003 states and 5529 transitions. [2019-09-10 06:47:18,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:47:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5529 transitions. [2019-09-10 06:47:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:47:18,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:18,994 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 06:47:18,994 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -171028691, now seen corresponding path program 1 times [2019-09-10 06:47:18,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:18,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:19,395 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 06:47:19,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:19,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:47:19,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:19,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:47:19,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:47:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:47:19,397 INFO L87 Difference]: Start difference. First operand 4003 states and 5529 transitions. Second operand 11 states. [2019-09-10 06:47:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:20,857 INFO L93 Difference]: Finished difference Result 7370 states and 10291 transitions. [2019-09-10 06:47:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:47:20,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-10 06:47:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:20,866 INFO L225 Difference]: With dead ends: 7370 [2019-09-10 06:47:20,866 INFO L226 Difference]: Without dead ends: 7370 [2019-09-10 06:47:20,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:47:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2019-09-10 06:47:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 3999. [2019-09-10 06:47:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-09-10 06:47:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5525 transitions. [2019-09-10 06:47:20,917 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5525 transitions. Word has length 62 [2019-09-10 06:47:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:20,918 INFO L475 AbstractCegarLoop]: Abstraction has 3999 states and 5525 transitions. [2019-09-10 06:47:20,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:47:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5525 transitions. [2019-09-10 06:47:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:47:20,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:20,922 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] [2019-09-10 06:47:20,922 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1643195361, now seen corresponding path program 1 times [2019-09-10 06:47:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:20,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:21,007 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 06:47:21,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:21,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:47:21,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:21,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:47:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:47:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:47:21,012 INFO L87 Difference]: Start difference. First operand 3999 states and 5525 transitions. Second operand 6 states. [2019-09-10 06:47:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:21,173 INFO L93 Difference]: Finished difference Result 12360 states and 17018 transitions. [2019-09-10 06:47:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:47:21,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:47:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:21,187 INFO L225 Difference]: With dead ends: 12360 [2019-09-10 06:47:21,187 INFO L226 Difference]: Without dead ends: 12360 [2019-09-10 06:47:21,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:47:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12360 states. [2019-09-10 06:47:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12360 to 9909. [2019-09-10 06:47:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9909 states. [2019-09-10 06:47:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9909 states to 9909 states and 13634 transitions. [2019-09-10 06:47:21,283 INFO L78 Accepts]: Start accepts. Automaton has 9909 states and 13634 transitions. Word has length 70 [2019-09-10 06:47:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:21,283 INFO L475 AbstractCegarLoop]: Abstraction has 9909 states and 13634 transitions. [2019-09-10 06:47:21,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:47:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9909 states and 13634 transitions. [2019-09-10 06:47:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:47:21,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:21,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:21,289 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2116581710, now seen corresponding path program 1 times [2019-09-10 06:47:21,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:21,379 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 06:47:21,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:21,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:21,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:21,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:21,382 INFO L87 Difference]: Start difference. First operand 9909 states and 13634 transitions. Second operand 5 states. [2019-09-10 06:47:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:21,516 INFO L93 Difference]: Finished difference Result 9093 states and 12535 transitions. [2019-09-10 06:47:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:21,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:47:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:21,527 INFO L225 Difference]: With dead ends: 9093 [2019-09-10 06:47:21,527 INFO L226 Difference]: Without dead ends: 9093 [2019-09-10 06:47:21,528 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 06:47:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9093 states. [2019-09-10 06:47:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9093 to 9089. [2019-09-10 06:47:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9089 states. [2019-09-10 06:47:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9089 states to 9089 states and 12533 transitions. [2019-09-10 06:47:21,623 INFO L78 Accepts]: Start accepts. Automaton has 9089 states and 12533 transitions. Word has length 71 [2019-09-10 06:47:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:21,624 INFO L475 AbstractCegarLoop]: Abstraction has 9089 states and 12533 transitions. [2019-09-10 06:47:21,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9089 states and 12533 transitions. [2019-09-10 06:47:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:47:21,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:21,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:21,629 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1570673773, now seen corresponding path program 1 times [2019-09-10 06:47:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:21,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:21,726 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 06:47:21,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:21,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:47:21,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:21,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:47:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:47:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:47:21,729 INFO L87 Difference]: Start difference. First operand 9089 states and 12533 transitions. Second operand 6 states. [2019-09-10 06:47:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:21,843 INFO L93 Difference]: Finished difference Result 16671 states and 22578 transitions. [2019-09-10 06:47:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:21,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:47:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:21,859 INFO L225 Difference]: With dead ends: 16671 [2019-09-10 06:47:21,859 INFO L226 Difference]: Without dead ends: 16671 [2019-09-10 06:47:21,859 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 06:47:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16671 states. [2019-09-10 06:47:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16671 to 9314. [2019-09-10 06:47:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9314 states. [2019-09-10 06:47:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 12683 transitions. [2019-09-10 06:47:22,082 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 12683 transitions. Word has length 72 [2019-09-10 06:47:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:22,082 INFO L475 AbstractCegarLoop]: Abstraction has 9314 states and 12683 transitions. [2019-09-10 06:47:22,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:47:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 12683 transitions. [2019-09-10 06:47:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:47:22,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:22,086 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] [2019-09-10 06:47:22,086 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash -274929820, now seen corresponding path program 1 times [2019-09-10 06:47:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:22,151 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 06:47:22,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:22,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:22,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:22,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:22,152 INFO L87 Difference]: Start difference. First operand 9314 states and 12683 transitions. Second operand 3 states. [2019-09-10 06:47:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:22,246 INFO L93 Difference]: Finished difference Result 15996 states and 21440 transitions. [2019-09-10 06:47:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:22,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:47:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:22,269 INFO L225 Difference]: With dead ends: 15996 [2019-09-10 06:47:22,270 INFO L226 Difference]: Without dead ends: 15996 [2019-09-10 06:47:22,270 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 06:47:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15996 states. [2019-09-10 06:47:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15996 to 15799. [2019-09-10 06:47:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15799 states. [2019-09-10 06:47:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15799 states to 15799 states and 21244 transitions. [2019-09-10 06:47:22,475 INFO L78 Accepts]: Start accepts. Automaton has 15799 states and 21244 transitions. Word has length 73 [2019-09-10 06:47:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:22,475 INFO L475 AbstractCegarLoop]: Abstraction has 15799 states and 21244 transitions. [2019-09-10 06:47:22,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15799 states and 21244 transitions. [2019-09-10 06:47:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:47:22,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:22,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:22,484 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash 61383844, now seen corresponding path program 1 times [2019-09-10 06:47:22,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:22,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:22,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:22,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:22,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:22,545 INFO L87 Difference]: Start difference. First operand 15799 states and 21244 transitions. Second operand 5 states. [2019-09-10 06:47:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:22,966 INFO L93 Difference]: Finished difference Result 46167 states and 60699 transitions. [2019-09-10 06:47:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:22,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:47:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:23,011 INFO L225 Difference]: With dead ends: 46167 [2019-09-10 06:47:23,011 INFO L226 Difference]: Without dead ends: 46167 [2019-09-10 06:47:23,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46167 states. [2019-09-10 06:47:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46167 to 24454. [2019-09-10 06:47:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24454 states. [2019-09-10 06:47:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 32517 transitions. [2019-09-10 06:47:23,298 INFO L78 Accepts]: Start accepts. Automaton has 24454 states and 32517 transitions. Word has length 74 [2019-09-10 06:47:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:23,298 INFO L475 AbstractCegarLoop]: Abstraction has 24454 states and 32517 transitions. [2019-09-10 06:47:23,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 24454 states and 32517 transitions. [2019-09-10 06:47:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:47:23,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:23,303 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] [2019-09-10 06:47:23,304 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668181, now seen corresponding path program 1 times [2019-09-10 06:47:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:23,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:23,365 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 06:47:23,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:23,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:23,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:23,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:23,366 INFO L87 Difference]: Start difference. First operand 24454 states and 32517 transitions. Second operand 3 states. [2019-09-10 06:47:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:24,110 INFO L93 Difference]: Finished difference Result 45863 states and 60111 transitions. [2019-09-10 06:47:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:24,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:47:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:24,159 INFO L225 Difference]: With dead ends: 45863 [2019-09-10 06:47:24,159 INFO L226 Difference]: Without dead ends: 45863 [2019-09-10 06:47:24,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45863 states. [2019-09-10 06:47:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45863 to 43004. [2019-09-10 06:47:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43004 states. [2019-09-10 06:47:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43004 states to 43004 states and 56655 transitions. [2019-09-10 06:47:24,487 INFO L78 Accepts]: Start accepts. Automaton has 43004 states and 56655 transitions. Word has length 74 [2019-09-10 06:47:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:24,487 INFO L475 AbstractCegarLoop]: Abstraction has 43004 states and 56655 transitions. [2019-09-10 06:47:24,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 43004 states and 56655 transitions. [2019-09-10 06:47:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:47:24,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:24,491 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] [2019-09-10 06:47:24,492 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash -790939587, now seen corresponding path program 1 times [2019-09-10 06:47:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:24,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:24,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:24,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:24,540 INFO L87 Difference]: Start difference. First operand 43004 states and 56655 transitions. Second operand 3 states. [2019-09-10 06:47:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:24,657 INFO L93 Difference]: Finished difference Result 43572 states and 56064 transitions. [2019-09-10 06:47:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:24,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:47:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:24,700 INFO L225 Difference]: With dead ends: 43572 [2019-09-10 06:47:24,700 INFO L226 Difference]: Without dead ends: 43572 [2019-09-10 06:47:24,701 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 06:47:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43572 states. [2019-09-10 06:47:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43572 to 43030. [2019-09-10 06:47:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43030 states. [2019-09-10 06:47:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43030 states to 43030 states and 55523 transitions. [2019-09-10 06:47:25,968 INFO L78 Accepts]: Start accepts. Automaton has 43030 states and 55523 transitions. Word has length 75 [2019-09-10 06:47:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:25,968 INFO L475 AbstractCegarLoop]: Abstraction has 43030 states and 55523 transitions. [2019-09-10 06:47:25,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43030 states and 55523 transitions. [2019-09-10 06:47:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:47:25,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:25,977 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] [2019-09-10 06:47:25,977 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash -424988470, now seen corresponding path program 1 times [2019-09-10 06:47:25,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:25,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:25,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:26,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:26,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:26,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:26,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:26,041 INFO L87 Difference]: Start difference. First operand 43030 states and 55523 transitions. Second operand 3 states. [2019-09-10 06:47:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:26,297 INFO L93 Difference]: Finished difference Result 80237 states and 100913 transitions. [2019-09-10 06:47:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:26,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:47:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:26,393 INFO L225 Difference]: With dead ends: 80237 [2019-09-10 06:47:26,393 INFO L226 Difference]: Without dead ends: 80237 [2019-09-10 06:47:26,394 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 06:47:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80237 states. [2019-09-10 06:47:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80237 to 69047. [2019-09-10 06:47:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69047 states. [2019-09-10 06:47:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69047 states to 69047 states and 88056 transitions. [2019-09-10 06:47:27,354 INFO L78 Accepts]: Start accepts. Automaton has 69047 states and 88056 transitions. Word has length 93 [2019-09-10 06:47:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:27,354 INFO L475 AbstractCegarLoop]: Abstraction has 69047 states and 88056 transitions. [2019-09-10 06:47:27,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69047 states and 88056 transitions. [2019-09-10 06:47:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:47:27,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:27,364 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:27,364 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash 551342129, now seen corresponding path program 1 times [2019-09-10 06:47:27,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:27,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:27,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:27,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:27,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-10 06:47:27,572 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [127], [130], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [510], [571], [701], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:47:27,611 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:27,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:27,754 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:28,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:28,339 INFO L272 AbstractInterpreter]: Visited 90 different actions 364 times. Merged at 33 different actions 243 times. Widened at 12 different actions 36 times. Performed 1438 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1438 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 8 different actions. Largest state had 220 variables. [2019-09-10 06:47:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:28,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:28,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:28,348 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 06:47:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:28,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:28,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:47:28,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:29,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:29,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:29,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:29,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2019-09-10 06:47:29,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:29,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:47:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:47:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:47:29,285 INFO L87 Difference]: Start difference. First operand 69047 states and 88056 transitions. Second operand 18 states. [2019-09-10 06:47:33,639 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-10 06:47:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:34,546 INFO L93 Difference]: Finished difference Result 220964 states and 278462 transitions. [2019-09-10 06:47:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 06:47:34,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-09-10 06:47:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:35,436 INFO L225 Difference]: With dead ends: 220964 [2019-09-10 06:47:35,437 INFO L226 Difference]: Without dead ends: 220964 [2019-09-10 06:47:35,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1134, Invalid=3156, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:47:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220964 states. [2019-09-10 06:47:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220964 to 99384. [2019-09-10 06:47:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99384 states. [2019-09-10 06:47:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99384 states to 99384 states and 126828 transitions. [2019-09-10 06:47:39,952 INFO L78 Accepts]: Start accepts. Automaton has 99384 states and 126828 transitions. Word has length 96 [2019-09-10 06:47:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:39,953 INFO L475 AbstractCegarLoop]: Abstraction has 99384 states and 126828 transitions. [2019-09-10 06:47:39,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:47:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 99384 states and 126828 transitions. [2019-09-10 06:47:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:47:39,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:39,983 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:39,984 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash -777403506, now seen corresponding path program 1 times [2019-09-10 06:47:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:39,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:47:40,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:40,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:47:40,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:40,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:47:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:47:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:40,133 INFO L87 Difference]: Start difference. First operand 99384 states and 126828 transitions. Second operand 9 states. [2019-09-10 06:47:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:42,274 INFO L93 Difference]: Finished difference Result 337099 states and 431585 transitions. [2019-09-10 06:47:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:47:42,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 06:47:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:42,784 INFO L225 Difference]: With dead ends: 337099 [2019-09-10 06:47:42,784 INFO L226 Difference]: Without dead ends: 337099 [2019-09-10 06:47:42,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:47:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337099 states. [2019-09-10 06:47:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337099 to 99318. [2019-09-10 06:47:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99318 states. [2019-09-10 06:47:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99318 states to 99318 states and 126754 transitions. [2019-09-10 06:47:48,798 INFO L78 Accepts]: Start accepts. Automaton has 99318 states and 126754 transitions. Word has length 96 [2019-09-10 06:47:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:48,798 INFO L475 AbstractCegarLoop]: Abstraction has 99318 states and 126754 transitions. [2019-09-10 06:47:48,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:47:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 99318 states and 126754 transitions. [2019-09-10 06:47:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:47:48,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:48,807 INFO L399 BasicCegarLoop]: trace histogram [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 06:47:48,807 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -370268567, now seen corresponding path program 1 times [2019-09-10 06:47:48,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:48,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:48,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:49,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:49,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:49,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:49,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:49,019 INFO L87 Difference]: Start difference. First operand 99318 states and 126754 transitions. Second operand 10 states. [2019-09-10 06:47:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:52,014 INFO L93 Difference]: Finished difference Result 320857 states and 406042 transitions. [2019-09-10 06:47:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:47:52,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 06:47:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:52,436 INFO L225 Difference]: With dead ends: 320857 [2019-09-10 06:47:52,437 INFO L226 Difference]: Without dead ends: 320857 [2019-09-10 06:47:52,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:47:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320857 states. [2019-09-10 06:47:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320857 to 132004. [2019-09-10 06:47:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132004 states. [2019-09-10 06:47:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132004 states to 132004 states and 168342 transitions. [2019-09-10 06:47:55,061 INFO L78 Accepts]: Start accepts. Automaton has 132004 states and 168342 transitions. Word has length 97 [2019-09-10 06:47:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:55,061 INFO L475 AbstractCegarLoop]: Abstraction has 132004 states and 168342 transitions. [2019-09-10 06:47:55,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:47:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 132004 states and 168342 transitions. [2019-09-10 06:47:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:47:55,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:55,070 INFO L399 BasicCegarLoop]: trace histogram [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 06:47:55,071 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash -316974870, now seen corresponding path program 1 times [2019-09-10 06:47:55,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:55,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:47:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:55,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:55,128 INFO L87 Difference]: Start difference. First operand 132004 states and 168342 transitions. Second operand 3 states. [2019-09-10 06:47:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:55,452 INFO L93 Difference]: Finished difference Result 119595 states and 151475 transitions. [2019-09-10 06:47:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:55,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:47:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:55,569 INFO L225 Difference]: With dead ends: 119595 [2019-09-10 06:47:55,569 INFO L226 Difference]: Without dead ends: 119595 [2019-09-10 06:47:55,570 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 06:47:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119595 states. [2019-09-10 06:47:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119595 to 119595. [2019-09-10 06:47:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119595 states. [2019-09-10 06:47:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119595 states to 119595 states and 151475 transitions. [2019-09-10 06:47:57,011 INFO L78 Accepts]: Start accepts. Automaton has 119595 states and 151475 transitions. Word has length 97 [2019-09-10 06:47:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:57,012 INFO L475 AbstractCegarLoop]: Abstraction has 119595 states and 151475 transitions. [2019-09-10 06:47:57,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 119595 states and 151475 transitions. [2019-09-10 06:47:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:47:57,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:57,019 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] [2019-09-10 06:47:57,020 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 850756577, now seen corresponding path program 1 times [2019-09-10 06:47:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:57,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:57,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:57,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:57,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:57,076 INFO L87 Difference]: Start difference. First operand 119595 states and 151475 transitions. Second operand 3 states. [2019-09-10 06:47:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:57,336 INFO L93 Difference]: Finished difference Result 119597 states and 149142 transitions. [2019-09-10 06:47:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:57,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:47:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:57,468 INFO L225 Difference]: With dead ends: 119597 [2019-09-10 06:47:57,469 INFO L226 Difference]: Without dead ends: 119597 [2019-09-10 06:47:57,469 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 06:47:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119597 states. [2019-09-10 06:47:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119597 to 117513. [2019-09-10 06:47:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117513 states. [2019-09-10 06:47:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117513 states to 117513 states and 146611 transitions. [2019-09-10 06:47:58,908 INFO L78 Accepts]: Start accepts. Automaton has 117513 states and 146611 transitions. Word has length 97 [2019-09-10 06:47:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:58,909 INFO L475 AbstractCegarLoop]: Abstraction has 117513 states and 146611 transitions. [2019-09-10 06:47:58,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117513 states and 146611 transitions. [2019-09-10 06:47:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:47:58,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:58,917 INFO L399 BasicCegarLoop]: trace histogram [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 06:47:58,917 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1983209285, now seen corresponding path program 1 times [2019-09-10 06:47:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:58,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:47:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:47:59,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:59,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:47:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:47:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:59,058 INFO L87 Difference]: Start difference. First operand 117513 states and 146611 transitions. Second operand 9 states. [2019-09-10 06:48:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:00,812 INFO L93 Difference]: Finished difference Result 334357 states and 416246 transitions. [2019-09-10 06:48:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:48:00,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 06:48:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:01,214 INFO L225 Difference]: With dead ends: 334357 [2019-09-10 06:48:01,215 INFO L226 Difference]: Without dead ends: 334357 [2019-09-10 06:48:01,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:48:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334357 states. [2019-09-10 06:48:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334357 to 117463. [2019-09-10 06:48:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117463 states. [2019-09-10 06:48:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117463 states to 117463 states and 146552 transitions. [2019-09-10 06:48:04,773 INFO L78 Accepts]: Start accepts. Automaton has 117463 states and 146552 transitions. Word has length 97 [2019-09-10 06:48:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:04,774 INFO L475 AbstractCegarLoop]: Abstraction has 117463 states and 146552 transitions. [2019-09-10 06:48:04,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:48:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 117463 states and 146552 transitions. [2019-09-10 06:48:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:48:04,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:04,781 INFO L399 BasicCegarLoop]: trace histogram [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 06:48:04,781 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 143013179, now seen corresponding path program 1 times [2019-09-10 06:48:04,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:04,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:04,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:04,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:04,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:48:04,987 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [701], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:48:05,000 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:05,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:05,061 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:05,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:05,390 INFO L272 AbstractInterpreter]: Visited 91 different actions 352 times. Merged at 31 different actions 229 times. Widened at 10 different actions 25 times. Performed 1392 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 9 different actions. Largest state had 220 variables. [2019-09-10 06:48:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:05,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:05,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:05,391 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 06:48:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:05,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:05,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:48:05,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:05,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:06,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:06,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:06,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:06,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:06,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:48:06,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 06:48:06,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:06,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:48:06,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:48:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:48:06,711 INFO L87 Difference]: Start difference. First operand 117463 states and 146552 transitions. Second operand 18 states. [2019-09-10 06:48:07,215 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:48:09,258 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:48:10,631 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-10 06:48:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:13,457 INFO L93 Difference]: Finished difference Result 376863 states and 468365 transitions. [2019-09-10 06:48:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:48:13,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-10 06:48:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:13,884 INFO L225 Difference]: With dead ends: 376863 [2019-09-10 06:48:13,885 INFO L226 Difference]: Without dead ends: 376863 [2019-09-10 06:48:13,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=439, Invalid=1631, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:48:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376863 states. [2019-09-10 06:48:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376863 to 119555. [2019-09-10 06:48:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119555 states. [2019-09-10 06:48:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119555 states to 119555 states and 149054 transitions. [2019-09-10 06:48:19,449 INFO L78 Accepts]: Start accepts. Automaton has 119555 states and 149054 transitions. Word has length 97 [2019-09-10 06:48:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:19,449 INFO L475 AbstractCegarLoop]: Abstraction has 119555 states and 149054 transitions. [2019-09-10 06:48:19,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:48:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 119555 states and 149054 transitions. [2019-09-10 06:48:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:19,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:19,460 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:19,460 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -96634223, now seen corresponding path program 1 times [2019-09-10 06:48:19,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:19,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:48:19,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:19,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:19,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:19,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:19,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:19,523 INFO L87 Difference]: Start difference. First operand 119555 states and 149054 transitions. Second operand 3 states. [2019-09-10 06:48:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:19,896 INFO L93 Difference]: Finished difference Result 114031 states and 141245 transitions. [2019-09-10 06:48:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:19,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:48:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:20,018 INFO L225 Difference]: With dead ends: 114031 [2019-09-10 06:48:20,018 INFO L226 Difference]: Without dead ends: 114031 [2019-09-10 06:48:20,018 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 06:48:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114031 states. [2019-09-10 06:48:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114031 to 113973. [2019-09-10 06:48:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113973 states. [2019-09-10 06:48:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113973 states to 113973 states and 141187 transitions. [2019-09-10 06:48:20,948 INFO L78 Accepts]: Start accepts. Automaton has 113973 states and 141187 transitions. Word has length 98 [2019-09-10 06:48:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:20,948 INFO L475 AbstractCegarLoop]: Abstraction has 113973 states and 141187 transitions. [2019-09-10 06:48:20,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113973 states and 141187 transitions. [2019-09-10 06:48:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:20,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:20,955 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:20,955 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 34786608, now seen corresponding path program 1 times [2019-09-10 06:48:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:20,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:20,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:21,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:21,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:21,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:48:21,082 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [317], [322], [335], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [458], [466], [485], [510], [571], [699], [1395], [1409], [1413], [1591], [1689], [1693], [1696], [1699], [1702], [1705], [1708], [1712], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:48:21,090 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:21,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:21,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:21,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:21,328 INFO L272 AbstractInterpreter]: Visited 92 different actions 272 times. Merged at 34 different actions 163 times. Widened at 8 different actions 16 times. Performed 1133 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1133 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 220 variables. [2019-09-10 06:48:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:21,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:21,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:48:21,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:22,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:48:22,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:22,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:48:22,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:48:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:48:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-09-10 06:48:22,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:22,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:48:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:48:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:48:22,840 INFO L87 Difference]: Start difference. First operand 113973 states and 141187 transitions. Second operand 9 states. [2019-09-10 06:48:23,501 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:48:23,693 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:48:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:24,566 INFO L93 Difference]: Finished difference Result 172892 states and 213778 transitions. [2019-09-10 06:48:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:48:24,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 06:48:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:24,761 INFO L225 Difference]: With dead ends: 172892 [2019-09-10 06:48:24,761 INFO L226 Difference]: Without dead ends: 172892 [2019-09-10 06:48:24,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:48:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172892 states. [2019-09-10 06:48:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172892 to 136561. [2019-09-10 06:48:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136561 states. [2019-09-10 06:48:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136561 states to 136561 states and 169063 transitions. [2019-09-10 06:48:29,140 INFO L78 Accepts]: Start accepts. Automaton has 136561 states and 169063 transitions. Word has length 98 [2019-09-10 06:48:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:29,141 INFO L475 AbstractCegarLoop]: Abstraction has 136561 states and 169063 transitions. [2019-09-10 06:48:29,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:48:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 136561 states and 169063 transitions. [2019-09-10 06:48:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:29,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:29,147 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:29,148 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1217835554, now seen corresponding path program 1 times [2019-09-10 06:48:29,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:29,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:29,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:29,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:29,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:29,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:48:29,287 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [127], [130], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [333], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [508], [571], [701], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1464], [1492], [1495], [1498], [1502], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:48:29,289 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:29,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:29,330 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:29,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:29,697 INFO L272 AbstractInterpreter]: Visited 92 different actions 371 times. Merged at 34 different actions 251 times. Widened at 12 different actions 44 times. Performed 1374 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1374 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 220 variables. [2019-09-10 06:48:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:29,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:29,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:29,698 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 06:48:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:29,718 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 06:48:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:29,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 06:48:29,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:30,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2019-09-10 06:48:30,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:30,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:48:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:48:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:48:30,345 INFO L87 Difference]: Start difference. First operand 136561 states and 169063 transitions. Second operand 11 states. [2019-09-10 06:48:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:31,086 INFO L93 Difference]: Finished difference Result 233115 states and 285255 transitions. [2019-09-10 06:48:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:48:31,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-10 06:48:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:31,354 INFO L225 Difference]: With dead ends: 233115 [2019-09-10 06:48:31,354 INFO L226 Difference]: Without dead ends: 233115 [2019-09-10 06:48:31,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:48:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233115 states. [2019-09-10 06:48:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233115 to 181007. [2019-09-10 06:48:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181007 states. [2019-09-10 06:48:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181007 states to 181007 states and 223185 transitions. [2019-09-10 06:48:33,492 INFO L78 Accepts]: Start accepts. Automaton has 181007 states and 223185 transitions. Word has length 98 [2019-09-10 06:48:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:33,492 INFO L475 AbstractCegarLoop]: Abstraction has 181007 states and 223185 transitions. [2019-09-10 06:48:33,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:48:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 181007 states and 223185 transitions. [2019-09-10 06:48:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:48:33,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:33,499 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:33,499 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -735276600, now seen corresponding path program 1 times [2019-09-10 06:48:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:33,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:33,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:33,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:33,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:33,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:33,562 INFO L87 Difference]: Start difference. First operand 181007 states and 223185 transitions. Second operand 5 states. [2019-09-10 06:48:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:34,186 INFO L93 Difference]: Finished difference Result 188063 states and 230134 transitions. [2019-09-10 06:48:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:48:34,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:48:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:34,371 INFO L225 Difference]: With dead ends: 188063 [2019-09-10 06:48:34,371 INFO L226 Difference]: Without dead ends: 188063 [2019-09-10 06:48:34,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188063 states. [2019-09-10 06:48:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188063 to 175679. [2019-09-10 06:48:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175679 states. [2019-09-10 06:48:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175679 states to 175679 states and 215001 transitions. [2019-09-10 06:48:36,747 INFO L78 Accepts]: Start accepts. Automaton has 175679 states and 215001 transitions. Word has length 99 [2019-09-10 06:48:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:36,747 INFO L475 AbstractCegarLoop]: Abstraction has 175679 states and 215001 transitions. [2019-09-10 06:48:36,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 175679 states and 215001 transitions. [2019-09-10 06:48:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:48:36,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:36,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:36,755 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1414591540, now seen corresponding path program 1 times [2019-09-10 06:48:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:36,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:36,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:36,815 INFO L87 Difference]: Start difference. First operand 175679 states and 215001 transitions. Second operand 3 states. [2019-09-10 06:48:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:37,288 INFO L93 Difference]: Finished difference Result 234649 states and 285247 transitions. [2019-09-10 06:48:37,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:37,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:48:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:37,541 INFO L225 Difference]: With dead ends: 234649 [2019-09-10 06:48:37,542 INFO L226 Difference]: Without dead ends: 234649 [2019-09-10 06:48:37,542 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 06:48:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234649 states. [2019-09-10 06:48:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234649 to 150602. [2019-09-10 06:48:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150602 states. [2019-09-10 06:48:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150602 states to 150602 states and 182754 transitions. [2019-09-10 06:48:39,947 INFO L78 Accepts]: Start accepts. Automaton has 150602 states and 182754 transitions. Word has length 102 [2019-09-10 06:48:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:39,947 INFO L475 AbstractCegarLoop]: Abstraction has 150602 states and 182754 transitions. [2019-09-10 06:48:39,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 150602 states and 182754 transitions. [2019-09-10 06:48:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:39,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:39,954 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:39,954 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1500294752, now seen corresponding path program 1 times [2019-09-10 06:48:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:48:40,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:40,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:48:40,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:40,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:48:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:48:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:48:40,018 INFO L87 Difference]: Start difference. First operand 150602 states and 182754 transitions. Second operand 4 states. [2019-09-10 06:48:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:40,763 INFO L93 Difference]: Finished difference Result 243547 states and 294959 transitions. [2019-09-10 06:48:40,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:40,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-10 06:48:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:41,059 INFO L225 Difference]: With dead ends: 243547 [2019-09-10 06:48:41,059 INFO L226 Difference]: Without dead ends: 243547 [2019-09-10 06:48:41,060 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 06:48:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243547 states. [2019-09-10 06:48:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243547 to 180284. [2019-09-10 06:48:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180284 states. [2019-09-10 06:48:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180284 states to 180284 states and 218436 transitions. [2019-09-10 06:48:43,650 INFO L78 Accepts]: Start accepts. Automaton has 180284 states and 218436 transitions. Word has length 103 [2019-09-10 06:48:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:43,650 INFO L475 AbstractCegarLoop]: Abstraction has 180284 states and 218436 transitions. [2019-09-10 06:48:43,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:48:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 180284 states and 218436 transitions. [2019-09-10 06:48:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:43,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:43,658 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:43,658 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 586799771, now seen corresponding path program 1 times [2019-09-10 06:48:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:43,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:43,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:48:43,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:43,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:43,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:43,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:43,764 INFO L87 Difference]: Start difference. First operand 180284 states and 218436 transitions. Second operand 5 states. [2019-09-10 06:48:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:45,031 INFO L93 Difference]: Finished difference Result 175712 states and 212812 transitions. [2019-09-10 06:48:45,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:48:45,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:48:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:45,249 INFO L225 Difference]: With dead ends: 175712 [2019-09-10 06:48:45,249 INFO L226 Difference]: Without dead ends: 175712 [2019-09-10 06:48:45,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175712 states. [2019-09-10 06:48:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175712 to 174114. [2019-09-10 06:48:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174114 states. [2019-09-10 06:48:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174114 states to 174114 states and 211072 transitions. [2019-09-10 06:48:46,739 INFO L78 Accepts]: Start accepts. Automaton has 174114 states and 211072 transitions. Word has length 103 [2019-09-10 06:48:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:46,739 INFO L475 AbstractCegarLoop]: Abstraction has 174114 states and 211072 transitions. [2019-09-10 06:48:46,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 174114 states and 211072 transitions. [2019-09-10 06:48:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:46,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:46,747 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:46,747 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1373495166, now seen corresponding path program 1 times [2019-09-10 06:48:46,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:46,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:46,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:48:46,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:48:46,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:46,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:48:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:48:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:48:46,834 INFO L87 Difference]: Start difference. First operand 174114 states and 211072 transitions. Second operand 4 states. [2019-09-10 06:48:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:48,148 INFO L93 Difference]: Finished difference Result 275888 states and 333921 transitions. [2019-09-10 06:48:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:48,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-10 06:48:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:48,438 INFO L225 Difference]: With dead ends: 275888 [2019-09-10 06:48:48,439 INFO L226 Difference]: Without dead ends: 275888 [2019-09-10 06:48:48,439 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 06:48:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275888 states. [2019-09-10 06:48:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275888 to 173779. [2019-09-10 06:48:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173779 states. [2019-09-10 06:48:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173779 states to 173779 states and 210649 transitions. [2019-09-10 06:48:54,191 INFO L78 Accepts]: Start accepts. Automaton has 173779 states and 210649 transitions. Word has length 103 [2019-09-10 06:48:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:54,191 INFO L475 AbstractCegarLoop]: Abstraction has 173779 states and 210649 transitions. [2019-09-10 06:48:54,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:48:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 173779 states and 210649 transitions. [2019-09-10 06:48:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:54,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:54,198 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:54,198 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash 347835709, now seen corresponding path program 1 times [2019-09-10 06:48:54,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:48:54,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:54,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:54,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:54,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:54,296 INFO L87 Difference]: Start difference. First operand 173779 states and 210649 transitions. Second operand 5 states. [2019-09-10 06:48:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:55,068 INFO L93 Difference]: Finished difference Result 202127 states and 241445 transitions. [2019-09-10 06:48:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:55,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:48:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:55,280 INFO L225 Difference]: With dead ends: 202127 [2019-09-10 06:48:55,281 INFO L226 Difference]: Without dead ends: 202127 [2019-09-10 06:48:55,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202127 states. [2019-09-10 06:48:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202127 to 173324. [2019-09-10 06:48:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173324 states. [2019-09-10 06:48:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173324 states to 173324 states and 210115 transitions. [2019-09-10 06:48:57,451 INFO L78 Accepts]: Start accepts. Automaton has 173324 states and 210115 transitions. Word has length 103 [2019-09-10 06:48:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:57,451 INFO L475 AbstractCegarLoop]: Abstraction has 173324 states and 210115 transitions. [2019-09-10 06:48:57,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 173324 states and 210115 transitions. [2019-09-10 06:48:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:48:57,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:57,456 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:57,456 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1026526093, now seen corresponding path program 1 times [2019-09-10 06:48:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:57,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:57,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:48:57,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:57,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:57,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:57,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:57,545 INFO L87 Difference]: Start difference. First operand 173324 states and 210115 transitions. Second operand 5 states. [2019-09-10 06:48:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:58,274 INFO L93 Difference]: Finished difference Result 256953 states and 310583 transitions. [2019-09-10 06:48:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:58,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 06:48:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:58,585 INFO L225 Difference]: With dead ends: 256953 [2019-09-10 06:48:58,585 INFO L226 Difference]: Without dead ends: 256953 [2019-09-10 06:48:58,585 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 06:48:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256953 states. [2019-09-10 06:49:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256953 to 215038. [2019-09-10 06:49:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215038 states. [2019-09-10 06:49:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215038 states to 215038 states and 260113 transitions. [2019-09-10 06:49:01,648 INFO L78 Accepts]: Start accepts. Automaton has 215038 states and 260113 transitions. Word has length 103 [2019-09-10 06:49:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:01,649 INFO L475 AbstractCegarLoop]: Abstraction has 215038 states and 260113 transitions. [2019-09-10 06:49:01,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 215038 states and 260113 transitions. [2019-09-10 06:49:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:49:01,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:01,655 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:01,655 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1622186963, now seen corresponding path program 1 times [2019-09-10 06:49:01,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:01,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:01,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:01,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:01,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:01,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:49:01,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:01,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:49:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:49:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:01,735 INFO L87 Difference]: Start difference. First operand 215038 states and 260113 transitions. Second operand 5 states. [2019-09-10 06:49:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:02,391 INFO L93 Difference]: Finished difference Result 271390 states and 328284 transitions. [2019-09-10 06:49:02,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:02,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:49:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:02,741 INFO L225 Difference]: With dead ends: 271390 [2019-09-10 06:49:02,741 INFO L226 Difference]: Without dead ends: 271390 [2019-09-10 06:49:02,742 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 06:49:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271390 states. [2019-09-10 06:49:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271390 to 238740. [2019-09-10 06:49:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238740 states. [2019-09-10 06:49:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238740 states to 238740 states and 288670 transitions. [2019-09-10 06:49:08,818 INFO L78 Accepts]: Start accepts. Automaton has 238740 states and 288670 transitions. Word has length 104 [2019-09-10 06:49:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:08,819 INFO L475 AbstractCegarLoop]: Abstraction has 238740 states and 288670 transitions. [2019-09-10 06:49:08,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 238740 states and 288670 transitions. [2019-09-10 06:49:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:49:08,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:08,825 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:08,825 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash -273088376, now seen corresponding path program 1 times [2019-09-10 06:49:08,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:08,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:08,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:08,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:08,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:08,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 06:49:08,888 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:49:08,895 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:08,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:08,931 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:09,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:49:09,089 INFO L272 AbstractInterpreter]: Visited 97 different actions 188 times. Merged at 30 different actions 80 times. Never widened. Performed 887 root evaluator evaluations with a maximum evaluation depth of 5. Performed 887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 222 variables. [2019-09-10 06:49:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:09,090 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:49:10,261 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 92.57% of their original sizes. [2019-09-10 06:49:10,261 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:49:15,663 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 06:49:15,663 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:49:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:15,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 06:49:15,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:15,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 06:49:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 06:49:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3238, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:49:15,666 INFO L87 Difference]: Start difference. First operand 238740 states and 288670 transitions. Second operand 60 states. [2019-09-10 06:51:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:11,314 INFO L93 Difference]: Finished difference Result 332344 states and 399902 transitions. [2019-09-10 06:51:11,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-09-10 06:51:11,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 107 [2019-09-10 06:51:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:11,672 INFO L225 Difference]: With dead ends: 332344 [2019-09-10 06:51:11,672 INFO L226 Difference]: Without dead ends: 332344 [2019-09-10 06:51:11,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22335 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=6272, Invalid=53998, Unknown=0, NotChecked=0, Total=60270 [2019-09-10 06:51:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332344 states. [2019-09-10 06:51:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332344 to 240713. [2019-09-10 06:51:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240713 states. [2019-09-10 06:51:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240713 states to 240713 states and 290942 transitions. [2019-09-10 06:51:14,972 INFO L78 Accepts]: Start accepts. Automaton has 240713 states and 290942 transitions. Word has length 107 [2019-09-10 06:51:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 240713 states and 290942 transitions. [2019-09-10 06:51:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 06:51:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 240713 states and 290942 transitions. [2019-09-10 06:51:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:51:14,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:14,980 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:14,980 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1589621780, now seen corresponding path program 1 times [2019-09-10 06:51:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:15,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:15,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:15,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:51:15,292 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [489], [492], [495], [498], [502], [571], [699], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:51:15,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:15,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:15,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:15,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:15,578 INFO L272 AbstractInterpreter]: Visited 104 different actions 378 times. Merged at 40 different actions 250 times. Widened at 12 different actions 26 times. Performed 1445 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1445 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 11 different actions. Largest state had 223 variables. [2019-09-10 06:51:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:15,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:15,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:15,578 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) [2019-09-10 06:51:15,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:15,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:51:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:15,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:51:15,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:15,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:16,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 28 [2019-09-10 06:51:16,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:16,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:51:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:51:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:51:16,506 INFO L87 Difference]: Start difference. First operand 240713 states and 290942 transitions. Second operand 23 states. [2019-09-10 06:51:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:21,891 INFO L93 Difference]: Finished difference Result 438890 states and 524786 transitions. [2019-09-10 06:51:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:51:21,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2019-09-10 06:51:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:22,379 INFO L225 Difference]: With dead ends: 438890 [2019-09-10 06:51:22,379 INFO L226 Difference]: Without dead ends: 438890 [2019-09-10 06:51:22,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=818, Invalid=2722, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:51:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438890 states. [2019-09-10 06:51:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438890 to 277461. [2019-09-10 06:51:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277461 states. [2019-09-10 06:51:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277461 states to 277461 states and 334144 transitions. [2019-09-10 06:51:34,684 INFO L78 Accepts]: Start accepts. Automaton has 277461 states and 334144 transitions. Word has length 109 [2019-09-10 06:51:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:34,684 INFO L475 AbstractCegarLoop]: Abstraction has 277461 states and 334144 transitions. [2019-09-10 06:51:34,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:51:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 277461 states and 334144 transitions. [2019-09-10 06:51:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:51:34,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:34,692 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:34,693 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853102, now seen corresponding path program 1 times [2019-09-10 06:51:34,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:34,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:34,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:34,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:34,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:34,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:51:34,774 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [198], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [386], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [574], [697], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:51:34,778 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:34,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:34,812 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:34,911 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:51:34,911 INFO L272 AbstractInterpreter]: Visited 99 different actions 156 times. Merged at 29 different actions 50 times. Never widened. Performed 822 root evaluator evaluations with a maximum evaluation depth of 5. Performed 822 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 1 different actions. Largest state had 222 variables. [2019-09-10 06:51:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:34,912 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:51:35,284 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 96.91% of their original sizes. [2019-09-10 06:51:35,285 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:51:49,737 INFO L420 sIntCurrentIteration]: We unified 108 AI predicates to 108 [2019-09-10 06:51:49,737 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:51:49,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:51:49,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [59] imperfect sequences [5] total 62 [2019-09-10 06:51:49,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:49,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 06:51:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 06:51:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3044, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:51:49,739 INFO L87 Difference]: Start difference. First operand 277461 states and 334144 transitions. Second operand 59 states. [2019-09-10 06:53:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:31,026 INFO L93 Difference]: Finished difference Result 374840 states and 449761 transitions. [2019-09-10 06:53:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 06:53:31,027 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 109 [2019-09-10 06:53:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:31,471 INFO L225 Difference]: With dead ends: 374840 [2019-09-10 06:53:31,471 INFO L226 Difference]: Without dead ends: 374840 [2019-09-10 06:53:31,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4042 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=1784, Invalid=9988, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 06:53:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374840 states. [2019-09-10 06:53:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374840 to 278685. [2019-09-10 06:53:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278685 states. [2019-09-10 06:53:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278685 states to 278685 states and 335511 transitions. [2019-09-10 06:53:35,653 INFO L78 Accepts]: Start accepts. Automaton has 278685 states and 335511 transitions. Word has length 109 [2019-09-10 06:53:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:35,653 INFO L475 AbstractCegarLoop]: Abstraction has 278685 states and 335511 transitions. [2019-09-10 06:53:35,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 06:53:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 278685 states and 335511 transitions. [2019-09-10 06:53:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:53:35,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:35,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:35,662 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash 34609446, now seen corresponding path program 1 times [2019-09-10 06:53:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:35,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:53:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:53:35,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:35,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:53:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:53:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:53:35,710 INFO L87 Difference]: Start difference. First operand 278685 states and 335511 transitions. Second operand 4 states. [2019-09-10 06:53:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:36,685 INFO L93 Difference]: Finished difference Result 341259 states and 410697 transitions. [2019-09-10 06:53:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:36,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 06:53:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:37,114 INFO L225 Difference]: With dead ends: 341259 [2019-09-10 06:53:37,114 INFO L226 Difference]: Without dead ends: 341259 [2019-09-10 06:53:37,114 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 06:53:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341259 states. [2019-09-10 06:53:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341259 to 278652. [2019-09-10 06:53:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278652 states. [2019-09-10 06:53:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278652 states to 278652 states and 335469 transitions. [2019-09-10 06:53:42,289 INFO L78 Accepts]: Start accepts. Automaton has 278652 states and 335469 transitions. Word has length 109 [2019-09-10 06:53:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:42,289 INFO L475 AbstractCegarLoop]: Abstraction has 278652 states and 335469 transitions. [2019-09-10 06:53:42,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:53:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 278652 states and 335469 transitions. [2019-09-10 06:53:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:53:42,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:42,296 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:42,296 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash 671171361, now seen corresponding path program 1 times [2019-09-10 06:53:42,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:42,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:42,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:42,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:53:42,579 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [516], [519], [522], [532], [535], [538], [542], [562], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:53:42,580 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:42,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:42,608 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:42,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:42,717 INFO L272 AbstractInterpreter]: Visited 104 different actions 202 times. Merged at 38 different actions 87 times. Never widened. Performed 974 root evaluator evaluations with a maximum evaluation depth of 5. Performed 974 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 223 variables. [2019-09-10 06:53:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:42,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:42,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:42,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:53:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:42,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:53:42,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:43,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:43,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:43,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:43,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:43,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 27 [2019-09-10 06:53:43,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:43,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:53:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:53:43,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:53:43,615 INFO L87 Difference]: Start difference. First operand 278652 states and 335469 transitions. Second operand 22 states. [2019-09-10 06:53:46,612 WARN L188 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-09-10 06:53:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:48,515 INFO L93 Difference]: Finished difference Result 645827 states and 775107 transitions. [2019-09-10 06:53:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:53:48,516 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2019-09-10 06:53:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:55,844 INFO L225 Difference]: With dead ends: 645827 [2019-09-10 06:53:55,844 INFO L226 Difference]: Without dead ends: 645827 [2019-09-10 06:53:55,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:53:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645827 states. [2019-09-10 06:54:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645827 to 278696. [2019-09-10 06:54:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278696 states. [2019-09-10 06:54:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278696 states to 278696 states and 335513 transitions. [2019-09-10 06:54:00,462 INFO L78 Accepts]: Start accepts. Automaton has 278696 states and 335513 transitions. Word has length 109 [2019-09-10 06:54:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:00,462 INFO L475 AbstractCegarLoop]: Abstraction has 278696 states and 335513 transitions. [2019-09-10 06:54:00,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:54:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 278696 states and 335513 transitions. [2019-09-10 06:54:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:54:00,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:00,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:00,469 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 986654236, now seen corresponding path program 1 times [2019-09-10 06:54:00,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:00,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:00,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:00,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:00,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:00,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:00,531 INFO L87 Difference]: Start difference. First operand 278696 states and 335513 transitions. Second operand 3 states. [2019-09-10 06:54:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:00,758 INFO L93 Difference]: Finished difference Result 110829 states and 129493 transitions. [2019-09-10 06:54:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:00,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 06:54:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:00,866 INFO L225 Difference]: With dead ends: 110829 [2019-09-10 06:54:00,866 INFO L226 Difference]: Without dead ends: 110829 [2019-09-10 06:54:00,866 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 06:54:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110829 states. [2019-09-10 06:54:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110829 to 107159. [2019-09-10 06:54:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107159 states. [2019-09-10 06:54:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107159 states to 107159 states and 125530 transitions. [2019-09-10 06:54:02,420 INFO L78 Accepts]: Start accepts. Automaton has 107159 states and 125530 transitions. Word has length 109 [2019-09-10 06:54:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:02,420 INFO L475 AbstractCegarLoop]: Abstraction has 107159 states and 125530 transitions. [2019-09-10 06:54:02,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 107159 states and 125530 transitions. [2019-09-10 06:54:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:54:02,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:02,424 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:02,424 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1188778943, now seen corresponding path program 1 times [2019-09-10 06:54:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:02,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:03,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:03,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:03,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:54:03,253 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [107], [110], [114], [117], [127], [130], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [489], [492], [495], [498], [502], [571], [699], [1395], [1409], [1413], [1416], [1419], [1422], [1426], [1429], [1432], [1435], [1438], [1441], [1445], [1773], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:54:03,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:03,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:03,283 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:03,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:03,524 INFO L272 AbstractInterpreter]: Visited 105 different actions 421 times. Merged at 41 different actions 291 times. Widened at 12 different actions 34 times. Performed 1528 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1528 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 12 different actions. Largest state had 223 variables. [2019-09-10 06:54:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:03,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:03,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:03,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:03,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:03,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:03,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:54:03,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:54:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:04,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:04,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:54:04,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 41 [2019-09-10 06:54:04,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:54:04,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 06:54:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 06:54:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1481, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:54:04,856 INFO L87 Difference]: Start difference. First operand 107159 states and 125530 transitions. Second operand 30 states. [2019-09-10 06:54:05,793 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-09-10 06:54:06,738 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 06:54:07,967 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 06:54:11,302 WARN L188 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-10 06:54:13,342 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-09-10 06:54:14,470 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 06:54:15,635 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 20 [2019-09-10 06:54:15,910 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2019-09-10 06:54:16,469 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2019-09-10 06:54:16,642 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 06:54:17,704 WARN L188 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 06:54:18,209 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2019-09-10 06:54:18,727 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-09-10 06:54:19,660 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-10 06:54:20,490 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 06:54:22,041 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2019-09-10 06:54:22,705 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 06:54:23,387 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2019-09-10 06:54:25,814 WARN L188 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2019-09-10 06:54:26,066 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-09-10 06:54:26,245 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 06:54:26,422 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 06:54:28,015 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 06:54:28,276 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2019-09-10 06:54:28,512 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-10 06:54:29,373 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-09-10 06:54:29,707 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2019-09-10 06:54:31,245 WARN L188 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 06:54:32,099 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 06:54:32,286 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:54:32,438 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 06:54:34,605 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:54:34,778 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:54:35,214 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2019-09-10 06:54:36,459 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:54:36,892 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2019-09-10 06:54:37,717 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-09-10 06:54:38,096 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:54:38,723 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-09-10 06:54:41,025 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 06:54:41,384 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 06:54:42,916 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 06:54:43,718 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 06:54:44,241 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 06:54:46,901 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-09-10 06:54:48,093 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:54:48,329 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 06:54:48,923 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:54:53,835 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-09-10 06:54:54,668 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 06:54:55,787 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 06:54:58,850 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:54:59,179 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 06:55:01,551 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:55:02,155 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-10 06:55:02,369 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:55:04,902 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 06:55:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:05,092 INFO L93 Difference]: Finished difference Result 382250 states and 444325 transitions. [2019-09-10 06:55:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2019-09-10 06:55:05,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 110 [2019-09-10 06:55:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:05,504 INFO L225 Difference]: With dead ends: 382250 [2019-09-10 06:55:05,505 INFO L226 Difference]: Without dead ends: 382250 [2019-09-10 06:55:05,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54656 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=16581, Invalid=117009, Unknown=0, NotChecked=0, Total=133590 [2019-09-10 06:55:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382250 states. [2019-09-10 06:55:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382250 to 107521. [2019-09-10 06:55:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107521 states. [2019-09-10 06:55:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107521 states to 107521 states and 125802 transitions. [2019-09-10 06:55:07,956 INFO L78 Accepts]: Start accepts. Automaton has 107521 states and 125802 transitions. Word has length 110 [2019-09-10 06:55:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:07,956 INFO L475 AbstractCegarLoop]: Abstraction has 107521 states and 125802 transitions. [2019-09-10 06:55:07,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 06:55:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 107521 states and 125802 transitions. [2019-09-10 06:55:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:55:07,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:07,960 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:07,960 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1746417373, now seen corresponding path program 1 times [2019-09-10 06:55:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:07,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:07,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:08,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:08,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:08,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:55:08,208 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [510], [569], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:55:08,212 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:08,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:08,240 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:08,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:55:08,449 INFO L272 AbstractInterpreter]: Visited 105 different actions 422 times. Merged at 41 different actions 289 times. Widened at 14 different actions 28 times. Performed 1490 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1490 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 12 different actions. Largest state had 223 variables. [2019-09-10 06:55:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:08,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:55:08,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:08,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:55:08,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:08,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:55:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:08,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 06:55:08,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:55:08,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:08,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:08,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:08,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:55:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:55:09,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [11] total 27 [2019-09-10 06:55:09,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:09,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:55:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:55:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:55:09,339 INFO L87 Difference]: Start difference. First operand 107521 states and 125802 transitions. Second operand 10 states. [2019-09-10 06:55:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:11,680 INFO L93 Difference]: Finished difference Result 116476 states and 135821 transitions. [2019-09-10 06:55:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:55:11,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-10 06:55:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:11,788 INFO L225 Difference]: With dead ends: 116476 [2019-09-10 06:55:11,789 INFO L226 Difference]: Without dead ends: 116476 [2019-09-10 06:55:11,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:55:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116476 states. [2019-09-10 06:55:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116476 to 113677. [2019-09-10 06:55:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113677 states. [2019-09-10 06:55:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113677 states to 113677 states and 132780 transitions. [2019-09-10 06:55:12,636 INFO L78 Accepts]: Start accepts. Automaton has 113677 states and 132780 transitions. Word has length 110 [2019-09-10 06:55:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:12,637 INFO L475 AbstractCegarLoop]: Abstraction has 113677 states and 132780 transitions. [2019-09-10 06:55:12,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:55:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 113677 states and 132780 transitions. [2019-09-10 06:55:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:55:12,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:12,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:12,641 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2053245386, now seen corresponding path program 1 times [2019-09-10 06:55:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:12,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,127 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-09-10 06:55:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:13,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:13,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:13,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:55:13,444 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [384], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [516], [519], [522], [532], [535], [538], [542], [562], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:55:13,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:13,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:13,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:13,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:55:13,586 INFO L272 AbstractInterpreter]: Visited 105 different actions 189 times. Merged at 40 different actions 75 times. Never widened. Performed 906 root evaluator evaluations with a maximum evaluation depth of 5. Performed 906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 6 different actions. Largest state had 223 variables. [2019-09-10 06:55:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:55:13,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:13,586 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 06:55:13,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:13,603 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 06:55:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:55:13,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:55:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:14,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:55:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:55:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:55:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:55:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:55:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:15,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:55:15,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 28 [2019-09-10 06:55:15,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:55:15,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:55:15,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:55:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:55:15,220 INFO L87 Difference]: Start difference. First operand 113677 states and 132780 transitions. Second operand 25 states. [2019-09-10 06:55:16,749 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 30 [2019-09-10 06:55:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:19,990 INFO L93 Difference]: Finished difference Result 242170 states and 283235 transitions. [2019-09-10 06:55:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:55:19,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2019-09-10 06:55:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:20,241 INFO L225 Difference]: With dead ends: 242170 [2019-09-10 06:55:20,241 INFO L226 Difference]: Without dead ends: 242170 [2019-09-10 06:55:20,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 191 SyntacticMatches, 19 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=502, Invalid=2578, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:55:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242170 states. [2019-09-10 06:55:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242170 to 113620. [2019-09-10 06:55:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113620 states. [2019-09-10 06:55:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113620 states to 113620 states and 132697 transitions. [2019-09-10 06:55:24,381 INFO L78 Accepts]: Start accepts. Automaton has 113620 states and 132697 transitions. Word has length 110 [2019-09-10 06:55:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:24,381 INFO L475 AbstractCegarLoop]: Abstraction has 113620 states and 132697 transitions. [2019-09-10 06:55:24,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:55:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113620 states and 132697 transitions. [2019-09-10 06:55:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:55:24,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:24,385 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:24,385 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1654915896, now seen corresponding path program 1 times [2019-09-10 06:55:24,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:24,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:24,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:55:24,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:24,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:55:24,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:24,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:55:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:55:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:55:24,838 INFO L87 Difference]: Start difference. First operand 113620 states and 132697 transitions. Second operand 12 states. [2019-09-10 06:55:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:26,555 INFO L93 Difference]: Finished difference Result 192730 states and 225815 transitions. [2019-09-10 06:55:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:55:26,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-10 06:55:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:26,734 INFO L225 Difference]: With dead ends: 192730 [2019-09-10 06:55:26,735 INFO L226 Difference]: Without dead ends: 192730 [2019-09-10 06:55:26,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:55:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192730 states. [2019-09-10 06:55:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192730 to 111291. [2019-09-10 06:55:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111291 states. [2019-09-10 06:55:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111291 states to 111291 states and 130050 transitions. [2019-09-10 06:55:28,168 INFO L78 Accepts]: Start accepts. Automaton has 111291 states and 130050 transitions. Word has length 110 [2019-09-10 06:55:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:28,169 INFO L475 AbstractCegarLoop]: Abstraction has 111291 states and 130050 transitions. [2019-09-10 06:55:28,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:55:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 111291 states and 130050 transitions. [2019-09-10 06:55:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:55:28,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:28,172 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:28,173 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1909148399, now seen corresponding path program 1 times [2019-09-10 06:55:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:28,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:55:28,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:28,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:55:28,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:28,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:55:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:55:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:55:28,218 INFO L87 Difference]: Start difference. First operand 111291 states and 130050 transitions. Second operand 4 states. [2019-09-10 06:55:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:28,799 INFO L93 Difference]: Finished difference Result 179100 states and 209320 transitions. [2019-09-10 06:55:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:55:28,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:55:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:28,970 INFO L225 Difference]: With dead ends: 179100 [2019-09-10 06:55:28,970 INFO L226 Difference]: Without dead ends: 179100 [2019-09-10 06:55:28,971 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 06:55:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179100 states. [2019-09-10 06:55:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179100 to 110333. [2019-09-10 06:55:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110333 states. [2019-09-10 06:55:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110333 states to 110333 states and 128904 transitions. [2019-09-10 06:55:30,566 INFO L78 Accepts]: Start accepts. Automaton has 110333 states and 128904 transitions. Word has length 110 [2019-09-10 06:55:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:30,567 INFO L475 AbstractCegarLoop]: Abstraction has 110333 states and 128904 transitions. [2019-09-10 06:55:30,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:55:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 110333 states and 128904 transitions. [2019-09-10 06:55:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:55:30,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:30,570 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:30,570 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1363645364, now seen corresponding path program 1 times [2019-09-10 06:55:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:30,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:30,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:30,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:55:30,977 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [107], [110], [114], [127], [130], [133], [136], [139], [141], [143], [146], [149], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [508], [701], [721], [749], [752], [755], [759], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:55:30,979 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:30,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:31,031 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:31,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:55:31,385 INFO L272 AbstractInterpreter]: Visited 105 different actions 414 times. Merged at 41 different actions 283 times. Widened at 13 different actions 33 times. Performed 1525 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 223 variables. [2019-09-10 06:55:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:31,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:55:31,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:31,386 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 06:55:31,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:31,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:55:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:55:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:55:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:31,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:55:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:55:32,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 06:55:32,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:55:32,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:55:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:55:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:55:32,329 INFO L87 Difference]: Start difference. First operand 110333 states and 128904 transitions. Second operand 21 states. [2019-09-10 06:55:35,092 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 06:55:35,284 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-09-10 06:55:35,871 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2019-09-10 06:55:36,618 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-09-10 06:55:37,290 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-10 06:55:37,537 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-09-10 06:55:37,755 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-09-10 06:55:38,118 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-09-10 06:55:38,326 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-09-10 06:55:39,092 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-09-10 06:55:39,993 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 06:55:41,048 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-09-10 06:55:41,203 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:55:41,457 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-10 06:55:41,719 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-09-10 06:55:42,514 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-10 06:55:42,683 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-09-10 06:55:42,900 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-10 06:55:43,192 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-09-10 06:55:43,517 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-09-10 06:55:44,317 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 06:55:44,691 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-09-10 06:55:45,382 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:55:45,881 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-09-10 06:55:46,216 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-09-10 06:55:46,692 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-09-10 06:55:46,892 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-10 06:55:47,377 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-10 06:55:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:49,938 INFO L93 Difference]: Finished difference Result 278854 states and 322169 transitions. [2019-09-10 06:55:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 06:55:49,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-09-10 06:55:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:50,220 INFO L225 Difference]: With dead ends: 278854 [2019-09-10 06:55:50,220 INFO L226 Difference]: Without dead ends: 278854 [2019-09-10 06:55:50,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3558 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2660, Invalid=11146, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 06:55:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278854 states. [2019-09-10 06:55:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278854 to 116623. [2019-09-10 06:55:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116623 states. [2019-09-10 06:55:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116623 states to 116623 states and 136115 transitions. [2019-09-10 06:55:52,234 INFO L78 Accepts]: Start accepts. Automaton has 116623 states and 136115 transitions. Word has length 110 [2019-09-10 06:55:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:52,234 INFO L475 AbstractCegarLoop]: Abstraction has 116623 states and 136115 transitions. [2019-09-10 06:55:52,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:55:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 116623 states and 136115 transitions. [2019-09-10 06:55:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:55:52,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:52,238 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:52,238 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1535930527, now seen corresponding path program 1 times [2019-09-10 06:55:52,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:53,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:53,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:53,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:55:53,006 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [117], [120], [125], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [198], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [386], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [510], [569], [574], [697], [848], [946], [950], [953], [956], [959], [962], [965], [969], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:55:53,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:53,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:53,029 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:53,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:55:53,123 INFO L272 AbstractInterpreter]: Visited 107 different actions 237 times. Merged at 42 different actions 117 times. Never widened. Performed 1017 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1017 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 7 different actions. Largest state had 223 variables. [2019-09-10 06:55:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:53,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:55:53,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:53,123 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 06:55:53,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:53,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:55:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:53,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:55:53,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:55:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:53,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:55:54,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:54,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:54,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:54,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:54,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:55:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [21] total 38 [2019-09-10 06:55:54,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:54,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:55:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:55:54,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:55:54,280 INFO L87 Difference]: Start difference. First operand 116623 states and 136115 transitions. Second operand 11 states. [2019-09-10 06:55:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:55,455 INFO L93 Difference]: Finished difference Result 115198 states and 134059 transitions. [2019-09-10 06:55:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:55:55,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2019-09-10 06:55:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:55,575 INFO L225 Difference]: With dead ends: 115198 [2019-09-10 06:55:55,576 INFO L226 Difference]: Without dead ends: 115198 [2019-09-10 06:55:55,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:55:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115198 states. [2019-09-10 06:55:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115198 to 112241. [2019-09-10 06:55:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112241 states. [2019-09-10 06:55:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112241 states to 112241 states and 130847 transitions. [2019-09-10 06:55:58,990 INFO L78 Accepts]: Start accepts. Automaton has 112241 states and 130847 transitions. Word has length 112 [2019-09-10 06:55:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:58,990 INFO L475 AbstractCegarLoop]: Abstraction has 112241 states and 130847 transitions. [2019-09-10 06:55:58,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:55:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 112241 states and 130847 transitions. [2019-09-10 06:55:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:55:58,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:58,993 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:58,993 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1659135805, now seen corresponding path program 1 times [2019-09-10 06:55:58,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:58,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:00,174 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 06:56:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:00,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:00,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:56:00,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:00,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:56:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:56:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:56:00,557 INFO L87 Difference]: Start difference. First operand 112241 states and 130847 transitions. Second operand 19 states. [2019-09-10 06:56:01,446 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 06:56:01,713 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:56:02,173 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:56:02,699 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:56:02,843 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:56:03,215 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:56:03,380 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:56:03,679 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-09-10 06:56:04,090 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 06:56:04,901 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:56:05,277 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-10 06:56:05,636 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-10 06:56:06,193 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-09-10 06:56:06,734 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:56:07,085 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:56:07,565 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:56:07,894 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:56:08,199 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 06:56:08,582 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2019-09-10 06:56:08,959 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 06:56:09,292 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:56:09,588 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:56:09,949 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:56:10,226 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:56:10,694 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:56:10,956 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:56:11,168 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:56:11,654 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 06:56:11,939 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 06:56:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:12,524 INFO L93 Difference]: Finished difference Result 236748 states and 278620 transitions. [2019-09-10 06:56:12,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 06:56:12,524 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2019-09-10 06:56:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:12,766 INFO L225 Difference]: With dead ends: 236748 [2019-09-10 06:56:12,766 INFO L226 Difference]: Without dead ends: 236748 [2019-09-10 06:56:12,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:56:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236748 states. [2019-09-10 06:56:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236748 to 112185. [2019-09-10 06:56:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112185 states. [2019-09-10 06:56:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112185 states to 112185 states and 130780 transitions. [2019-09-10 06:56:14,067 INFO L78 Accepts]: Start accepts. Automaton has 112185 states and 130780 transitions. Word has length 112 [2019-09-10 06:56:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:14,067 INFO L475 AbstractCegarLoop]: Abstraction has 112185 states and 130780 transitions. [2019-09-10 06:56:14,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:56:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 112185 states and 130780 transitions. [2019-09-10 06:56:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:56:14,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:14,070 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:14,070 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash 521826919, now seen corresponding path program 1 times [2019-09-10 06:56:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:14,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:14,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:14,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:14,489 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:56:14,489 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [489], [492], [495], [498], [502], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:56:14,491 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:14,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:14,533 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:14,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:56:14,679 INFO L272 AbstractInterpreter]: Visited 110 different actions 208 times. Merged at 38 different actions 87 times. Never widened. Performed 976 root evaluator evaluations with a maximum evaluation depth of 5. Performed 976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 224 variables. [2019-09-10 06:56:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:14,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:56:14,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:14,679 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 06:56:15,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:15,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:56:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:15,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 06:56:15,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:56:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:56:16,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:56:16,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:56:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [18, 16] total 44 [2019-09-10 06:56:16,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:16,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:56:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:56:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:56:16,991 INFO L87 Difference]: Start difference. First operand 112185 states and 130780 transitions. Second operand 14 states. [2019-09-10 06:56:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:19,030 INFO L93 Difference]: Finished difference Result 119996 states and 139867 transitions. [2019-09-10 06:56:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:56:19,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2019-09-10 06:56:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:19,150 INFO L225 Difference]: With dead ends: 119996 [2019-09-10 06:56:19,150 INFO L226 Difference]: Without dead ends: 119996 [2019-09-10 06:56:19,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=365, Invalid=2391, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:56:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119996 states. [2019-09-10 06:56:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119996 to 111989. [2019-09-10 06:56:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111989 states. [2019-09-10 06:56:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111989 states to 111989 states and 130562 transitions. [2019-09-10 06:56:20,046 INFO L78 Accepts]: Start accepts. Automaton has 111989 states and 130562 transitions. Word has length 115 [2019-09-10 06:56:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:20,047 INFO L475 AbstractCegarLoop]: Abstraction has 111989 states and 130562 transitions. [2019-09-10 06:56:20,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:56:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 111989 states and 130562 transitions. [2019-09-10 06:56:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:56:20,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:20,051 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:20,051 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1447716677, now seen corresponding path program 1 times [2019-09-10 06:56:20,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:20,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:20,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:20,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:20,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:20,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:20,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:56:20,844 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:56:20,848 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:20,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:20,895 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:21,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:56:21,160 INFO L272 AbstractInterpreter]: Visited 110 different actions 351 times. Merged at 40 different actions 218 times. Widened at 11 different actions 21 times. Performed 1331 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1331 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 224 variables. [2019-09-10 06:56:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:21,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:56:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:21,161 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) [2019-09-10 06:56:21,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:21,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:56:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:21,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 06:56:21,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:56:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:21,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:56:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:23,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:56:23,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2019-09-10 06:56:23,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:56:23,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:56:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:56:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:56:23,830 INFO L87 Difference]: Start difference. First operand 111989 states and 130562 transitions. Second operand 23 states. [2019-09-10 06:56:24,827 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 06:56:25,130 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:56:25,624 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:56:26,318 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:56:26,620 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-09-10 06:56:26,911 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 06:56:27,284 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:56:27,638 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:56:27,994 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:56:28,523 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:56:28,928 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:56:29,252 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:56:29,622 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:56:30,060 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:56:30,289 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:56:30,659 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:56:30,896 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:56:31,215 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:56:31,713 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-09-10 06:56:32,245 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 06:56:32,792 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 06:56:33,215 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:56:33,368 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:56:33,814 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:56:34,058 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 06:56:34,331 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:56:34,630 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:56:34,847 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:56:35,089 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:56:35,749 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:56:36,010 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:56:36,279 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 06:56:36,586 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 06:56:37,380 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:56:37,704 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 06:56:39,560 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:56:40,158 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:56:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:40,787 INFO L93 Difference]: Finished difference Result 299276 states and 347304 transitions. [2019-09-10 06:56:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 06:56:40,787 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 115 [2019-09-10 06:56:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:41,126 INFO L225 Difference]: With dead ends: 299276 [2019-09-10 06:56:41,126 INFO L226 Difference]: Without dead ends: 299276 [2019-09-10 06:56:41,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 189 SyntacticMatches, 28 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=1567, Invalid=6265, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 06:56:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299276 states. [2019-09-10 06:56:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299276 to 111962. [2019-09-10 06:56:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111962 states. [2019-09-10 06:56:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111962 states to 111962 states and 130524 transitions. [2019-09-10 06:56:42,741 INFO L78 Accepts]: Start accepts. Automaton has 111962 states and 130524 transitions. Word has length 115 [2019-09-10 06:56:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:42,741 INFO L475 AbstractCegarLoop]: Abstraction has 111962 states and 130524 transitions. [2019-09-10 06:56:42,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:56:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 111962 states and 130524 transitions. [2019-09-10 06:56:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:56:42,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:42,745 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:42,745 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -583628972, now seen corresponding path program 1 times [2019-09-10 06:56:42,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:42,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:42,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:43,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:43,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:43,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:56:43,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], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:56:43,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:43,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:43,149 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:43,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:56:43,915 INFO L272 AbstractInterpreter]: Visited 110 different actions 328 times. Merged at 40 different actions 200 times. Widened at 8 different actions 14 times. Performed 1284 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 8 different actions. Largest state had 224 variables. [2019-09-10 06:56:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:43,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:56:43,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:43,916 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 06:56:43,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:43,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:56:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:44,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 06:56:44,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:56:44,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:44,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:44,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:44,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:45,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:56:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:46,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:56:46,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2019-09-10 06:56:46,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:56:46,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 06:56:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 06:56:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:56:46,979 INFO L87 Difference]: Start difference. First operand 111962 states and 130524 transitions. Second operand 30 states. [2019-09-10 06:56:51,584 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:56:51,989 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:56:54,350 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:56:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:59,525 INFO L93 Difference]: Finished difference Result 184127 states and 215378 transitions. [2019-09-10 06:56:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:56:59,525 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 115 [2019-09-10 06:56:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:59,737 INFO L225 Difference]: With dead ends: 184127 [2019-09-10 06:56:59,738 INFO L226 Difference]: Without dead ends: 184127 [2019-09-10 06:56:59,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 191 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=402, Invalid=2790, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:56:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184127 states. [2019-09-10 06:57:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184127 to 111843. [2019-09-10 06:57:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111843 states. [2019-09-10 06:57:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111843 states to 111843 states and 130382 transitions. [2019-09-10 06:57:01,560 INFO L78 Accepts]: Start accepts. Automaton has 111843 states and 130382 transitions. Word has length 115 [2019-09-10 06:57:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:01,561 INFO L475 AbstractCegarLoop]: Abstraction has 111843 states and 130382 transitions. [2019-09-10 06:57:01,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 06:57:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 111843 states and 130382 transitions. [2019-09-10 06:57:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:57:01,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:01,564 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:01,564 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash -313518944, now seen corresponding path program 1 times [2019-09-10 06:57:01,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:01,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:01,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:01,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:02,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:02,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:02,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 06:57:02,076 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:57:02,078 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:02,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:02,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:02,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:02,423 INFO L272 AbstractInterpreter]: Visited 112 different actions 414 times. Merged at 42 different actions 276 times. Widened at 11 different actions 33 times. Performed 1560 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 7 different actions. Largest state had 224 variables. [2019-09-10 06:57:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:02,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:02,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:02,424 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) [2019-09-10 06:57:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:02,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:57:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:02,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 06:57:02,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:57:03,099 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-09-10 06:57:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:03,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:03,644 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 06:57:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:06,241 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 83 [2019-09-10 06:57:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:07,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:57:07,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:07,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:57:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:09,326 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:57:10,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:10,667 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2019-09-10 06:57:10,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 06:57:11,128 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-09-10 06:57:11,520 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-09-10 06:57:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:12,702 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:57:12,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 21] imperfect sequences [19] total 56 [2019-09-10 06:57:12,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:12,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:57:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:57:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2838, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:57:12,704 INFO L87 Difference]: Start difference. First operand 111843 states and 130382 transitions. Second operand 20 states. [2019-09-10 06:57:13,145 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 06:57:13,802 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 06:57:14,399 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 06:57:14,771 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-09-10 06:57:17,850 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:57:18,724 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:57:19,605 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:57:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:24,909 INFO L93 Difference]: Finished difference Result 177336 states and 207191 transitions. [2019-09-10 06:57:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:57:24,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2019-09-10 06:57:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:25,078 INFO L225 Difference]: With dead ends: 177336 [2019-09-10 06:57:25,079 INFO L226 Difference]: Without dead ends: 177336 [2019-09-10 06:57:25,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 183 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=531, Invalid=4581, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 06:57:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177336 states. [2019-09-10 06:57:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177336 to 115680. [2019-09-10 06:57:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115680 states. [2019-09-10 06:57:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115680 states to 115680 states and 134797 transitions. [2019-09-10 06:57:26,545 INFO L78 Accepts]: Start accepts. Automaton has 115680 states and 134797 transitions. Word has length 117 [2019-09-10 06:57:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:26,546 INFO L475 AbstractCegarLoop]: Abstraction has 115680 states and 134797 transitions. [2019-09-10 06:57:26,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:57:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 115680 states and 134797 transitions. [2019-09-10 06:57:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:57:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:26,550 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:26,550 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash 364316989, now seen corresponding path program 1 times [2019-09-10 06:57:26,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:26,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:26,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:26,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:26,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:26,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:57:26,985 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [123], [125], [127], [130], [133], [136], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [567], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:57:26,987 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:26,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:27,016 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:27,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:27,116 INFO L272 AbstractInterpreter]: Visited 113 different actions 198 times. Merged at 40 different actions 76 times. Never widened. Performed 928 root evaluator evaluations with a maximum evaluation depth of 5. Performed 928 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 4 different actions. Largest state had 224 variables. [2019-09-10 06:57:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:27,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:27,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:27,116 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 06:57:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:27,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:57:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:27,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 06:57:27,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:57:28,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:28,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:28,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:57:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:30,007 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:57:31,510 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 06:57:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:31,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:57:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:57:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:32,391 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 06:57:34,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:57:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:57:35,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [17, 20] total 53 [2019-09-10 06:57:35,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:35,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:57:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:57:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:57:35,019 INFO L87 Difference]: Start difference. First operand 115680 states and 134797 transitions. Second operand 21 states. [2019-09-10 06:57:38,654 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 06:57:39,683 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:57:40,702 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:57:42,184 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:57:43,110 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:57:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:50,630 INFO L93 Difference]: Finished difference Result 143686 states and 167609 transitions. [2019-09-10 06:57:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:57:50,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 118 [2019-09-10 06:57:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:50,767 INFO L225 Difference]: With dead ends: 143686 [2019-09-10 06:57:50,767 INFO L226 Difference]: Without dead ends: 143686 [2019-09-10 06:57:50,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 176 SyntacticMatches, 25 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=614, Invalid=4078, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 06:57:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143686 states. [2019-09-10 06:57:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143686 to 115658. [2019-09-10 06:57:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115658 states. [2019-09-10 06:57:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115658 states to 115658 states and 134770 transitions. [2019-09-10 06:57:51,711 INFO L78 Accepts]: Start accepts. Automaton has 115658 states and 134770 transitions. Word has length 118 [2019-09-10 06:57:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:51,711 INFO L475 AbstractCegarLoop]: Abstraction has 115658 states and 134770 transitions. [2019-09-10 06:57:51,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:57:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 115658 states and 134770 transitions. [2019-09-10 06:57:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:57:51,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:51,714 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:51,714 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -751981928, now seen corresponding path program 1 times [2019-09-10 06:57:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:51,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:51,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:52,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:52,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:52,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:57:52,485 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [125], [127], [130], [133], [136], [139], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [574], [697], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:57:52,488 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:52,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:52,515 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:52,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:52,599 INFO L272 AbstractInterpreter]: Visited 113 different actions 218 times. Merged at 40 different actions 93 times. Never widened. Performed 963 root evaluator evaluations with a maximum evaluation depth of 5. Performed 963 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 6 different actions. Largest state had 224 variables. [2019-09-10 06:57:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:52,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:52,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:52,600 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 06:57:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:52,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:57:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:52,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:57:52,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:57:53,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:53,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:54,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:57:54,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:54,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:54,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:55,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:57:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:56,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:57:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:57,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:57:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2019-09-10 06:57:57,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:57:57,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 06:57:57,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 06:57:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1877, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:57:57,146 INFO L87 Difference]: Start difference. First operand 115658 states and 134770 transitions. Second operand 32 states. [2019-09-10 06:57:59,996 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:58:01,095 WARN L188 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:58:01,445 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:58:02,216 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 06:58:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:02,936 INFO L93 Difference]: Finished difference Result 129684 states and 150869 transitions. [2019-09-10 06:58:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:58:02,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 118 [2019-09-10 06:58:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:03,059 INFO L225 Difference]: With dead ends: 129684 [2019-09-10 06:58:03,059 INFO L226 Difference]: Without dead ends: 129684 [2019-09-10 06:58:03,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 181 SyntacticMatches, 27 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=594, Invalid=3828, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 06:58:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129684 states. [2019-09-10 06:58:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129684 to 114391. [2019-09-10 06:58:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114391 states. [2019-09-10 06:58:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114391 states to 114391 states and 133306 transitions. [2019-09-10 06:58:04,292 INFO L78 Accepts]: Start accepts. Automaton has 114391 states and 133306 transitions. Word has length 118 [2019-09-10 06:58:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:04,292 INFO L475 AbstractCegarLoop]: Abstraction has 114391 states and 133306 transitions. [2019-09-10 06:58:04,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 06:58:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 114391 states and 133306 transitions. [2019-09-10 06:58:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:58:04,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:04,296 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:04,296 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -790267987, now seen corresponding path program 1 times [2019-09-10 06:58:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:04,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:58:04,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:58:04,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:04,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:58:04,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:58:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:58:04,934 INFO L87 Difference]: Start difference. First operand 114391 states and 133306 transitions. Second operand 17 states. [2019-09-10 06:58:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:08,502 INFO L93 Difference]: Finished difference Result 318336 states and 372554 transitions. [2019-09-10 06:58:08,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:58:08,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-10 06:58:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:08,838 INFO L225 Difference]: With dead ends: 318336 [2019-09-10 06:58:08,838 INFO L226 Difference]: Without dead ends: 318336 [2019-09-10 06:58:08,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:58:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318336 states. [2019-09-10 06:58:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318336 to 114280. [2019-09-10 06:58:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114280 states. [2019-09-10 06:58:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114280 states to 114280 states and 133188 transitions. [2019-09-10 06:58:10,900 INFO L78 Accepts]: Start accepts. Automaton has 114280 states and 133188 transitions. Word has length 119 [2019-09-10 06:58:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:10,900 INFO L475 AbstractCegarLoop]: Abstraction has 114280 states and 133188 transitions. [2019-09-10 06:58:10,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:58:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 114280 states and 133188 transitions. [2019-09-10 06:58:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 06:58:10,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:10,904 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:10,904 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -343133627, now seen corresponding path program 1 times [2019-09-10 06:58:10,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:10,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:10,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:11,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:11,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:11,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 06:58:11,534 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [76], [79], [82], [86], [89], [92], [95], [98], [101], [105], [107], [110], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [152], [155], [157], [159], [162], [165], [169], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [513], [567], [574], [697], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:58:11,538 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:11,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:11,558 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:11,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:58:11,749 INFO L272 AbstractInterpreter]: Visited 114 different actions 401 times. Merged at 42 different actions 265 times. Widened at 11 different actions 27 times. Performed 1457 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 224 variables. [2019-09-10 06:58:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:11,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:58:11,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:11,749 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 06:58:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:11,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:58:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:11,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:58:11,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:58:12,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:12,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:12,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:12,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:14,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:58:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:14,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:14,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:58:14,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 23 [2019-09-10 06:58:14,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:58:14,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:58:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:58:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:58:14,471 INFO L87 Difference]: Start difference. First operand 114280 states and 133188 transitions. Second operand 23 states. [2019-09-10 06:58:16,802 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-09-10 06:58:19,664 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2019-09-10 06:58:22,284 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:58:22,586 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:58:23,180 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:58:23,516 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 06:58:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:25,178 INFO L93 Difference]: Finished difference Result 208746 states and 243058 transitions. [2019-09-10 06:58:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:58:25,179 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-09-10 06:58:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:25,380 INFO L225 Difference]: With dead ends: 208746 [2019-09-10 06:58:25,380 INFO L226 Difference]: Without dead ends: 208746 [2019-09-10 06:58:25,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 211 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:58:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208746 states. [2019-09-10 06:58:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208746 to 114186. [2019-09-10 06:58:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114186 states. [2019-09-10 06:58:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114186 states to 114186 states and 133081 transitions. [2019-09-10 06:58:27,176 INFO L78 Accepts]: Start accepts. Automaton has 114186 states and 133081 transitions. Word has length 119 [2019-09-10 06:58:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:27,176 INFO L475 AbstractCegarLoop]: Abstraction has 114186 states and 133081 transitions. [2019-09-10 06:58:27,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:58:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 114186 states and 133081 transitions. [2019-09-10 06:58:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 06:58:27,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:27,183 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2019-09-10 06:58:27,183 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:27,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 710030682, now seen corresponding path program 1 times [2019-09-10 06:58:27,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:27,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:27,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:27,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:58:27,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:27,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:27,425 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2019-09-10 06:58:27,426 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [198], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [275], [278], [281], [284], [286], [288], [317], [322], [335], [337], [350], [358], [377], [386], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [701], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:58:27,428 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:27,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:27,458 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:27,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:58:27,690 INFO L272 AbstractInterpreter]: Visited 99 different actions 383 times. Merged at 39 different actions 243 times. Widened at 9 different actions 18 times. Performed 1408 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1408 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 44 fixpoints after 13 different actions. Largest state had 221 variables. [2019-09-10 06:58:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:27,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:58:27,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:27,690 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 06:58:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:27,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:58:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:27,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:58:27,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:58:28,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:58:28,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:58:28,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:58:28,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:58:28,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 06:58:28,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:58:28,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:58:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:58:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:58:28,910 INFO L87 Difference]: Start difference. First operand 114186 states and 133081 transitions. Second operand 18 states. [2019-09-10 06:58:29,491 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:58:33,484 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:58:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:34,011 INFO L93 Difference]: Finished difference Result 204350 states and 237745 transitions. [2019-09-10 06:58:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:58:34,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2019-09-10 06:58:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:34,217 INFO L225 Difference]: With dead ends: 204350 [2019-09-10 06:58:34,218 INFO L226 Difference]: Without dead ends: 204350 [2019-09-10 06:58:34,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:58:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204350 states. [2019-09-10 06:58:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204350 to 153854. [2019-09-10 06:58:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153854 states. [2019-09-10 06:58:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153854 states to 153854 states and 179537 transitions. [2019-09-10 06:58:35,975 INFO L78 Accepts]: Start accepts. Automaton has 153854 states and 179537 transitions. Word has length 139 [2019-09-10 06:58:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:35,976 INFO L475 AbstractCegarLoop]: Abstraction has 153854 states and 179537 transitions. [2019-09-10 06:58:35,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:58:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 153854 states and 179537 transitions. [2019-09-10 06:58:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 06:58:35,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:35,983 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2019-09-10 06:58:35,983 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1157803171, now seen corresponding path program 1 times [2019-09-10 06:58:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:35,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 06:58:36,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:36,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:36,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:36,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:36,044 INFO L87 Difference]: Start difference. First operand 153854 states and 179537 transitions. Second operand 3 states. [2019-09-10 06:58:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:36,172 INFO L93 Difference]: Finished difference Result 60948 states and 70637 transitions. [2019-09-10 06:58:36,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:36,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 06:58:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:36,221 INFO L225 Difference]: With dead ends: 60948 [2019-09-10 06:58:36,222 INFO L226 Difference]: Without dead ends: 60948 [2019-09-10 06:58:36,222 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 06:58:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60948 states. [2019-09-10 06:58:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60948 to 58812. [2019-09-10 06:58:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58812 states. [2019-09-10 06:58:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58812 states to 58812 states and 68178 transitions. [2019-09-10 06:58:37,182 INFO L78 Accepts]: Start accepts. Automaton has 58812 states and 68178 transitions. Word has length 139 [2019-09-10 06:58:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:37,182 INFO L475 AbstractCegarLoop]: Abstraction has 58812 states and 68178 transitions. [2019-09-10 06:58:37,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 58812 states and 68178 transitions. [2019-09-10 06:58:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 06:58:37,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:37,186 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-10 06:58:37,187 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2118283193, now seen corresponding path program 1 times [2019-09-10 06:58:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:37,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-10 06:58:37,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:37,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:58:37,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:37,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:58:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:58:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:58:37,552 INFO L87 Difference]: Start difference. First operand 58812 states and 68178 transitions. Second operand 12 states. [2019-09-10 06:58:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:39,191 INFO L93 Difference]: Finished difference Result 66398 states and 76555 transitions. [2019-09-10 06:58:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:58:39,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-09-10 06:58:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:39,246 INFO L225 Difference]: With dead ends: 66398 [2019-09-10 06:58:39,246 INFO L226 Difference]: Without dead ends: 66398 [2019-09-10 06:58:39,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:58:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66398 states. [2019-09-10 06:58:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66398 to 60312. [2019-09-10 06:58:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60312 states. [2019-09-10 06:58:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60312 states to 60312 states and 69689 transitions. [2019-09-10 06:58:39,683 INFO L78 Accepts]: Start accepts. Automaton has 60312 states and 69689 transitions. Word has length 140 [2019-09-10 06:58:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:39,684 INFO L475 AbstractCegarLoop]: Abstraction has 60312 states and 69689 transitions. [2019-09-10 06:58:39,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:58:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 60312 states and 69689 transitions. [2019-09-10 06:58:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 06:58:39,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:39,687 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2019-09-10 06:58:39,687 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash 65312028, now seen corresponding path program 1 times [2019-09-10 06:58:39,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:39,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:58:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:40,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:40,331 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 06:58:40,331 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [107], [110], [114], [127], [130], [133], [143], [146], [159], [162], [165], [169], [171], [192], [195], [198], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [275], [278], [281], [284], [286], [288], [317], [322], [335], [337], [350], [358], [377], [386], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [510], [569], [701], [848], [946], [950], [988], [1016], [1019], [1022], [1026], [1794], [1795], [1799], [1800], [1801] [2019-09-10 06:58:40,333 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:40,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:40,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:40,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:58:40,498 INFO L272 AbstractInterpreter]: Visited 98 different actions 397 times. Merged at 38 different actions 263 times. Widened at 10 different actions 25 times. Performed 1454 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1454 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 12 different actions. Largest state had 221 variables. [2019-09-10 06:58:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:40,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:58:40,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:40,499 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 06:58:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:40,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:58:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:40,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 06:58:40,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:58:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 06:58:41,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:58:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 06:58:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:58:41,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [20] total 34 [2019-09-10 06:58:41,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:41,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:58:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:58:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:58:41,758 INFO L87 Difference]: Start difference. First operand 60312 states and 69689 transitions. Second operand 11 states.