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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:44:35,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:44:35,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:44:35,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:44:35,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:44:35,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:44:35,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:44:35,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:44:35,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:44:35,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:44:35,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:44:35,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:44:35,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:44:35,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:44:35,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:44:35,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:44:35,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:44:35,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:44:35,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:44:35,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:44:35,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:44:35,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:44:35,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:44:35,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:44:35,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:44:35,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:44:35,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:44:35,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:44:35,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:44:35,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:44:35,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:44:35,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:44:35,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:44:35,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:44:35,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:44:35,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:44:35,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:44:35,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:44:35,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:44:35,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:44:35,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:44:35,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:44:35,652 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:44:35,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:44:35,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:44:35,655 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:44:35,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:44:35,656 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:44:35,657 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:44:35,657 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:44:35,657 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:44:35,657 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:44:35,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:44:35,658 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:44:35,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:44:35,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:44:35,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:44:35,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:44:35,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:44:35,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:44:35,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:44:35,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:44:35,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:44:35,661 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:44:35,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:44:35,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:44:35,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:44:35,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:44:35,663 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:44:35,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:44:35,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:44:35,663 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:44:35,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:44:35,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:44:35,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:44:35,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:44:35,740 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:44:35,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:44:35,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d20f6ba/f8aa68919c7a49cc87e6791ef74e080a/FLAGfd5b44547 [2019-09-10 07:44:36,287 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:44:36,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:44:36,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d20f6ba/f8aa68919c7a49cc87e6791ef74e080a/FLAGfd5b44547 [2019-09-10 07:44:36,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d20f6ba/f8aa68919c7a49cc87e6791ef74e080a [2019-09-10 07:44:36,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:44:36,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:44:36,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:44:36,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:44:36,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:44:36,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:44:36" (1/1) ... [2019-09-10 07:44:36,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:36, skipping insertion in model container [2019-09-10 07:44:36,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:44:36" (1/1) ... [2019-09-10 07:44:36,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:44:36,745 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:44:37,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:44:37,195 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:44:37,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:44:37,317 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:44:37,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37 WrapperNode [2019-09-10 07:44:37,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:44:37,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:44:37,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:44:37,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:44:37,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... [2019-09-10 07:44:37,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:44:37,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:44:37,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:44:37,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:44:37,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:44:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:44:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:44:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:44:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:44:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:44:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:44:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:44:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:44:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:44:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:44:38,225 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:44:38,226 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:44:38,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:44:38 BoogieIcfgContainer [2019-09-10 07:44:38,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:44:38,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:44:38,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:44:38,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:44:38,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:44:36" (1/3) ... [2019-09-10 07:44:38,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460eff1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:44:38, skipping insertion in model container [2019-09-10 07:44:38,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:44:37" (2/3) ... [2019-09-10 07:44:38,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460eff1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:44:38, skipping insertion in model container [2019-09-10 07:44:38,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:44:38" (3/3) ... [2019-09-10 07:44:38,243 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:44:38,253 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:44:38,275 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:44:38,294 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:44:38,328 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:44:38,329 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:44:38,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:44:38,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:44:38,329 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:44:38,329 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:44:38,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:44:38,332 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:44:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-09-10 07:44:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:44:38,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:38,373 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] [2019-09-10 07:44:38,375 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash 892664727, now seen corresponding path program 1 times [2019-09-10 07:44:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:38,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:38,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:38,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:38,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:38,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:38,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:38,846 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-09-10 07:44:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:38,961 INFO L93 Difference]: Finished difference Result 196 states and 319 transitions. [2019-09-10 07:44:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:38,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:44:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:38,978 INFO L225 Difference]: With dead ends: 196 [2019-09-10 07:44:38,978 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 07:44:38,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 07:44:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-10 07:44:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 07:44:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2019-09-10 07:44:39,057 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 65 [2019-09-10 07:44:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:39,057 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2019-09-10 07:44:39,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2019-09-10 07:44:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:44:39,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:39,061 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] [2019-09-10 07:44:39,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -863027836, now seen corresponding path program 1 times [2019-09-10 07:44:39,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:39,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:39,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:39,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:39,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:39,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:39,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:39,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:39,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:39,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:39,299 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2019-09-10 07:44:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:39,584 INFO L93 Difference]: Finished difference Result 311 states and 460 transitions. [2019-09-10 07:44:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:39,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 07:44:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:39,588 INFO L225 Difference]: With dead ends: 311 [2019-09-10 07:44:39,589 INFO L226 Difference]: Without dead ends: 311 [2019-09-10 07:44:39,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:44:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-10 07:44:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-09-10 07:44:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-10 07:44:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 459 transitions. [2019-09-10 07:44:39,638 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 459 transitions. Word has length 67 [2019-09-10 07:44:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:39,640 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 459 transitions. [2019-09-10 07:44:39,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 459 transitions. [2019-09-10 07:44:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:44:39,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:39,643 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] [2019-09-10 07:44:39,646 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash -469367140, now seen corresponding path program 1 times [2019-09-10 07:44:39,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:39,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:39,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:39,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:39,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:39,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:39,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:39,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:39,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:39,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:39,827 INFO L87 Difference]: Start difference. First operand 309 states and 459 transitions. Second operand 5 states. [2019-09-10 07:44:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:39,982 INFO L93 Difference]: Finished difference Result 309 states and 454 transitions. [2019-09-10 07:44:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:39,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:44:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:39,984 INFO L225 Difference]: With dead ends: 309 [2019-09-10 07:44:39,985 INFO L226 Difference]: Without dead ends: 309 [2019-09-10 07:44:39,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:44:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-10 07:44:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-09-10 07:44:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-10 07:44:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 454 transitions. [2019-09-10 07:44:40,004 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 454 transitions. Word has length 68 [2019-09-10 07:44:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,005 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 454 transitions. [2019-09-10 07:44:40,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 454 transitions. [2019-09-10 07:44:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:44:40,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,012 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] [2019-09-10 07:44:40,012 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 299075236, now seen corresponding path program 1 times [2019-09-10 07:44:40,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:40,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:44:40,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:40,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:44:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:44:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:40,205 INFO L87 Difference]: Start difference. First operand 309 states and 454 transitions. Second operand 6 states. [2019-09-10 07:44:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:40,385 INFO L93 Difference]: Finished difference Result 503 states and 746 transitions. [2019-09-10 07:44:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:40,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:44:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:40,389 INFO L225 Difference]: With dead ends: 503 [2019-09-10 07:44:40,389 INFO L226 Difference]: Without dead ends: 503 [2019-09-10 07:44:40,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:44:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-10 07:44:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2019-09-10 07:44:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-10 07:44:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 745 transitions. [2019-09-10 07:44:40,406 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 745 transitions. Word has length 69 [2019-09-10 07:44:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,407 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 745 transitions. [2019-09-10 07:44:40,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:44:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 745 transitions. [2019-09-10 07:44:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:44:40,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,409 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 07:44:40,410 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1045896819, now seen corresponding path program 1 times [2019-09-10 07:44:40,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:40,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:40,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:40,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:40,493 INFO L87 Difference]: Start difference. First operand 501 states and 745 transitions. Second operand 5 states. [2019-09-10 07:44:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:40,644 INFO L93 Difference]: Finished difference Result 501 states and 736 transitions. [2019-09-10 07:44:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:40,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 07:44:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:40,648 INFO L225 Difference]: With dead ends: 501 [2019-09-10 07:44:40,649 INFO L226 Difference]: Without dead ends: 501 [2019-09-10 07:44:40,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:44:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-10 07:44:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-09-10 07:44:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-10 07:44:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 736 transitions. [2019-09-10 07:44:40,668 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 736 transitions. Word has length 70 [2019-09-10 07:44:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,668 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 736 transitions. [2019-09-10 07:44:40,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 736 transitions. [2019-09-10 07:44:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:40,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:40,672 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1929984870, now seen corresponding path program 1 times [2019-09-10 07:44:40,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:40,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:40,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:40,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:40,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:40,813 INFO L87 Difference]: Start difference. First operand 501 states and 736 transitions. Second operand 5 states. [2019-09-10 07:44:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:40,920 INFO L93 Difference]: Finished difference Result 1047 states and 1558 transitions. [2019-09-10 07:44:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:40,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:44:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:40,926 INFO L225 Difference]: With dead ends: 1047 [2019-09-10 07:44:40,927 INFO L226 Difference]: Without dead ends: 1047 [2019-09-10 07:44:40,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-10 07:44:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 694. [2019-09-10 07:44:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 07:44:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1032 transitions. [2019-09-10 07:44:40,950 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1032 transitions. Word has length 71 [2019-09-10 07:44:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,952 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1032 transitions. [2019-09-10 07:44:40,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1032 transitions. [2019-09-10 07:44:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:40,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,959 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 07:44:40,959 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -165846340, now seen corresponding path program 1 times [2019-09-10 07:44:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:41,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:41,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:41,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:41,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:41,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:41,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:41,078 INFO L87 Difference]: Start difference. First operand 694 states and 1032 transitions. Second operand 5 states. [2019-09-10 07:44:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,175 INFO L93 Difference]: Finished difference Result 1377 states and 2066 transitions. [2019-09-10 07:44:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:41,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:44:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,184 INFO L225 Difference]: With dead ends: 1377 [2019-09-10 07:44:41,184 INFO L226 Difference]: Without dead ends: 1377 [2019-09-10 07:44:41,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-09-10 07:44:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1121. [2019-09-10 07:44:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-10 07:44:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1686 transitions. [2019-09-10 07:44:41,237 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1686 transitions. Word has length 71 [2019-09-10 07:44:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,237 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1686 transitions. [2019-09-10 07:44:41,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1686 transitions. [2019-09-10 07:44:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:41,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,238 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 07:44:41,239 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash -473955093, now seen corresponding path program 1 times [2019-09-10 07:44:41,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:41,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:41,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:41,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:41,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:41,358 INFO L87 Difference]: Start difference. First operand 1121 states and 1686 transitions. Second operand 5 states. [2019-09-10 07:44:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,476 INFO L93 Difference]: Finished difference Result 1539 states and 2314 transitions. [2019-09-10 07:44:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:41,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:44:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,488 INFO L225 Difference]: With dead ends: 1539 [2019-09-10 07:44:41,488 INFO L226 Difference]: Without dead ends: 1539 [2019-09-10 07:44:41,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-09-10 07:44:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1321. [2019-09-10 07:44:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-09-10 07:44:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1992 transitions. [2019-09-10 07:44:41,533 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1992 transitions. Word has length 71 [2019-09-10 07:44:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,534 INFO L475 AbstractCegarLoop]: Abstraction has 1321 states and 1992 transitions. [2019-09-10 07:44:41,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1992 transitions. [2019-09-10 07:44:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:41,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,536 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 07:44:41,536 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash 500097299, now seen corresponding path program 1 times [2019-09-10 07:44:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:41,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:41,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:41,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:41,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:41,600 INFO L87 Difference]: Start difference. First operand 1321 states and 1992 transitions. Second operand 3 states. [2019-09-10 07:44:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,646 INFO L93 Difference]: Finished difference Result 2343 states and 3469 transitions. [2019-09-10 07:44:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:41,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 07:44:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,659 INFO L225 Difference]: With dead ends: 2343 [2019-09-10 07:44:41,659 INFO L226 Difference]: Without dead ends: 2343 [2019-09-10 07:44:41,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-09-10 07:44:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2293. [2019-09-10 07:44:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-10 07:44:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3396 transitions. [2019-09-10 07:44:41,719 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3396 transitions. Word has length 71 [2019-09-10 07:44:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,719 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3396 transitions. [2019-09-10 07:44:41,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3396 transitions. [2019-09-10 07:44:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:41,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,721 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 07:44:41,721 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 671723250, now seen corresponding path program 1 times [2019-09-10 07:44:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:41,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:41,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:41,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:41,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:41,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:41,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:41,785 INFO L87 Difference]: Start difference. First operand 2293 states and 3396 transitions. Second operand 3 states. [2019-09-10 07:44:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,843 INFO L93 Difference]: Finished difference Result 2295 states and 3389 transitions. [2019-09-10 07:44:41,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:41,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 07:44:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,857 INFO L225 Difference]: With dead ends: 2295 [2019-09-10 07:44:41,857 INFO L226 Difference]: Without dead ends: 2295 [2019-09-10 07:44:41,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-09-10 07:44:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2293. [2019-09-10 07:44:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-10 07:44:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3388 transitions. [2019-09-10 07:44:41,915 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3388 transitions. Word has length 71 [2019-09-10 07:44:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,915 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3388 transitions. [2019-09-10 07:44:41,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3388 transitions. [2019-09-10 07:44:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:44:41,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,917 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 07:44:41,917 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1753966399, now seen corresponding path program 1 times [2019-09-10 07:44:41,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:42,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:42,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:44:42,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:42,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:44:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:44:42,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:44:42,038 INFO L87 Difference]: Start difference. First operand 2293 states and 3388 transitions. Second operand 5 states. [2019-09-10 07:44:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:42,149 INFO L93 Difference]: Finished difference Result 5382 states and 7962 transitions. [2019-09-10 07:44:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:44:42,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:44:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:42,176 INFO L225 Difference]: With dead ends: 5382 [2019-09-10 07:44:42,176 INFO L226 Difference]: Without dead ends: 5382 [2019-09-10 07:44:42,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:44:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-09-10 07:44:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 5188. [2019-09-10 07:44:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-10 07:44:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7691 transitions. [2019-09-10 07:44:42,337 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7691 transitions. Word has length 71 [2019-09-10 07:44:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:42,337 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7691 transitions. [2019-09-10 07:44:42,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:44:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7691 transitions. [2019-09-10 07:44:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:44:42,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:42,339 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 07:44:42,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1515656525, now seen corresponding path program 1 times [2019-09-10 07:44:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:42,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:42,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:42,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:42,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:44:42,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:42,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:44:42,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:44:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:44:42,568 INFO L87 Difference]: Start difference. First operand 5188 states and 7691 transitions. Second operand 10 states. [2019-09-10 07:44:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:43,355 INFO L93 Difference]: Finished difference Result 10472 states and 15420 transitions. [2019-09-10 07:44:43,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:43,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:44:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:43,425 INFO L225 Difference]: With dead ends: 10472 [2019-09-10 07:44:43,425 INFO L226 Difference]: Without dead ends: 10472 [2019-09-10 07:44:43,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:44:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10472 states. [2019-09-10 07:44:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10472 to 5188. [2019-09-10 07:44:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-10 07:44:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7681 transitions. [2019-09-10 07:44:43,626 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7681 transitions. Word has length 72 [2019-09-10 07:44:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:43,627 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7681 transitions. [2019-09-10 07:44:43,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:44:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7681 transitions. [2019-09-10 07:44:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:44:43,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:43,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:43,629 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1460244248, now seen corresponding path program 1 times [2019-09-10 07:44:43,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:43,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:43,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:44:43,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:43,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:44:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:44:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:44:43,822 INFO L87 Difference]: Start difference. First operand 5188 states and 7681 transitions. Second operand 10 states. [2019-09-10 07:44:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:44,717 INFO L93 Difference]: Finished difference Result 10529 states and 15477 transitions. [2019-09-10 07:44:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:44:44,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-10 07:44:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:44,739 INFO L225 Difference]: With dead ends: 10529 [2019-09-10 07:44:44,739 INFO L226 Difference]: Without dead ends: 10529 [2019-09-10 07:44:44,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:44:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2019-09-10 07:44:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 5188. [2019-09-10 07:44:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-10 07:44:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7678 transitions. [2019-09-10 07:44:44,934 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7678 transitions. Word has length 73 [2019-09-10 07:44:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:44,934 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7678 transitions. [2019-09-10 07:44:44,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:44:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7678 transitions. [2019-09-10 07:44:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:44:44,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:44,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:44,937 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 236126643, now seen corresponding path program 1 times [2019-09-10 07:44:44,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:44,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:44,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:45,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:45,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:44:45,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:45,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:44:45,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:44:45,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:44:45,163 INFO L87 Difference]: Start difference. First operand 5188 states and 7678 transitions. Second operand 9 states. [2019-09-10 07:44:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:45,713 INFO L93 Difference]: Finished difference Result 12626 states and 18779 transitions. [2019-09-10 07:44:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:44:45,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:44:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:45,740 INFO L225 Difference]: With dead ends: 12626 [2019-09-10 07:44:45,740 INFO L226 Difference]: Without dead ends: 12626 [2019-09-10 07:44:45,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:44:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2019-09-10 07:44:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 5188. [2019-09-10 07:44:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-10 07:44:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7677 transitions. [2019-09-10 07:44:45,879 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7677 transitions. Word has length 73 [2019-09-10 07:44:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:45,879 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7677 transitions. [2019-09-10 07:44:45,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:44:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7677 transitions. [2019-09-10 07:44:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:44:45,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:45,882 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 07:44:45,882 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1277245649, now seen corresponding path program 1 times [2019-09-10 07:44:45,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:45,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:46,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:46,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:44:46,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:46,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:44:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:44:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:44:46,184 INFO L87 Difference]: Start difference. First operand 5188 states and 7677 transitions. Second operand 10 states. [2019-09-10 07:44:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:47,040 INFO L93 Difference]: Finished difference Result 10486 states and 15430 transitions. [2019-09-10 07:44:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:44:47,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:44:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:47,061 INFO L225 Difference]: With dead ends: 10486 [2019-09-10 07:44:47,061 INFO L226 Difference]: Without dead ends: 10486 [2019-09-10 07:44:47,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:44:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10486 states. [2019-09-10 07:44:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10486 to 5188. [2019-09-10 07:44:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-09-10 07:44:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7671 transitions. [2019-09-10 07:44:47,182 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7671 transitions. Word has length 74 [2019-09-10 07:44:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:47,183 INFO L475 AbstractCegarLoop]: Abstraction has 5188 states and 7671 transitions. [2019-09-10 07:44:47,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:44:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7671 transitions. [2019-09-10 07:44:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:44:47,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:47,185 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 07:44:47,185 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash -484955932, now seen corresponding path program 1 times [2019-09-10 07:44:47,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:47,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:47,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:47,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:47,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:48,107 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:44:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:49,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:49,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 07:44:49,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:49,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:44:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:44:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:44:49,204 INFO L87 Difference]: Start difference. First operand 5188 states and 7671 transitions. Second operand 24 states. [2019-09-10 07:44:49,361 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:44:50,045 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-10 07:44:50,289 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:44:50,528 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:44:50,866 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:44:51,237 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 07:44:51,700 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-09-10 07:44:52,261 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2019-09-10 07:44:52,544 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:44:52,801 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:44:53,324 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:44:53,714 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:44:54,154 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:44:54,676 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:44:54,931 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:44:55,369 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:44:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:57,409 INFO L93 Difference]: Finished difference Result 41768 states and 61936 transitions. [2019-09-10 07:44:57,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 07:44:57,410 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-10 07:44:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:57,472 INFO L225 Difference]: With dead ends: 41768 [2019-09-10 07:44:57,472 INFO L226 Difference]: Without dead ends: 41768 [2019-09-10 07:44:57,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=506, Invalid=2044, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:44:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41768 states. [2019-09-10 07:44:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41768 to 5218. [2019-09-10 07:44:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-09-10 07:44:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7707 transitions. [2019-09-10 07:44:58,326 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7707 transitions. Word has length 75 [2019-09-10 07:44:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:58,327 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 7707 transitions. [2019-09-10 07:44:58,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:44:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7707 transitions. [2019-09-10 07:44:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:44:58,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:58,329 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 07:44:58,329 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1158728316, now seen corresponding path program 1 times [2019-09-10 07:44:58,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:58,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:58,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:58,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:58,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:00,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:00,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 07:45:00,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:00,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:45:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:45:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:45:00,092 INFO L87 Difference]: Start difference. First operand 5218 states and 7707 transitions. Second operand 24 states. [2019-09-10 07:45:00,835 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:45:01,003 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:45:01,211 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:45:01,464 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:45:01,727 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:45:02,066 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 07:45:02,475 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-10 07:45:02,978 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-09-10 07:45:03,234 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:45:03,491 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:45:03,735 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:45:04,297 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 07:45:04,758 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 07:45:05,020 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:45:05,405 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:45:06,672 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:45:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:07,013 INFO L93 Difference]: Finished difference Result 30482 states and 45196 transitions. [2019-09-10 07:45:07,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:45:07,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-10 07:45:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:07,059 INFO L225 Difference]: With dead ends: 30482 [2019-09-10 07:45:07,059 INFO L226 Difference]: Without dead ends: 30482 [2019-09-10 07:45:07,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:45:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30482 states. [2019-09-10 07:45:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30482 to 5210. [2019-09-10 07:45:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5210 states. [2019-09-10 07:45:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7693 transitions. [2019-09-10 07:45:07,317 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7693 transitions. Word has length 75 [2019-09-10 07:45:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:07,318 INFO L475 AbstractCegarLoop]: Abstraction has 5210 states and 7693 transitions. [2019-09-10 07:45:07,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:45:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7693 transitions. [2019-09-10 07:45:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:45:07,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:07,321 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 07:45:07,322 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1924985380, now seen corresponding path program 1 times [2019-09-10 07:45:07,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:07,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:07,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:08,269 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:45:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:09,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 07:45:09,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:09,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:45:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:45:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:45:09,108 INFO L87 Difference]: Start difference. First operand 5210 states and 7693 transitions. Second operand 25 states. [2019-09-10 07:45:10,099 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:45:10,336 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:45:10,695 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-10 07:45:11,093 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 07:45:11,653 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2019-09-10 07:45:12,264 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2019-09-10 07:45:12,507 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 07:45:12,675 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 07:45:13,020 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:45:13,449 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:45:13,648 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:45:13,986 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:45:14,451 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:45:14,888 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:45:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:16,873 INFO L93 Difference]: Finished difference Result 18896 states and 27976 transitions. [2019-09-10 07:45:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 07:45:16,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-09-10 07:45:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:16,896 INFO L225 Difference]: With dead ends: 18896 [2019-09-10 07:45:16,897 INFO L226 Difference]: Without dead ends: 18896 [2019-09-10 07:45:16,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:45:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18896 states. [2019-09-10 07:45:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18896 to 5218. [2019-09-10 07:45:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-09-10 07:45:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7699 transitions. [2019-09-10 07:45:17,054 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7699 transitions. Word has length 75 [2019-09-10 07:45:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:17,054 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 7699 transitions. [2019-09-10 07:45:17,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:45:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7699 transitions. [2019-09-10 07:45:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:17,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:17,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:17,056 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash -766941881, now seen corresponding path program 1 times [2019-09-10 07:45:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:17,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:45:17,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:17,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:45:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:45:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:45:17,163 INFO L87 Difference]: Start difference. First operand 5218 states and 7699 transitions. Second operand 4 states. [2019-09-10 07:45:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:17,220 INFO L93 Difference]: Finished difference Result 7391 states and 10833 transitions. [2019-09-10 07:45:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:45:17,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-10 07:45:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:17,228 INFO L225 Difference]: With dead ends: 7391 [2019-09-10 07:45:17,228 INFO L226 Difference]: Without dead ends: 7391 [2019-09-10 07:45:17,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:45:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2019-09-10 07:45:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 7339. [2019-09-10 07:45:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7339 states. [2019-09-10 07:45:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7339 states to 7339 states and 10782 transitions. [2019-09-10 07:45:17,322 INFO L78 Accepts]: Start accepts. Automaton has 7339 states and 10782 transitions. Word has length 76 [2019-09-10 07:45:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:17,322 INFO L475 AbstractCegarLoop]: Abstraction has 7339 states and 10782 transitions. [2019-09-10 07:45:17,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:45:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7339 states and 10782 transitions. [2019-09-10 07:45:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:17,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:17,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:17,324 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 95389579, now seen corresponding path program 1 times [2019-09-10 07:45:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:17,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:17,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:45:17,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:17,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:45:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:45:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:45:17,403 INFO L87 Difference]: Start difference. First operand 7339 states and 10782 transitions. Second operand 5 states. [2019-09-10 07:45:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:17,465 INFO L93 Difference]: Finished difference Result 11889 states and 17334 transitions. [2019-09-10 07:45:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:45:17,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 07:45:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:17,478 INFO L225 Difference]: With dead ends: 11889 [2019-09-10 07:45:17,478 INFO L226 Difference]: Without dead ends: 11889 [2019-09-10 07:45:17,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:45:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2019-09-10 07:45:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 7411. [2019-09-10 07:45:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7411 states. [2019-09-10 07:45:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 10830 transitions. [2019-09-10 07:45:17,600 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 10830 transitions. Word has length 76 [2019-09-10 07:45:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:17,600 INFO L475 AbstractCegarLoop]: Abstraction has 7411 states and 10830 transitions. [2019-09-10 07:45:17,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:45:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 10830 transitions. [2019-09-10 07:45:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:17,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:17,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:17,602 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 318042292, now seen corresponding path program 1 times [2019-09-10 07:45:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:17,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:45:18,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:18,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:45:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:45:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:45:18,584 INFO L87 Difference]: Start difference. First operand 7411 states and 10830 transitions. Second operand 16 states. [2019-09-10 07:45:18,745 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-09-10 07:45:19,197 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 07:45:19,415 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:45:19,575 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-09-10 07:45:19,863 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 07:45:20,180 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-10 07:45:20,507 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-09-10 07:45:20,666 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:45:20,830 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:45:21,135 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 07:45:21,335 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:45:21,533 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:45:21,815 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 07:45:22,478 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:45:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:22,968 INFO L93 Difference]: Finished difference Result 32493 states and 47560 transitions. [2019-09-10 07:45:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:45:22,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-10 07:45:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:22,996 INFO L225 Difference]: With dead ends: 32493 [2019-09-10 07:45:22,996 INFO L226 Difference]: Without dead ends: 32493 [2019-09-10 07:45:22,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:45:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32493 states. [2019-09-10 07:45:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32493 to 7356. [2019-09-10 07:45:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-09-10 07:45:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 10762 transitions. [2019-09-10 07:45:23,212 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 10762 transitions. Word has length 76 [2019-09-10 07:45:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:23,212 INFO L475 AbstractCegarLoop]: Abstraction has 7356 states and 10762 transitions. [2019-09-10 07:45:23,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:45:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 10762 transitions. [2019-09-10 07:45:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:23,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:23,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:23,214 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash 58971285, now seen corresponding path program 1 times [2019-09-10 07:45:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:23,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:23,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:45:23,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:23,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:45:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:45:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:45:23,731 INFO L87 Difference]: Start difference. First operand 7356 states and 10762 transitions. Second operand 13 states. [2019-09-10 07:45:24,135 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:45:24,292 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:45:24,454 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:45:24,761 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:45:24,983 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:45:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:25,351 INFO L93 Difference]: Finished difference Result 29021 states and 42576 transitions. [2019-09-10 07:45:25,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:45:25,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-10 07:45:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:25,377 INFO L225 Difference]: With dead ends: 29021 [2019-09-10 07:45:25,377 INFO L226 Difference]: Without dead ends: 29021 [2019-09-10 07:45:25,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:45:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29021 states. [2019-09-10 07:45:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29021 to 7337. [2019-09-10 07:45:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7337 states. [2019-09-10 07:45:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7337 states to 7337 states and 10736 transitions. [2019-09-10 07:45:25,561 INFO L78 Accepts]: Start accepts. Automaton has 7337 states and 10736 transitions. Word has length 76 [2019-09-10 07:45:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:25,561 INFO L475 AbstractCegarLoop]: Abstraction has 7337 states and 10736 transitions. [2019-09-10 07:45:25,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:45:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7337 states and 10736 transitions. [2019-09-10 07:45:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:25,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:25,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:25,563 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash -568372595, now seen corresponding path program 1 times [2019-09-10 07:45:25,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 07:45:26,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:26,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:45:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:45:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:45:26,264 INFO L87 Difference]: Start difference. First operand 7337 states and 10736 transitions. Second operand 25 states. [2019-09-10 07:45:26,438 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:45:27,481 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:45:27,651 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:45:27,857 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:45:28,068 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:45:28,364 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:45:28,905 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 07:45:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:33,302 INFO L93 Difference]: Finished difference Result 57521 states and 84473 transitions. [2019-09-10 07:45:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 07:45:33,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2019-09-10 07:45:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:33,358 INFO L225 Difference]: With dead ends: 57521 [2019-09-10 07:45:33,358 INFO L226 Difference]: Without dead ends: 57521 [2019-09-10 07:45:33,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=471, Invalid=2609, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:45:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57521 states. [2019-09-10 07:45:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57521 to 7345. [2019-09-10 07:45:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-09-10 07:45:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 10744 transitions. [2019-09-10 07:45:33,637 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 10744 transitions. Word has length 76 [2019-09-10 07:45:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:33,637 INFO L475 AbstractCegarLoop]: Abstraction has 7345 states and 10744 transitions. [2019-09-10 07:45:33,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:45:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 10744 transitions. [2019-09-10 07:45:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:45:33,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:33,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:33,639 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1372189360, now seen corresponding path program 1 times [2019-09-10 07:45:33,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:33,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:33,967 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-10 07:45:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:45:34,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:34,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:45:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:45:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:45:34,398 INFO L87 Difference]: Start difference. First operand 7345 states and 10744 transitions. Second operand 14 states. [2019-09-10 07:45:35,119 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:45:35,390 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:45:35,666 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:45:35,841 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:45:36,027 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:36,268 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:45:36,437 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:36,673 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:45:36,966 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:45:37,437 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:45:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:37,628 INFO L93 Difference]: Finished difference Result 43400 states and 63704 transitions. [2019-09-10 07:45:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:45:37,629 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-10 07:45:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:37,665 INFO L225 Difference]: With dead ends: 43400 [2019-09-10 07:45:37,666 INFO L226 Difference]: Without dead ends: 43400 [2019-09-10 07:45:37,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:45:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43400 states. [2019-09-10 07:45:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43400 to 7330. [2019-09-10 07:45:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7330 states. [2019-09-10 07:45:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7330 states to 7330 states and 10724 transitions. [2019-09-10 07:45:37,871 INFO L78 Accepts]: Start accepts. Automaton has 7330 states and 10724 transitions. Word has length 76 [2019-09-10 07:45:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:37,871 INFO L475 AbstractCegarLoop]: Abstraction has 7330 states and 10724 transitions. [2019-09-10 07:45:37,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:45:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7330 states and 10724 transitions. [2019-09-10 07:45:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:45:37,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:37,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:37,872 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:37,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1118678398, now seen corresponding path program 1 times [2019-09-10 07:45:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:37,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:37,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:38,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:38,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:45:38,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:38,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:45:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:45:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:45:38,537 INFO L87 Difference]: Start difference. First operand 7330 states and 10724 transitions. Second operand 16 states. [2019-09-10 07:45:39,195 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:45:39,328 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:45:39,475 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:45:39,697 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:45:39,904 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:45:40,120 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:45:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:41,309 INFO L93 Difference]: Finished difference Result 24885 states and 36479 transitions. [2019-09-10 07:45:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:45:41,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-10 07:45:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:41,332 INFO L225 Difference]: With dead ends: 24885 [2019-09-10 07:45:41,333 INFO L226 Difference]: Without dead ends: 24885 [2019-09-10 07:45:41,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:45:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24885 states. [2019-09-10 07:45:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24885 to 7322. [2019-09-10 07:45:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7322 states. [2019-09-10 07:45:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 10714 transitions. [2019-09-10 07:45:41,458 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 10714 transitions. Word has length 77 [2019-09-10 07:45:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:41,458 INFO L475 AbstractCegarLoop]: Abstraction has 7322 states and 10714 transitions. [2019-09-10 07:45:41,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:45:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 10714 transitions. [2019-09-10 07:45:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:45:41,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:41,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:41,460 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 508032095, now seen corresponding path program 1 times [2019-09-10 07:45:41,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:41,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:41,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:42,413 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:45:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:42,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:42,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:45:42,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:42,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:45:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:45:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:45:42,838 INFO L87 Difference]: Start difference. First operand 7322 states and 10714 transitions. Second operand 20 states. [2019-09-10 07:45:43,332 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:45:43,500 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:45:43,781 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:45:43,912 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:45:44,044 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:45:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:46,196 INFO L93 Difference]: Finished difference Result 32271 states and 47372 transitions. [2019-09-10 07:45:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:45:46,196 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2019-09-10 07:45:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:46,223 INFO L225 Difference]: With dead ends: 32271 [2019-09-10 07:45:46,224 INFO L226 Difference]: Without dead ends: 32271 [2019-09-10 07:45:46,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:45:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32271 states. [2019-09-10 07:45:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32271 to 7326. [2019-09-10 07:45:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-09-10 07:45:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 10718 transitions. [2019-09-10 07:45:46,382 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 10718 transitions. Word has length 77 [2019-09-10 07:45:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:46,383 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 10718 transitions. [2019-09-10 07:45:46,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:45:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 10718 transitions. [2019-09-10 07:45:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:45:46,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:46,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:46,384 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 127485420, now seen corresponding path program 1 times [2019-09-10 07:45:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:46,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:46,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:47,204 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 07:45:47,485 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:45:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:47,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:47,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:45:47,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:47,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:45:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:45:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:45:47,807 INFO L87 Difference]: Start difference. First operand 7326 states and 10718 transitions. Second operand 22 states. [2019-09-10 07:45:48,700 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:45:48,987 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:45:49,166 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:45:49,466 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:45:49,646 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:45:49,816 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:45:49,982 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:45:50,159 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:45:50,297 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:45:50,867 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:45:51,050 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:45:51,236 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:45:51,406 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:45:51,665 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:45:53,282 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:45:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:54,514 INFO L93 Difference]: Finished difference Result 63644 states and 93266 transitions. [2019-09-10 07:45:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 07:45:54,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2019-09-10 07:45:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:54,586 INFO L225 Difference]: With dead ends: 63644 [2019-09-10 07:45:54,586 INFO L226 Difference]: Without dead ends: 63644 [2019-09-10 07:45:54,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:45:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63644 states. [2019-09-10 07:45:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63644 to 7321. [2019-09-10 07:45:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-09-10 07:45:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 10712 transitions. [2019-09-10 07:45:54,859 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 10712 transitions. Word has length 78 [2019-09-10 07:45:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:54,859 INFO L475 AbstractCegarLoop]: Abstraction has 7321 states and 10712 transitions. [2019-09-10 07:45:54,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:45:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 10712 transitions. [2019-09-10 07:45:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:45:54,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:54,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:54,860 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -417589621, now seen corresponding path program 1 times [2019-09-10 07:45:54,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:54,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:54,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:55,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:45:55,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:55,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:45:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:45:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:45:55,716 INFO L87 Difference]: Start difference. First operand 7321 states and 10712 transitions. Second operand 14 states. [2019-09-10 07:45:56,372 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:45:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:57,535 INFO L93 Difference]: Finished difference Result 29010 states and 42638 transitions. [2019-09-10 07:45:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:45:57,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-09-10 07:45:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:57,562 INFO L225 Difference]: With dead ends: 29010 [2019-09-10 07:45:57,562 INFO L226 Difference]: Without dead ends: 28996 [2019-09-10 07:45:57,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:45:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28996 states. [2019-09-10 07:45:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28996 to 7220. [2019-09-10 07:45:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7220 states. [2019-09-10 07:45:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 10571 transitions. [2019-09-10 07:45:57,784 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 10571 transitions. Word has length 78 [2019-09-10 07:45:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:57,784 INFO L475 AbstractCegarLoop]: Abstraction has 7220 states and 10571 transitions. [2019-09-10 07:45:57,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:45:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 10571 transitions. [2019-09-10 07:45:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:45:57,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:57,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:57,789 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1533827547, now seen corresponding path program 1 times [2019-09-10 07:45:57,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:57,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:57,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:57,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:57,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:57,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:57,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:57,840 INFO L87 Difference]: Start difference. First operand 7220 states and 10571 transitions. Second operand 3 states. [2019-09-10 07:45:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:57,881 INFO L93 Difference]: Finished difference Result 10094 states and 14678 transitions. [2019-09-10 07:45:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:57,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:45:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:57,893 INFO L225 Difference]: With dead ends: 10094 [2019-09-10 07:45:57,894 INFO L226 Difference]: Without dead ends: 10094 [2019-09-10 07:45:57,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2019-09-10 07:45:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 9660. [2019-09-10 07:45:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9660 states. [2019-09-10 07:45:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 14083 transitions. [2019-09-10 07:45:58,013 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 14083 transitions. Word has length 102 [2019-09-10 07:45:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:58,014 INFO L475 AbstractCegarLoop]: Abstraction has 9660 states and 14083 transitions. [2019-09-10 07:45:58,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 14083 transitions. [2019-09-10 07:45:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:45:58,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:58,016 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:58,016 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1825781106, now seen corresponding path program 1 times [2019-09-10 07:45:58,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:45:58,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:45:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:45:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:45:58,082 INFO L87 Difference]: Start difference. First operand 9660 states and 14083 transitions. Second operand 5 states. [2019-09-10 07:45:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:58,358 INFO L93 Difference]: Finished difference Result 41922 states and 59590 transitions. [2019-09-10 07:45:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:45:58,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:45:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:58,395 INFO L225 Difference]: With dead ends: 41922 [2019-09-10 07:45:58,396 INFO L226 Difference]: Without dead ends: 41922 [2019-09-10 07:45:58,396 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 07:45:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41922 states. [2019-09-10 07:45:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41922 to 20052. [2019-09-10 07:45:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20052 states. [2019-09-10 07:45:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20052 states to 20052 states and 28891 transitions. [2019-09-10 07:45:58,638 INFO L78 Accepts]: Start accepts. Automaton has 20052 states and 28891 transitions. Word has length 102 [2019-09-10 07:45:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:58,639 INFO L475 AbstractCegarLoop]: Abstraction has 20052 states and 28891 transitions. [2019-09-10 07:45:58,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:45:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 20052 states and 28891 transitions. [2019-09-10 07:45:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:45:58,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:58,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:58,641 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -539707692, now seen corresponding path program 1 times [2019-09-10 07:45:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:58,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:58,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:58,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:58,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:45:58,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:58,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:45:58,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:45:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:45:58,709 INFO L87 Difference]: Start difference. First operand 20052 states and 28891 transitions. Second operand 5 states. [2019-09-10 07:45:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:59,035 INFO L93 Difference]: Finished difference Result 78954 states and 109966 transitions. [2019-09-10 07:45:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:45:59,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:45:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:59,115 INFO L225 Difference]: With dead ends: 78954 [2019-09-10 07:45:59,115 INFO L226 Difference]: Without dead ends: 78954 [2019-09-10 07:45:59,115 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 07:45:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78954 states. [2019-09-10 07:45:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78954 to 41700. [2019-09-10 07:45:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41700 states. [2019-09-10 07:45:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41700 states to 41700 states and 59371 transitions. [2019-09-10 07:45:59,627 INFO L78 Accepts]: Start accepts. Automaton has 41700 states and 59371 transitions. Word has length 102 [2019-09-10 07:45:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:59,627 INFO L475 AbstractCegarLoop]: Abstraction has 41700 states and 59371 transitions. [2019-09-10 07:45:59,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:45:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 41700 states and 59371 transitions. [2019-09-10 07:45:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:45:59,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:59,629 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:59,629 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1344439136, now seen corresponding path program 1 times [2019-09-10 07:45:59,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:59,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:59,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:00,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:00,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:46:00,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:00,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:46:00,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:46:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:46:00,380 INFO L87 Difference]: Start difference. First operand 41700 states and 59371 transitions. Second operand 5 states. [2019-09-10 07:46:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:00,862 INFO L93 Difference]: Finished difference Result 69884 states and 96786 transitions. [2019-09-10 07:46:00,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:46:00,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:46:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:00,955 INFO L225 Difference]: With dead ends: 69884 [2019-09-10 07:46:00,955 INFO L226 Difference]: Without dead ends: 69884 [2019-09-10 07:46:00,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69884 states. [2019-09-10 07:46:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69884 to 44110. [2019-09-10 07:46:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44110 states. [2019-09-10 07:46:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44110 states to 44110 states and 61771 transitions. [2019-09-10 07:46:01,455 INFO L78 Accepts]: Start accepts. Automaton has 44110 states and 61771 transitions. Word has length 102 [2019-09-10 07:46:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:01,456 INFO L475 AbstractCegarLoop]: Abstraction has 44110 states and 61771 transitions. [2019-09-10 07:46:01,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:46:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44110 states and 61771 transitions. [2019-09-10 07:46:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:46:01,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:01,466 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:01,466 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1294947765, now seen corresponding path program 1 times [2019-09-10 07:46:01,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:01,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:01,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:01,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:01,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:01,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:01,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:01,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:01,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:01,527 INFO L87 Difference]: Start difference. First operand 44110 states and 61771 transitions. Second operand 3 states. [2019-09-10 07:46:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:01,635 INFO L93 Difference]: Finished difference Result 40656 states and 55724 transitions. [2019-09-10 07:46:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:01,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:46:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:01,685 INFO L225 Difference]: With dead ends: 40656 [2019-09-10 07:46:01,686 INFO L226 Difference]: Without dead ends: 40656 [2019-09-10 07:46:01,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40656 states. [2019-09-10 07:46:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40656 to 30962. [2019-09-10 07:46:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30962 states. [2019-09-10 07:46:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30962 states to 30962 states and 42267 transitions. [2019-09-10 07:46:01,984 INFO L78 Accepts]: Start accepts. Automaton has 30962 states and 42267 transitions. Word has length 126 [2019-09-10 07:46:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:01,984 INFO L475 AbstractCegarLoop]: Abstraction has 30962 states and 42267 transitions. [2019-09-10 07:46:01,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 30962 states and 42267 transitions. [2019-09-10 07:46:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:46:01,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:01,990 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:01,990 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1061077742, now seen corresponding path program 1 times [2019-09-10 07:46:01,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:01,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:02,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:02,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:02,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:02,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:02,048 INFO L87 Difference]: Start difference. First operand 30962 states and 42267 transitions. Second operand 3 states. [2019-09-10 07:46:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:02,195 INFO L93 Difference]: Finished difference Result 58744 states and 78316 transitions. [2019-09-10 07:46:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:02,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:46:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:02,266 INFO L225 Difference]: With dead ends: 58744 [2019-09-10 07:46:02,266 INFO L226 Difference]: Without dead ends: 58744 [2019-09-10 07:46:02,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58744 states. [2019-09-10 07:46:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58744 to 54314. [2019-09-10 07:46:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54314 states. [2019-09-10 07:46:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54314 states to 54314 states and 73239 transitions. [2019-09-10 07:46:02,851 INFO L78 Accepts]: Start accepts. Automaton has 54314 states and 73239 transitions. Word has length 127 [2019-09-10 07:46:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:02,851 INFO L475 AbstractCegarLoop]: Abstraction has 54314 states and 73239 transitions. [2019-09-10 07:46:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 54314 states and 73239 transitions. [2019-09-10 07:46:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:46:02,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:02,858 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:02,858 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash -33343144, now seen corresponding path program 1 times [2019-09-10 07:46:02,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:02,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:02,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:02,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:02,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:02,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:02,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:02,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:02,916 INFO L87 Difference]: Start difference. First operand 54314 states and 73239 transitions. Second operand 3 states. [2019-09-10 07:46:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:03,081 INFO L93 Difference]: Finished difference Result 65180 states and 86244 transitions. [2019-09-10 07:46:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:03,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:46:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:03,150 INFO L225 Difference]: With dead ends: 65180 [2019-09-10 07:46:03,150 INFO L226 Difference]: Without dead ends: 65180 [2019-09-10 07:46:03,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65180 states. [2019-09-10 07:46:03,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65180 to 61572. [2019-09-10 07:46:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61572 states. [2019-09-10 07:46:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61572 states to 61572 states and 82427 transitions. [2019-09-10 07:46:03,732 INFO L78 Accepts]: Start accepts. Automaton has 61572 states and 82427 transitions. Word has length 128 [2019-09-10 07:46:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:03,733 INFO L475 AbstractCegarLoop]: Abstraction has 61572 states and 82427 transitions. [2019-09-10 07:46:03,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 61572 states and 82427 transitions. [2019-09-10 07:46:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:46:03,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:03,738 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:03,738 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1326570750, now seen corresponding path program 1 times [2019-09-10 07:46:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:03,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:03,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:03,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:03,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:46:03,963 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [174], [177], [180], [183], [185], [187], [190], [193], [197], [199], [202], [203], [205], [208], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [350], [353], [356], [358], [366], [371], [373], [376], [392], [397], [462], [463], [467], [468], [469] [2019-09-10 07:46:04,042 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:04,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:04,205 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:04,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:04,865 INFO L272 AbstractInterpreter]: Visited 115 different actions 611 times. Merged at 45 different actions 428 times. Widened at 17 different actions 64 times. Performed 2093 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2093 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 74 fixpoints after 17 different actions. Largest state had 126 variables. [2019-09-10 07:46:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:04,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:04,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:04,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:06,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:06,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:46:06,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:06,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:06,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:08,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:08,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 07:46:08,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:08,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:46:08,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:46:08,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:46:08,278 INFO L87 Difference]: Start difference. First operand 61572 states and 82427 transitions. Second operand 21 states. [2019-09-10 07:46:12,165 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-09-10 07:46:14,457 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 07:46:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:16,424 INFO L93 Difference]: Finished difference Result 337608 states and 442560 transitions. [2019-09-10 07:46:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 07:46:16,425 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2019-09-10 07:46:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:17,351 INFO L225 Difference]: With dead ends: 337608 [2019-09-10 07:46:17,351 INFO L226 Difference]: Without dead ends: 337608 [2019-09-10 07:46:17,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 217 SyntacticMatches, 20 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1462, Invalid=5848, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 07:46:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337608 states. [2019-09-10 07:46:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337608 to 124786. [2019-09-10 07:46:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124786 states. [2019-09-10 07:46:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124786 states to 124786 states and 166059 transitions. [2019-09-10 07:46:20,755 INFO L78 Accepts]: Start accepts. Automaton has 124786 states and 166059 transitions. Word has length 129 [2019-09-10 07:46:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:20,755 INFO L475 AbstractCegarLoop]: Abstraction has 124786 states and 166059 transitions. [2019-09-10 07:46:20,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:46:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 124786 states and 166059 transitions. [2019-09-10 07:46:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:46:20,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:20,774 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:20,774 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -391212107, now seen corresponding path program 1 times [2019-09-10 07:46:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:20,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:20,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:20,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:20,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:20,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:20,860 INFO L87 Difference]: Start difference. First operand 124786 states and 166059 transitions. Second operand 3 states. [2019-09-10 07:46:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:21,131 INFO L93 Difference]: Finished difference Result 90092 states and 117392 transitions. [2019-09-10 07:46:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:21,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 07:46:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:21,291 INFO L225 Difference]: With dead ends: 90092 [2019-09-10 07:46:21,291 INFO L226 Difference]: Without dead ends: 90092 [2019-09-10 07:46:21,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90092 states. [2019-09-10 07:46:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90092 to 87882. [2019-09-10 07:46:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87882 states. [2019-09-10 07:46:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87882 states to 87882 states and 114511 transitions. [2019-09-10 07:46:25,091 INFO L78 Accepts]: Start accepts. Automaton has 87882 states and 114511 transitions. Word has length 129 [2019-09-10 07:46:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:25,093 INFO L475 AbstractCegarLoop]: Abstraction has 87882 states and 114511 transitions. [2019-09-10 07:46:25,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 87882 states and 114511 transitions. [2019-09-10 07:46:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:46:25,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:25,107 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:25,107 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash 211875779, now seen corresponding path program 1 times [2019-09-10 07:46:25,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:25,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:25,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:25,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:25,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:25,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:46:25,462 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [185], [187], [190], [193], [197], [199], [202], [203], [205], [208], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [350], [353], [356], [358], [366], [371], [373], [376], [382], [387], [462], [463], [467], [468], [469] [2019-09-10 07:46:25,472 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:25,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:25,507 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:25,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:25,979 INFO L272 AbstractInterpreter]: Visited 115 different actions 574 times. Merged at 45 different actions 396 times. Widened at 17 different actions 49 times. Performed 1902 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1902 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 69 fixpoints after 15 different actions. Largest state had 126 variables. [2019-09-10 07:46:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:25,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:25,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:25,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:26,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:26,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:46:26,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:26,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 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): Stream closed [2019-09-10 07:46:28,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:28,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:46:28,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:28,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:46:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:46:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:46:28,531 INFO L87 Difference]: Start difference. First operand 87882 states and 114511 transitions. Second operand 20 states. [2019-09-10 07:46:34,119 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-09-10 07:46:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:37,671 INFO L93 Difference]: Finished difference Result 401534 states and 522031 transitions. [2019-09-10 07:46:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 07:46:37,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2019-09-10 07:46:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:38,178 INFO L225 Difference]: With dead ends: 401534 [2019-09-10 07:46:38,178 INFO L226 Difference]: Without dead ends: 401534 [2019-09-10 07:46:38,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 203 SyntacticMatches, 36 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4019 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2182, Invalid=8530, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 07:46:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401534 states. [2019-09-10 07:46:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401534 to 136506. [2019-09-10 07:46:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136506 states. [2019-09-10 07:46:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136506 states to 136506 states and 177467 transitions. [2019-09-10 07:46:41,031 INFO L78 Accepts]: Start accepts. Automaton has 136506 states and 177467 transitions. Word has length 129 [2019-09-10 07:46:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:41,032 INFO L475 AbstractCegarLoop]: Abstraction has 136506 states and 177467 transitions. [2019-09-10 07:46:41,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:46:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 136506 states and 177467 transitions. [2019-09-10 07:46:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:46:41,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:41,043 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:41,043 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1482548929, now seen corresponding path program 1 times [2019-09-10 07:46:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:41,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:41,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:41,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:41,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:41,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:46:41,457 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [193], [197], [199], [202], [203], [205], [208], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [350], [353], [356], [358], [366], [371], [373], [376], [402], [407], [462], [463], [467], [468], [469] [2019-09-10 07:46:41,465 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:41,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:41,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:41,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:41,942 INFO L272 AbstractInterpreter]: Visited 115 different actions 630 times. Merged at 45 different actions 444 times. Widened at 16 different actions 62 times. Performed 2086 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2086 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 77 fixpoints after 15 different actions. Largest state had 126 variables. [2019-09-10 07:46:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:41,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:41,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:41,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:41,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:41,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:42,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:46:42,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:42,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:42,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:42,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:42,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:44,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:44,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 38 [2019-09-10 07:46:44,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:44,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:46:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:46:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:46:44,856 INFO L87 Difference]: Start difference. First operand 136506 states and 177467 transitions. Second operand 27 states. [2019-09-10 07:46:50,495 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:46:50,964 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:46:51,175 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:46:51,450 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 07:46:51,928 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 07:46:52,101 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:46:52,281 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 07:46:52,815 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:46:53,036 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:46:53,398 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:46:54,786 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:46:54,991 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:46:55,391 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 07:46:55,730 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 07:46:56,032 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:46:56,181 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:46:57,996 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 07:46:59,673 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:47:00,466 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:47:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:03,137 INFO L93 Difference]: Finished difference Result 718035 states and 919778 transitions. [2019-09-10 07:47:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 07:47:03,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-09-10 07:47:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:04,062 INFO L225 Difference]: With dead ends: 718035 [2019-09-10 07:47:04,062 INFO L226 Difference]: Without dead ends: 718035 [2019-09-10 07:47:04,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 217 SyntacticMatches, 20 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6429 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=3122, Invalid=16338, Unknown=0, NotChecked=0, Total=19460 [2019-09-10 07:47:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718035 states. [2019-09-10 07:47:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718035 to 274222. [2019-09-10 07:47:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274222 states. [2019-09-10 07:47:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274222 states to 274222 states and 354553 transitions. [2019-09-10 07:47:14,009 INFO L78 Accepts]: Start accepts. Automaton has 274222 states and 354553 transitions. Word has length 129 [2019-09-10 07:47:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:14,010 INFO L475 AbstractCegarLoop]: Abstraction has 274222 states and 354553 transitions. [2019-09-10 07:47:14,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 07:47:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 274222 states and 354553 transitions. [2019-09-10 07:47:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:47:14,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:14,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:14,029 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1840774400, now seen corresponding path program 1 times [2019-09-10 07:47:14,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:14,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:14,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:14,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:14,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:47:14,313 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [193], [197], [199], [202], [203], [205], [208], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [350], [353], [356], [358], [366], [371], [373], [376], [412], [417], [462], [463], [467], [468], [469] [2019-09-10 07:47:14,323 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:14,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:14,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:14,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:14,682 INFO L272 AbstractInterpreter]: Visited 115 different actions 574 times. Merged at 45 different actions 396 times. Widened at 17 different actions 49 times. Performed 1925 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1925 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 69 fixpoints after 15 different actions. Largest state had 126 variables. [2019-09-10 07:47:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:14,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:14,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:14,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:47:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:14,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:14,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 07:47:14,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:47:14,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:47:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:15,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 18 [2019-09-10 07:47:15,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:15,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:47:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:47:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:47:15,906 INFO L87 Difference]: Start difference. First operand 274222 states and 354553 transitions. Second operand 15 states. [2019-09-10 07:47:19,297 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:47:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:25,099 INFO L93 Difference]: Finished difference Result 723896 states and 926986 transitions. [2019-09-10 07:47:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:47:25,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2019-09-10 07:47:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:26,007 INFO L225 Difference]: With dead ends: 723896 [2019-09-10 07:47:26,007 INFO L226 Difference]: Without dead ends: 723896 [2019-09-10 07:47:26,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=965, Invalid=4005, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:47:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723896 states. [2019-09-10 07:47:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723896 to 308236. [2019-09-10 07:47:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308236 states. [2019-09-10 07:47:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308236 states to 308236 states and 395237 transitions. [2019-09-10 07:47:37,949 INFO L78 Accepts]: Start accepts. Automaton has 308236 states and 395237 transitions. Word has length 129 [2019-09-10 07:47:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:37,949 INFO L475 AbstractCegarLoop]: Abstraction has 308236 states and 395237 transitions. [2019-09-10 07:47:37,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:47:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 308236 states and 395237 transitions. [2019-09-10 07:47:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:47:37,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:37,956 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:37,956 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:37,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1612099274, now seen corresponding path program 1 times [2019-09-10 07:47:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:38,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:38,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:38,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:47:38,267 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [234], [236], [239], [247], [249], [252], [255], [260], [262], [264], [267], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [392], [397], [462], [463], [467], [468], [469] [2019-09-10 07:47:38,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:38,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:38,283 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:38,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:38,579 INFO L272 AbstractInterpreter]: Visited 117 different actions 611 times. Merged at 48 different actions 434 times. Widened at 17 different actions 69 times. Performed 2013 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2013 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 14 different actions. Largest state had 126 variables. [2019-09-10 07:47:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:38,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:38,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:38,580 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 07:47:38,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:38,596 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 07:47:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:47:38,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:38,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:38,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:38,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:39,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:40,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-10 07:47:40,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:47:40,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:40,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:47:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:47:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:47:40,538 INFO L87 Difference]: Start difference. First operand 308236 states and 395237 transitions. Second operand 21 states. [2019-09-10 07:47:44,189 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:47:44,369 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:47:44,892 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 07:47:45,486 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:47:45,776 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:47:45,937 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 07:47:46,157 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:46,792 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:47,005 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:47:47,607 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:47:50,828 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:47:51,362 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:51,528 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:51,717 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:47:51,914 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:47:53,576 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 07:47:53,767 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 07:47:53,980 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 07:47:54,194 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 07:47:54,423 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:47:54,734 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:47:54,937 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:47:55,165 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 07:47:55,401 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 07:47:55,644 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:47:55,796 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:47:56,029 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:47:56,365 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:47:56,729 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:47:57,101 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:47:57,582 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:47:57,852 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:47:58,569 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:47:59,727 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 07:47:59,892 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:48:00,218 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:48:00,385 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 07:48:00,577 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:48:00,742 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 07:48:00,918 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-10 07:48:01,461 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:48:01,625 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:48:02,002 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:48:02,157 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:48:02,560 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 07:48:02,758 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:48:03,165 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 07:48:03,343 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 07:48:04,109 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:48:04,551 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:48:04,839 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:48:05,453 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:48:05,612 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:48:05,807 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:48:05,967 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:48:06,468 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:48:06,806 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:48:06,962 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:48:07,599 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-10 07:48:07,798 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-10 07:48:08,118 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 07:48:08,313 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:48:08,733 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 07:48:08,912 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:48:09,279 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 07:48:09,464 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:48:10,284 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 07:48:10,441 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:48:10,837 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 07:48:11,013 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:48:11,868 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 07:48:12,053 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:48:12,955 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:48:13,163 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:48:13,459 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:48:14,154 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 07:48:14,360 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:48:14,606 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:48:15,148 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 07:48:15,471 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:48:15,658 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 07:48:15,876 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:48:16,067 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:48:16,297 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:48:16,772 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 07:48:17,136 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:48:17,310 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:48:17,709 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:48:17,998 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 07:48:18,266 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:48:18,777 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 07:48:18,975 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 07:48:19,148 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 07:48:19,326 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 07:48:19,964 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:48:20,165 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:48:20,335 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:48:20,495 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:48:20,669 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:48:20,851 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:48:21,161 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:48:21,337 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:48:21,488 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 07:48:21,673 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:48:21,855 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:48:22,149 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:48:22,350 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:48:22,526 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:48:22,764 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:48:22,968 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:48:23,513 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 07:48:24,037 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:48:24,277 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:48:24,470 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:48:24,646 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:48:25,195 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:48:25,479 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:48:25,701 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:48:25,907 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:48:26,433 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:48:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:28,891 INFO L93 Difference]: Finished difference Result 933944 states and 1181033 transitions. [2019-09-10 07:48:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-09-10 07:48:28,892 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2019-09-10 07:48:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:30,066 INFO L225 Difference]: With dead ends: 933944 [2019-09-10 07:48:30,066 INFO L226 Difference]: Without dead ends: 933944 [2019-09-10 07:48:30,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29370 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=9499, Invalid=66953, Unknown=0, NotChecked=0, Total=76452 [2019-09-10 07:48:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933944 states. [2019-09-10 07:48:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933944 to 629872. [2019-09-10 07:48:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629872 states. [2019-09-10 07:48:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629872 states to 629872 states and 801595 transitions. [2019-09-10 07:48:47,530 INFO L78 Accepts]: Start accepts. Automaton has 629872 states and 801595 transitions. Word has length 130 [2019-09-10 07:48:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:47,530 INFO L475 AbstractCegarLoop]: Abstraction has 629872 states and 801595 transitions. [2019-09-10 07:48:47,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 629872 states and 801595 transitions. [2019-09-10 07:48:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:48:47,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:47,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:47,539 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -121596895, now seen corresponding path program 1 times [2019-09-10 07:48:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:47,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:47,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:47,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:47,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:47,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:48:47,874 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [382], [387], [462], [463], [467], [468], [469] [2019-09-10 07:48:47,876 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:47,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:47,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:48,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:48,099 INFO L272 AbstractInterpreter]: Visited 117 different actions 472 times. Merged at 48 different actions 310 times. Widened at 13 different actions 30 times. Performed 1688 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1688 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 8 different actions. Largest state had 126 variables. [2019-09-10 07:48:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:48,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:48,099 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 07:48:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:48:48,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:48,539 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:48,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2019-09-10 07:48:48,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:48,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:48:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:48:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:48:48,982 INFO L87 Difference]: Start difference. First operand 629872 states and 801595 transitions. Second operand 23 states. [2019-09-10 07:48:54,951 WARN L188 SmtUtils]: Spent 5.53 s on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-09-10 07:49:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:00,657 INFO L93 Difference]: Finished difference Result 1173294 states and 1500187 transitions. [2019-09-10 07:49:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:49:00,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2019-09-10 07:49:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:09,188 INFO L225 Difference]: With dead ends: 1173294 [2019-09-10 07:49:09,188 INFO L226 Difference]: Without dead ends: 1173294 [2019-09-10 07:49:09,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 243 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=657, Invalid=2205, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:49:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173294 states. [2019-09-10 07:49:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173294 to 764178. [2019-09-10 07:49:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764178 states. [2019-09-10 07:49:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764178 states to 764178 states and 972928 transitions. [2019-09-10 07:49:27,750 INFO L78 Accepts]: Start accepts. Automaton has 764178 states and 972928 transitions. Word has length 130 [2019-09-10 07:49:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:27,750 INFO L475 AbstractCegarLoop]: Abstraction has 764178 states and 972928 transitions. [2019-09-10 07:49:27,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:49:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 764178 states and 972928 transitions. [2019-09-10 07:49:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:49:27,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:27,762 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:27,762 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1149756290, now seen corresponding path program 1 times [2019-09-10 07:49:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:27,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:27,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:28,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:28,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:49:28,292 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [234], [236], [239], [242], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [321], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [412], [417], [462], [463], [467], [468], [469] [2019-09-10 07:49:28,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:28,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:28,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:36,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:36,022 INFO L272 AbstractInterpreter]: Visited 117 different actions 588 times. Merged at 48 different actions 414 times. Widened at 15 different actions 64 times. Performed 2029 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2029 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 12 different actions. Largest state had 126 variables. [2019-09-10 07:49:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:36,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:36,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:36,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:49:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:36,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:36,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:49:36,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:36,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:38,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:38,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:39,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:39,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:45,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:45,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 34 [2019-09-10 07:49:45,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:45,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:49:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:49:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:49:45,400 INFO L87 Difference]: Start difference. First operand 764178 states and 972928 transitions. Second operand 28 states. [2019-09-10 07:49:46,032 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:49:46,523 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:49:47,016 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:49:47,485 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:49:48,367 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:49:48,676 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:49:48,842 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 07:49:49,240 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:49:49,457 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:49:50,188 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:49:50,427 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:49:50,637 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:49:50,826 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:49:51,840 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:49:52,136 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:49:52,347 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 07:49:52,888 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 07:49:54,071 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 07:49:54,836 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:49:55,127 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 07:49:55,646 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:49:56,010 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-10 07:49:56,508 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:49:57,027 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 07:49:57,652 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:49:57,914 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:49:58,603 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 07:49:58,901 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:50:03,284 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:50:03,978 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:50:04,274 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-10 07:50:04,733 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 07:50:05,109 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-09-10 07:50:05,543 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:50:07,086 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:50:07,549 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:50:08,008 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 07:50:08,425 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:50:08,785 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-10 07:50:09,253 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 07:50:09,693 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-09-10 07:50:10,266 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:50:10,743 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:50:11,257 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:50:12,186 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:50:12,939 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:50:13,192 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:50:13,417 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:50:13,723 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:50:14,025 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:50:14,833 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:50:15,074 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:50:15,640 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:50:16,857 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 07:50:17,068 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:50:17,662 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 07:50:18,453 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 07:50:18,974 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:50:19,368 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:50:21,150 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 07:50:21,416 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:50:22,032 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:50:22,713 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 07:50:23,034 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:50:23,440 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:50:23,757 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:50:24,501 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:50:25,423 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 07:50:26,871 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:50:27,544 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:50:27,788 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:50:28,057 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:50:28,259 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:50:28,504 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:50:28,731 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:50:28,962 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:50:30,636 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:50:31,346 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:50:32,113 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:50:32,522 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 07:50:33,065 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:50:34,360 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:50:34,949 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 07:50:35,434 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-10 07:50:36,937 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 07:50:37,579 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:50:38,030 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:50:38,525 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 07:50:40,345 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:50:40,821 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 07:50:41,146 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-10 07:50:41,476 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-10 07:50:42,344 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:50:42,698 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 07:50:43,088 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-09-10 07:50:43,440 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-09-10 07:50:43,704 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:50:45,965 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 07:50:46,338 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:50:46,701 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:50:46,958 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:50:47,267 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 07:50:47,675 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 07:50:47,938 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:50:49,149 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:50:49,437 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-09-10 07:50:49,820 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 07:50:50,171 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-09-10 07:50:50,691 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 07:50:51,104 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-09-10 07:51:04,123 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:51:04,486 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 07:51:04,749 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:51:05,130 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:51:05,408 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-09-10 07:51:05,779 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 07:51:06,173 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-10 07:51:06,459 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:51:06,931 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 07:51:07,369 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-09-10 07:51:07,661 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 07:51:07,912 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:51:08,472 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:51:08,745 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 07:51:08,942 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:51:09,165 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 07:51:09,431 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:51:09,659 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 07:51:09,942 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:51:10,570 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 07:51:11,208 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 07:51:11,472 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-10 07:51:12,140 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-09-10 07:51:13,358 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-09-10 07:51:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:13,810 INFO L93 Difference]: Finished difference Result 3082979 states and 3924174 transitions. [2019-09-10 07:51:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2019-09-10 07:51:13,811 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 130 [2019-09-10 07:51:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:18,547 INFO L225 Difference]: With dead ends: 3082979 [2019-09-10 07:51:18,547 INFO L226 Difference]: Without dead ends: 3082979 [2019-09-10 07:51:18,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 182 SyntacticMatches, 63 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26495 ImplicationChecksByTransitivity, 73.8s TimeCoverageRelationStatistics Valid=8732, Invalid=57574, Unknown=0, NotChecked=0, Total=66306 [2019-09-10 07:51:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082979 states. [2019-09-10 07:51:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082979 to 1037066. [2019-09-10 07:51:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037066 states. [2019-09-10 07:52:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037066 states to 1037066 states and 1325449 transitions. [2019-09-10 07:52:08,535 INFO L78 Accepts]: Start accepts. Automaton has 1037066 states and 1325449 transitions. Word has length 130 [2019-09-10 07:52:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:08,535 INFO L475 AbstractCegarLoop]: Abstraction has 1037066 states and 1325449 transitions. [2019-09-10 07:52:08,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:52:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1037066 states and 1325449 transitions. [2019-09-10 07:52:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:52:08,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:08,547 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:08,547 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash 670756996, now seen corresponding path program 1 times [2019-09-10 07:52:08,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:08,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:08,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:08,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:08,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:08,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:52:08,800 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [412], [417], [462], [463], [467], [468], [469] [2019-09-10 07:52:08,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:08,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:08,818 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:19,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:19,280 INFO L272 AbstractInterpreter]: Visited 117 different actions 524 times. Merged at 48 different actions 358 times. Widened at 16 different actions 53 times. Performed 1927 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1927 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 9 different actions. Largest state had 126 variables. [2019-09-10 07:52:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:19,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:19,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:19,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:19,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:19,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:52:19,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:19,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:20,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:20,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:52:21,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:52:21,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:21,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:52:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:52:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:52:21,964 INFO L87 Difference]: Start difference. First operand 1037066 states and 1325449 transitions. Second operand 21 states. [2019-09-10 07:52:22,191 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:52:22,805 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:52:23,385 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:52:23,695 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:52:24,053 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:52:24,373 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:52:24,752 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:52:25,440 WARN L188 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:52:26,210 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:52:26,678 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:52:27,035 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:52:27,415 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:52:27,958 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 07:52:28,266 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 07:52:28,688 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:52:29,158 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:52:29,709 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:52:30,128 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:52:30,676 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:52:31,254 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:52:31,665 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:52:32,213 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:52:32,642 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:52:33,113 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:52:33,608 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 07:52:34,068 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:52:34,470 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:52:34,799 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:52:35,219 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:52:35,592 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 07:52:36,156 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-09-10 07:52:36,578 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:52:37,078 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:52:37,527 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:52:37,999 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 07:52:38,546 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:52:38,986 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 07:52:39,520 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 07:52:39,987 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:52:40,700 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 07:52:41,410 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-10 07:52:41,882 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 07:52:42,319 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:52:42,934 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 07:52:43,391 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:52:43,829 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-10 07:52:44,293 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-09-10 07:52:44,747 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 07:52:45,149 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 07:52:45,548 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:52:46,014 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 07:52:46,340 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:52:46,950 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 07:52:47,320 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 07:52:47,868 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 07:52:48,426 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 07:52:49,002 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:52:49,550 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:52:49,994 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 07:52:50,419 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:52:50,960 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:52:51,614 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:52:52,166 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:52:52,543 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:52:52,989 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 07:52:53,426 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 07:52:54,227 WARN L188 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:52:54,607 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:52:55,004 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:52:55,465 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:52:56,248 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 07:52:57,004 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-09-10 07:52:57,346 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 07:52:57,951 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 07:52:58,406 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:52:58,885 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:52:59,381 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 07:52:59,834 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:53:00,207 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:53:00,626 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:53:02,675 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 07:53:02,984 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:53:03,363 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:53:03,740 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:53:04,117 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 07:53:04,447 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:53:04,855 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:53:05,214 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:53:05,633 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:53:06,383 WARN L188 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:53:06,970 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:53:07,414 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:53:07,872 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 07:53:08,590 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 07:53:09,121 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:53:09,612 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 07:53:10,023 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 07:53:10,610 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 07:53:10,965 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:53:11,383 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:53:11,864 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 07:53:12,264 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:53:12,694 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 07:53:13,640 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:53:14,077 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:53:14,511 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 07:53:14,972 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:53:15,581 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 07:53:16,093 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:53:16,618 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-10 07:53:17,069 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:53:17,538 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-10 07:53:17,944 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 07:53:18,405 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-10 07:53:18,862 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:53:19,268 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:53:19,687 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-10 07:53:20,085 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:53:20,659 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-10 07:53:21,165 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:53:21,748 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 07:53:22,041 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:53:22,366 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:53:22,751 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 07:53:23,290 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 07:53:23,753 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 07:53:24,201 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 07:53:24,602 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 07:53:25,024 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 07:53:25,618 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:53:26,080 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 07:53:26,567 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-09-10 07:53:27,218 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-09-10 07:53:27,869 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:53:28,384 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 07:53:30,802 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:53:31,288 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:53:33,842 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 07:53:34,358 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 07:53:34,904 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-09-10 07:53:35,400 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 07:53:37,801 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:53:38,425 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 07:53:39,021 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:53:39,402 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 07:53:39,935 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 07:53:40,643 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 07:53:40,988 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 07:53:41,474 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:53:41,963 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:53:42,419 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:53:42,818 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 07:53:43,225 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 07:53:43,571 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:53:44,073 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:53:44,593 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:53:45,101 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:53:45,528 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 07:54:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:08,205 INFO L93 Difference]: Finished difference Result 2940765 states and 3710858 transitions. [2019-09-10 07:54:08,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-10 07:54:08,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2019-09-10 07:54:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:11,754 INFO L225 Difference]: With dead ends: 2940765 [2019-09-10 07:54:11,754 INFO L226 Difference]: Without dead ends: 2940765 [2019-09-10 07:54:11,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 220 SyntacticMatches, 22 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12364 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=7189, Invalid=29483, Unknown=0, NotChecked=0, Total=36672 [2019-09-10 07:54:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940765 states. [2019-09-10 07:54:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940765 to 1296608. [2019-09-10 07:54:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296608 states. [2019-09-10 07:54:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296608 states to 1296608 states and 1657537 transitions. [2019-09-10 07:54:57,611 INFO L78 Accepts]: Start accepts. Automaton has 1296608 states and 1657537 transitions. Word has length 130 [2019-09-10 07:54:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:57,612 INFO L475 AbstractCegarLoop]: Abstraction has 1296608 states and 1657537 transitions. [2019-09-10 07:54:57,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:54:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1296608 states and 1657537 transitions. [2019-09-10 07:54:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:54:57,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:57,625 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:54:57,625 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash 443378440, now seen corresponding path program 1 times [2019-09-10 07:54:57,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:57,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:54:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:54:57,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:54:57,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:54:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:54:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:54:57,680 INFO L87 Difference]: Start difference. First operand 1296608 states and 1657537 transitions. Second operand 3 states.